/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:11:18,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:11:18,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:11:18,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:11:18,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:11:18,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:11:18,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:11:18,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:11:18,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:11:18,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:11:18,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:11:18,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:11:18,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:11:18,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:11:18,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:11:18,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:11:18,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:11:18,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:11:18,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:11:18,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:11:18,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:11:18,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:11:18,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:11:18,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:11:18,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:11:18,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:11:18,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:11:18,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:11:18,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:11:18,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:11:18,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:11:18,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:11:18,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:11:18,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:11:18,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:11:18,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:11:18,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:11:18,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:11:18,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:11:18,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:11:18,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:11:18,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:11:18,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:11:18,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:11:18,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:11:18,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:11:18,356 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:11:18,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:11:18,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:11:18,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:11:18,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:11:18,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:11:18,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:11:18,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:11:18,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:11:18,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:11:18,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:11:18,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:11:18,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:11:18,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:11:18,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:11:18,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:11:18,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:11:18,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:11:18,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:11:18,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:11:18,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:11:18,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:11:18,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:11:18,361 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:11:18,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:11:18,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:11:18,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:11:18,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:11:18,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:11:18,701 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:11:18,701 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:11:18,702 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-27 05:11:18,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907ba5bcb/7fb67ba4c9de40708291e7f60c8836a1/FLAGf580259cd [2019-12-27 05:11:19,372 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:11:19,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-27 05:11:19,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907ba5bcb/7fb67ba4c9de40708291e7f60c8836a1/FLAGf580259cd [2019-12-27 05:11:19,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907ba5bcb/7fb67ba4c9de40708291e7f60c8836a1 [2019-12-27 05:11:19,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:11:19,610 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:11:19,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:11:19,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:11:19,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:11:19,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:11:19" (1/1) ... [2019-12-27 05:11:19,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6390492a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:19, skipping insertion in model container [2019-12-27 05:11:19,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:11:19" (1/1) ... [2019-12-27 05:11:19,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:11:19,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:11:20,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:11:20,280 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:11:20,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:11:20,462 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:11:20,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20 WrapperNode [2019-12-27 05:11:20,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:11:20,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:11:20,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:11:20,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:11:20,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:11:20,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:11:20,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:11:20,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:11:20,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... [2019-12-27 05:11:20,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:11:20,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:11:20,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:11:20,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:11:20,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:11:20,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:11:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:11:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:11:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:11:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:11:20,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:11:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:11:20,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:11:20,655 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:11:20,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:11:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:11:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:11:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:11:20,658 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:11:21,440 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:11:21,440 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:11:21,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:11:21 BoogieIcfgContainer [2019-12-27 05:11:21,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:11:21,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:11:21,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:11:21,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:11:21,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:11:19" (1/3) ... [2019-12-27 05:11:21,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6a69df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:11:21, skipping insertion in model container [2019-12-27 05:11:21,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:20" (2/3) ... [2019-12-27 05:11:21,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6a69df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:11:21, skipping insertion in model container [2019-12-27 05:11:21,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:11:21" (3/3) ... [2019-12-27 05:11:21,451 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_rmo.oepc.i [2019-12-27 05:11:21,461 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:11:21,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:11:21,469 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:11:21,470 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:11:21,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,523 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,523 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,556 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,556 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,603 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,612 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:11:21,633 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:11:21,653 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:11:21,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:11:21,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:11:21,654 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:11:21,654 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:11:21,654 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:11:21,654 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:11:21,654 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:11:21,671 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 05:11:21,672 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 05:11:21,797 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 05:11:21,798 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:11:21,816 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:11:21,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 05:11:21,897 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 05:11:21,897 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:11:21,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:11:21,926 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:11:21,927 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:11:25,553 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 05:11:25,700 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 05:11:25,730 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82443 [2019-12-27 05:11:25,730 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:11:25,737 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 05:11:46,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120992 states. [2019-12-27 05:11:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 120992 states. [2019-12-27 05:11:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:11:46,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:46,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:11:46,822 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash 913992, now seen corresponding path program 1 times [2019-12-27 05:11:46,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:46,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604346751] [2019-12-27 05:11:46,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:11:47,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604346751] [2019-12-27 05:11:47,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:47,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:11:47,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764534246] [2019-12-27 05:11:47,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:47,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:47,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:47,108 INFO L87 Difference]: Start difference. First operand 120992 states. Second operand 3 states. [2019-12-27 05:11:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:50,794 INFO L93 Difference]: Finished difference Result 119518 states and 508908 transitions. [2019-12-27 05:11:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:50,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:11:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:51,442 INFO L225 Difference]: With dead ends: 119518 [2019-12-27 05:11:51,442 INFO L226 Difference]: Without dead ends: 112056 [2019-12-27 05:11:51,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:57,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112056 states. [2019-12-27 05:12:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112056 to 112056. [2019-12-27 05:12:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112056 states. [2019-12-27 05:12:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112056 states to 112056 states and 476484 transitions. [2019-12-27 05:12:05,128 INFO L78 Accepts]: Start accepts. Automaton has 112056 states and 476484 transitions. Word has length 3 [2019-12-27 05:12:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:05,129 INFO L462 AbstractCegarLoop]: Abstraction has 112056 states and 476484 transitions. [2019-12-27 05:12:05,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 112056 states and 476484 transitions. [2019-12-27 05:12:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:12:05,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:05,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:05,133 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:05,133 INFO L82 PathProgramCache]: Analyzing trace with hash -224245043, now seen corresponding path program 1 times [2019-12-27 05:12:05,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:05,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347056875] [2019-12-27 05:12:05,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:05,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347056875] [2019-12-27 05:12:05,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:05,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:05,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983927355] [2019-12-27 05:12:05,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:12:05,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:05,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:12:05,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:05,237 INFO L87 Difference]: Start difference. First operand 112056 states and 476484 transitions. Second operand 4 states. [2019-12-27 05:12:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:06,568 INFO L93 Difference]: Finished difference Result 173434 states and 704626 transitions. [2019-12-27 05:12:06,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:12:06,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:12:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:12,598 INFO L225 Difference]: With dead ends: 173434 [2019-12-27 05:12:12,599 INFO L226 Difference]: Without dead ends: 173385 [2019-12-27 05:12:12,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173385 states. [2019-12-27 05:12:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173385 to 158867. [2019-12-27 05:12:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158867 states. [2019-12-27 05:12:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158867 states to 158867 states and 654272 transitions. [2019-12-27 05:12:20,700 INFO L78 Accepts]: Start accepts. Automaton has 158867 states and 654272 transitions. Word has length 11 [2019-12-27 05:12:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:20,701 INFO L462 AbstractCegarLoop]: Abstraction has 158867 states and 654272 transitions. [2019-12-27 05:12:20,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:12:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 158867 states and 654272 transitions. [2019-12-27 05:12:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:12:20,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:20,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:20,708 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:20,709 INFO L82 PathProgramCache]: Analyzing trace with hash 703391521, now seen corresponding path program 1 times [2019-12-27 05:12:20,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:20,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084695197] [2019-12-27 05:12:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:26,105 WARN L192 SmtUtils]: Spent 5.33 s on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 05:12:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:26,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084695197] [2019-12-27 05:12:26,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:26,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:26,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868109857] [2019-12-27 05:12:26,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:26,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:26,109 INFO L87 Difference]: Start difference. First operand 158867 states and 654272 transitions. Second operand 3 states. [2019-12-27 05:12:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:26,235 INFO L93 Difference]: Finished difference Result 34345 states and 110990 transitions. [2019-12-27 05:12:26,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:26,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:12:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:26,293 INFO L225 Difference]: With dead ends: 34345 [2019-12-27 05:12:26,293 INFO L226 Difference]: Without dead ends: 34345 [2019-12-27 05:12:26,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2019-12-27 05:12:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 34345. [2019-12-27 05:12:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34345 states. [2019-12-27 05:12:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34345 states to 34345 states and 110990 transitions. [2019-12-27 05:12:26,960 INFO L78 Accepts]: Start accepts. Automaton has 34345 states and 110990 transitions. Word has length 13 [2019-12-27 05:12:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:26,961 INFO L462 AbstractCegarLoop]: Abstraction has 34345 states and 110990 transitions. [2019-12-27 05:12:26,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 34345 states and 110990 transitions. [2019-12-27 05:12:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:12:26,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:26,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:26,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1949648440, now seen corresponding path program 1 times [2019-12-27 05:12:26,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:26,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742295624] [2019-12-27 05:12:26,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:27,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742295624] [2019-12-27 05:12:27,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:27,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:27,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378949247] [2019-12-27 05:12:27,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:12:27,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:27,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:12:27,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:27,105 INFO L87 Difference]: Start difference. First operand 34345 states and 110990 transitions. Second operand 4 states. [2019-12-27 05:12:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:27,471 INFO L93 Difference]: Finished difference Result 41968 states and 135253 transitions. [2019-12-27 05:12:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:12:27,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:12:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:27,538 INFO L225 Difference]: With dead ends: 41968 [2019-12-27 05:12:27,538 INFO L226 Difference]: Without dead ends: 41968 [2019-12-27 05:12:27,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41968 states. [2019-12-27 05:12:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41968 to 37815. [2019-12-27 05:12:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37815 states. [2019-12-27 05:12:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37815 states to 37815 states and 122278 transitions. [2019-12-27 05:12:28,484 INFO L78 Accepts]: Start accepts. Automaton has 37815 states and 122278 transitions. Word has length 16 [2019-12-27 05:12:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:28,485 INFO L462 AbstractCegarLoop]: Abstraction has 37815 states and 122278 transitions. [2019-12-27 05:12:28,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:12:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37815 states and 122278 transitions. [2019-12-27 05:12:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:12:28,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:28,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:28,495 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1390855021, now seen corresponding path program 1 times [2019-12-27 05:12:28,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:28,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602240488] [2019-12-27 05:12:28,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:28,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602240488] [2019-12-27 05:12:28,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:28,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:12:28,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707282321] [2019-12-27 05:12:28,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:12:28,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:12:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:28,595 INFO L87 Difference]: Start difference. First operand 37815 states and 122278 transitions. Second operand 5 states. [2019-12-27 05:12:29,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:29,328 INFO L93 Difference]: Finished difference Result 48568 states and 154032 transitions. [2019-12-27 05:12:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:12:29,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:12:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:29,439 INFO L225 Difference]: With dead ends: 48568 [2019-12-27 05:12:29,439 INFO L226 Difference]: Without dead ends: 48561 [2019-12-27 05:12:29,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48561 states. [2019-12-27 05:12:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48561 to 37245. [2019-12-27 05:12:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37245 states. [2019-12-27 05:12:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37245 states to 37245 states and 120198 transitions. [2019-12-27 05:12:30,633 INFO L78 Accepts]: Start accepts. Automaton has 37245 states and 120198 transitions. Word has length 22 [2019-12-27 05:12:30,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:30,634 INFO L462 AbstractCegarLoop]: Abstraction has 37245 states and 120198 transitions. [2019-12-27 05:12:30,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:12:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 37245 states and 120198 transitions. [2019-12-27 05:12:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:12:30,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:30,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:30,646 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash 896315521, now seen corresponding path program 1 times [2019-12-27 05:12:30,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:30,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219953873] [2019-12-27 05:12:30,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:30,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219953873] [2019-12-27 05:12:30,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:30,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:12:30,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313050306] [2019-12-27 05:12:30,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:12:30,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:12:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:30,711 INFO L87 Difference]: Start difference. First operand 37245 states and 120198 transitions. Second operand 4 states. [2019-12-27 05:12:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:30,776 INFO L93 Difference]: Finished difference Result 14946 states and 45537 transitions. [2019-12-27 05:12:30,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:12:30,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:12:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:30,804 INFO L225 Difference]: With dead ends: 14946 [2019-12-27 05:12:30,804 INFO L226 Difference]: Without dead ends: 14946 [2019-12-27 05:12:30,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:12:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2019-12-27 05:12:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 14702. [2019-12-27 05:12:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-12-27 05:12:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 44841 transitions. [2019-12-27 05:12:31,114 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 44841 transitions. Word has length 25 [2019-12-27 05:12:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:31,114 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 44841 transitions. [2019-12-27 05:12:31,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:12:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 44841 transitions. [2019-12-27 05:12:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:12:31,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:31,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:31,125 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080207, now seen corresponding path program 1 times [2019-12-27 05:12:31,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:31,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125090300] [2019-12-27 05:12:31,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:31,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125090300] [2019-12-27 05:12:31,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:31,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:12:31,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650016093] [2019-12-27 05:12:31,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:31,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:31,185 INFO L87 Difference]: Start difference. First operand 14702 states and 44841 transitions. Second operand 3 states. [2019-12-27 05:12:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:31,282 INFO L93 Difference]: Finished difference Result 21048 states and 63094 transitions. [2019-12-27 05:12:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:31,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:12:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:31,316 INFO L225 Difference]: With dead ends: 21048 [2019-12-27 05:12:31,316 INFO L226 Difference]: Without dead ends: 21048 [2019-12-27 05:12:31,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21048 states. [2019-12-27 05:12:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21048 to 15496. [2019-12-27 05:12:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-12-27 05:12:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 47121 transitions. [2019-12-27 05:12:31,587 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 47121 transitions. Word has length 27 [2019-12-27 05:12:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:31,587 INFO L462 AbstractCegarLoop]: Abstraction has 15496 states and 47121 transitions. [2019-12-27 05:12:31,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 47121 transitions. [2019-12-27 05:12:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:12:31,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:31,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:31,598 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:31,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1291585692, now seen corresponding path program 1 times [2019-12-27 05:12:31,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:31,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112792047] [2019-12-27 05:12:31,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:31,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112792047] [2019-12-27 05:12:31,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:31,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:31,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393953141] [2019-12-27 05:12:31,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:12:31,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:12:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:12:31,719 INFO L87 Difference]: Start difference. First operand 15496 states and 47121 transitions. Second operand 6 states. [2019-12-27 05:12:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:32,477 INFO L93 Difference]: Finished difference Result 39367 states and 118228 transitions. [2019-12-27 05:12:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:12:32,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:12:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:32,538 INFO L225 Difference]: With dead ends: 39367 [2019-12-27 05:12:32,538 INFO L226 Difference]: Without dead ends: 39367 [2019-12-27 05:12:32,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:12:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39367 states. [2019-12-27 05:12:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39367 to 22126. [2019-12-27 05:12:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-12-27 05:12:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 68213 transitions. [2019-12-27 05:12:33,219 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 68213 transitions. Word has length 27 [2019-12-27 05:12:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:33,220 INFO L462 AbstractCegarLoop]: Abstraction has 22126 states and 68213 transitions. [2019-12-27 05:12:33,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:12:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 68213 transitions. [2019-12-27 05:12:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:12:33,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:33,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:33,237 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 859272137, now seen corresponding path program 1 times [2019-12-27 05:12:33,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:33,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476981735] [2019-12-27 05:12:33,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:33,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476981735] [2019-12-27 05:12:33,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:33,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:33,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910243949] [2019-12-27 05:12:33,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:12:33,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:12:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:12:33,352 INFO L87 Difference]: Start difference. First operand 22126 states and 68213 transitions. Second operand 6 states. [2019-12-27 05:12:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:34,182 INFO L93 Difference]: Finished difference Result 36723 states and 110142 transitions. [2019-12-27 05:12:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:12:34,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 05:12:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:34,252 INFO L225 Difference]: With dead ends: 36723 [2019-12-27 05:12:34,252 INFO L226 Difference]: Without dead ends: 36723 [2019-12-27 05:12:34,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:12:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36723 states. [2019-12-27 05:12:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36723 to 21684. [2019-12-27 05:12:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21684 states. [2019-12-27 05:12:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21684 states to 21684 states and 67048 transitions. [2019-12-27 05:12:34,778 INFO L78 Accepts]: Start accepts. Automaton has 21684 states and 67048 transitions. Word has length 28 [2019-12-27 05:12:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:34,779 INFO L462 AbstractCegarLoop]: Abstraction has 21684 states and 67048 transitions. [2019-12-27 05:12:34,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:12:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21684 states and 67048 transitions. [2019-12-27 05:12:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:12:34,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:34,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:34,802 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:34,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:34,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1529980999, now seen corresponding path program 1 times [2019-12-27 05:12:34,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:34,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541855338] [2019-12-27 05:12:34,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:34,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541855338] [2019-12-27 05:12:34,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:34,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:12:34,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358194047] [2019-12-27 05:12:34,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:34,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:34,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:34,909 INFO L87 Difference]: Start difference. First operand 21684 states and 67048 transitions. Second operand 7 states. [2019-12-27 05:12:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:36,444 INFO L93 Difference]: Finished difference Result 48727 states and 145636 transitions. [2019-12-27 05:12:36,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:12:36,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:12:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:36,516 INFO L225 Difference]: With dead ends: 48727 [2019-12-27 05:12:36,517 INFO L226 Difference]: Without dead ends: 48727 [2019-12-27 05:12:36,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:12:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48727 states. [2019-12-27 05:12:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48727 to 23131. [2019-12-27 05:12:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23131 states. [2019-12-27 05:12:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 71461 transitions. [2019-12-27 05:12:37,245 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 71461 transitions. Word has length 33 [2019-12-27 05:12:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:37,245 INFO L462 AbstractCegarLoop]: Abstraction has 23131 states and 71461 transitions. [2019-12-27 05:12:37,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 71461 transitions. [2019-12-27 05:12:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:12:37,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:37,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:37,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:37,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1030046023, now seen corresponding path program 2 times [2019-12-27 05:12:37,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:37,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356206788] [2019-12-27 05:12:37,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:37,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356206788] [2019-12-27 05:12:37,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:37,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:37,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175456768] [2019-12-27 05:12:37,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:37,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:37,389 INFO L87 Difference]: Start difference. First operand 23131 states and 71461 transitions. Second operand 8 states. [2019-12-27 05:12:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:39,239 INFO L93 Difference]: Finished difference Result 67362 states and 198335 transitions. [2019-12-27 05:12:39,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:12:39,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:12:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:39,344 INFO L225 Difference]: With dead ends: 67362 [2019-12-27 05:12:39,344 INFO L226 Difference]: Without dead ends: 67362 [2019-12-27 05:12:39,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:12:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67362 states. [2019-12-27 05:12:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67362 to 22138. [2019-12-27 05:12:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22138 states. [2019-12-27 05:12:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22138 states to 22138 states and 68414 transitions. [2019-12-27 05:12:40,072 INFO L78 Accepts]: Start accepts. Automaton has 22138 states and 68414 transitions. Word has length 33 [2019-12-27 05:12:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:40,073 INFO L462 AbstractCegarLoop]: Abstraction has 22138 states and 68414 transitions. [2019-12-27 05:12:40,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 22138 states and 68414 transitions. [2019-12-27 05:12:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:12:40,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:40,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:40,097 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2058952212, now seen corresponding path program 1 times [2019-12-27 05:12:40,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:40,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127498134] [2019-12-27 05:12:40,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:40,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127498134] [2019-12-27 05:12:40,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:40,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:12:40,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766491743] [2019-12-27 05:12:40,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:40,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:40,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:40,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:40,220 INFO L87 Difference]: Start difference. First operand 22138 states and 68414 transitions. Second operand 7 states. [2019-12-27 05:12:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:41,700 INFO L93 Difference]: Finished difference Result 40064 states and 119955 transitions. [2019-12-27 05:12:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:12:41,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 05:12:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:41,761 INFO L225 Difference]: With dead ends: 40064 [2019-12-27 05:12:41,761 INFO L226 Difference]: Without dead ends: 40064 [2019-12-27 05:12:41,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:12:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40064 states. [2019-12-27 05:12:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40064 to 20938. [2019-12-27 05:12:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20938 states. [2019-12-27 05:12:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20938 states to 20938 states and 64898 transitions. [2019-12-27 05:12:42,234 INFO L78 Accepts]: Start accepts. Automaton has 20938 states and 64898 transitions. Word has length 34 [2019-12-27 05:12:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:42,234 INFO L462 AbstractCegarLoop]: Abstraction has 20938 states and 64898 transitions. [2019-12-27 05:12:42,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 20938 states and 64898 transitions. [2019-12-27 05:12:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 05:12:42,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:42,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:42,252 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:42,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:42,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1960715392, now seen corresponding path program 2 times [2019-12-27 05:12:42,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:42,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328721098] [2019-12-27 05:12:42,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:42,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328721098] [2019-12-27 05:12:42,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:42,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:42,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114406814] [2019-12-27 05:12:42,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:42,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:42,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:42,364 INFO L87 Difference]: Start difference. First operand 20938 states and 64898 transitions. Second operand 8 states. [2019-12-27 05:12:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:44,236 INFO L93 Difference]: Finished difference Result 44758 states and 132164 transitions. [2019-12-27 05:12:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 05:12:44,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 05:12:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:44,326 INFO L225 Difference]: With dead ends: 44758 [2019-12-27 05:12:44,327 INFO L226 Difference]: Without dead ends: 44758 [2019-12-27 05:12:44,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-12-27 05:12:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44758 states. [2019-12-27 05:12:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44758 to 18926. [2019-12-27 05:12:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18926 states. [2019-12-27 05:12:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18926 states to 18926 states and 58684 transitions. [2019-12-27 05:12:45,084 INFO L78 Accepts]: Start accepts. Automaton has 18926 states and 58684 transitions. Word has length 34 [2019-12-27 05:12:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:45,084 INFO L462 AbstractCegarLoop]: Abstraction has 18926 states and 58684 transitions. [2019-12-27 05:12:45,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18926 states and 58684 transitions. [2019-12-27 05:12:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:12:45,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:45,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:45,104 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1601798089, now seen corresponding path program 1 times [2019-12-27 05:12:45,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:45,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326466803] [2019-12-27 05:12:45,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:45,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326466803] [2019-12-27 05:12:45,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:45,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:45,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441029969] [2019-12-27 05:12:45,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:45,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:45,171 INFO L87 Difference]: Start difference. First operand 18926 states and 58684 transitions. Second operand 3 states. [2019-12-27 05:12:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:45,330 INFO L93 Difference]: Finished difference Result 32927 states and 102451 transitions. [2019-12-27 05:12:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:45,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:12:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:45,361 INFO L225 Difference]: With dead ends: 32927 [2019-12-27 05:12:45,362 INFO L226 Difference]: Without dead ends: 16957 [2019-12-27 05:12:45,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16957 states. [2019-12-27 05:12:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16957 to 16891. [2019-12-27 05:12:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16891 states. [2019-12-27 05:12:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16891 states to 16891 states and 51543 transitions. [2019-12-27 05:12:45,623 INFO L78 Accepts]: Start accepts. Automaton has 16891 states and 51543 transitions. Word has length 39 [2019-12-27 05:12:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:45,624 INFO L462 AbstractCegarLoop]: Abstraction has 16891 states and 51543 transitions. [2019-12-27 05:12:45,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 16891 states and 51543 transitions. [2019-12-27 05:12:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:12:45,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:45,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:45,644 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1603062761, now seen corresponding path program 2 times [2019-12-27 05:12:45,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:45,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779583099] [2019-12-27 05:12:45,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:45,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779583099] [2019-12-27 05:12:45,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:45,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:12:45,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40259337] [2019-12-27 05:12:45,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:45,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:45,690 INFO L87 Difference]: Start difference. First operand 16891 states and 51543 transitions. Second operand 3 states. [2019-12-27 05:12:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:45,752 INFO L93 Difference]: Finished difference Result 16890 states and 51541 transitions. [2019-12-27 05:12:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:45,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:12:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:45,779 INFO L225 Difference]: With dead ends: 16890 [2019-12-27 05:12:45,779 INFO L226 Difference]: Without dead ends: 16890 [2019-12-27 05:12:45,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16890 states. [2019-12-27 05:12:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16890 to 16890. [2019-12-27 05:12:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16890 states. [2019-12-27 05:12:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16890 states to 16890 states and 51541 transitions. [2019-12-27 05:12:46,035 INFO L78 Accepts]: Start accepts. Automaton has 16890 states and 51541 transitions. Word has length 39 [2019-12-27 05:12:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:46,036 INFO L462 AbstractCegarLoop]: Abstraction has 16890 states and 51541 transitions. [2019-12-27 05:12:46,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 16890 states and 51541 transitions. [2019-12-27 05:12:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:12:46,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:46,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:46,052 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash 417642434, now seen corresponding path program 1 times [2019-12-27 05:12:46,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:46,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352632527] [2019-12-27 05:12:46,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:46,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352632527] [2019-12-27 05:12:46,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:46,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:12:46,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29338677] [2019-12-27 05:12:46,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:12:46,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:46,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:12:46,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:46,141 INFO L87 Difference]: Start difference. First operand 16890 states and 51541 transitions. Second operand 5 states. [2019-12-27 05:12:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:46,758 INFO L93 Difference]: Finished difference Result 28008 states and 83346 transitions. [2019-12-27 05:12:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:12:46,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:12:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:46,798 INFO L225 Difference]: With dead ends: 28008 [2019-12-27 05:12:46,799 INFO L226 Difference]: Without dead ends: 28008 [2019-12-27 05:12:46,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-12-27 05:12:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 23150. [2019-12-27 05:12:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23150 states. [2019-12-27 05:12:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23150 states to 23150 states and 70163 transitions. [2019-12-27 05:12:47,175 INFO L78 Accepts]: Start accepts. Automaton has 23150 states and 70163 transitions. Word has length 40 [2019-12-27 05:12:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:47,175 INFO L462 AbstractCegarLoop]: Abstraction has 23150 states and 70163 transitions. [2019-12-27 05:12:47,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:12:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23150 states and 70163 transitions. [2019-12-27 05:12:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:12:47,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:47,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:47,403 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:47,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1415326004, now seen corresponding path program 2 times [2019-12-27 05:12:47,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:47,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439883893] [2019-12-27 05:12:47,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:47,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439883893] [2019-12-27 05:12:47,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:47,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:47,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905866706] [2019-12-27 05:12:47,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:12:47,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:47,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:12:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:12:47,488 INFO L87 Difference]: Start difference. First operand 23150 states and 70163 transitions. Second operand 6 states. [2019-12-27 05:12:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:48,306 INFO L93 Difference]: Finished difference Result 38676 states and 116246 transitions. [2019-12-27 05:12:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 05:12:48,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 05:12:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:48,363 INFO L225 Difference]: With dead ends: 38676 [2019-12-27 05:12:48,363 INFO L226 Difference]: Without dead ends: 38676 [2019-12-27 05:12:48,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38676 states. [2019-12-27 05:12:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38676 to 27096. [2019-12-27 05:12:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27096 states. [2019-12-27 05:12:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27096 states to 27096 states and 81946 transitions. [2019-12-27 05:12:48,865 INFO L78 Accepts]: Start accepts. Automaton has 27096 states and 81946 transitions. Word has length 40 [2019-12-27 05:12:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:48,865 INFO L462 AbstractCegarLoop]: Abstraction has 27096 states and 81946 transitions. [2019-12-27 05:12:48,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:12:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27096 states and 81946 transitions. [2019-12-27 05:12:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:12:48,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:48,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:48,893 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1542628910, now seen corresponding path program 3 times [2019-12-27 05:12:48,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:48,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686497377] [2019-12-27 05:12:48,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:48,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686497377] [2019-12-27 05:12:48,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:48,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:12:48,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328466715] [2019-12-27 05:12:48,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:12:48,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:48,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:12:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:48,957 INFO L87 Difference]: Start difference. First operand 27096 states and 81946 transitions. Second operand 5 states. [2019-12-27 05:12:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:49,075 INFO L93 Difference]: Finished difference Result 25702 states and 78663 transitions. [2019-12-27 05:12:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:12:49,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:12:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:49,118 INFO L225 Difference]: With dead ends: 25702 [2019-12-27 05:12:49,119 INFO L226 Difference]: Without dead ends: 23616 [2019-12-27 05:12:49,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:12:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23616 states. [2019-12-27 05:12:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23616 to 22531. [2019-12-27 05:12:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22531 states. [2019-12-27 05:12:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22531 states to 22531 states and 70666 transitions. [2019-12-27 05:12:49,530 INFO L78 Accepts]: Start accepts. Automaton has 22531 states and 70666 transitions. Word has length 40 [2019-12-27 05:12:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:49,531 INFO L462 AbstractCegarLoop]: Abstraction has 22531 states and 70666 transitions. [2019-12-27 05:12:49,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:12:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22531 states and 70666 transitions. [2019-12-27 05:12:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:49,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:49,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:49,558 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:49,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1027702, now seen corresponding path program 1 times [2019-12-27 05:12:49,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:49,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043053709] [2019-12-27 05:12:49,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:49,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043053709] [2019-12-27 05:12:49,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:49,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:49,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962949963] [2019-12-27 05:12:49,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:49,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:49,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:49,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:49,651 INFO L87 Difference]: Start difference. First operand 22531 states and 70666 transitions. Second operand 7 states. [2019-12-27 05:12:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:50,557 INFO L93 Difference]: Finished difference Result 71705 states and 221520 transitions. [2019-12-27 05:12:50,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:12:50,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:12:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:50,636 INFO L225 Difference]: With dead ends: 71705 [2019-12-27 05:12:50,637 INFO L226 Difference]: Without dead ends: 50052 [2019-12-27 05:12:50,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:12:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50052 states. [2019-12-27 05:12:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50052 to 26005. [2019-12-27 05:12:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26005 states. [2019-12-27 05:12:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26005 states to 26005 states and 81431 transitions. [2019-12-27 05:12:51,189 INFO L78 Accepts]: Start accepts. Automaton has 26005 states and 81431 transitions. Word has length 64 [2019-12-27 05:12:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:51,189 INFO L462 AbstractCegarLoop]: Abstraction has 26005 states and 81431 transitions. [2019-12-27 05:12:51,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 26005 states and 81431 transitions. [2019-12-27 05:12:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:51,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:51,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:51,217 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:51,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash -807176034, now seen corresponding path program 2 times [2019-12-27 05:12:51,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:51,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065384986] [2019-12-27 05:12:51,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:51,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065384986] [2019-12-27 05:12:51,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:51,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:12:51,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221939801] [2019-12-27 05:12:51,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:51,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:51,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:51,322 INFO L87 Difference]: Start difference. First operand 26005 states and 81431 transitions. Second operand 8 states. [2019-12-27 05:12:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:52,625 INFO L93 Difference]: Finished difference Result 113185 states and 347411 transitions. [2019-12-27 05:12:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:12:52,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:12:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:52,744 INFO L225 Difference]: With dead ends: 113185 [2019-12-27 05:12:52,745 INFO L226 Difference]: Without dead ends: 77700 [2019-12-27 05:12:52,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:12:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77700 states. [2019-12-27 05:12:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77700 to 30272. [2019-12-27 05:12:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30272 states. [2019-12-27 05:12:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30272 states to 30272 states and 94495 transitions. [2019-12-27 05:12:54,025 INFO L78 Accepts]: Start accepts. Automaton has 30272 states and 94495 transitions. Word has length 64 [2019-12-27 05:12:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:54,025 INFO L462 AbstractCegarLoop]: Abstraction has 30272 states and 94495 transitions. [2019-12-27 05:12:54,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 30272 states and 94495 transitions. [2019-12-27 05:12:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:54,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:54,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:54,064 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:54,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:54,064 INFO L82 PathProgramCache]: Analyzing trace with hash -584020796, now seen corresponding path program 3 times [2019-12-27 05:12:54,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:54,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497606144] [2019-12-27 05:12:54,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:54,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497606144] [2019-12-27 05:12:54,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:54,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:54,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055300669] [2019-12-27 05:12:54,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:12:54,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:12:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:54,188 INFO L87 Difference]: Start difference. First operand 30272 states and 94495 transitions. Second operand 9 states. [2019-12-27 05:12:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:56,126 INFO L93 Difference]: Finished difference Result 168743 states and 512930 transitions. [2019-12-27 05:12:56,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 05:12:56,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:12:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:56,338 INFO L225 Difference]: With dead ends: 168743 [2019-12-27 05:12:56,339 INFO L226 Difference]: Without dead ends: 133640 [2019-12-27 05:12:56,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 05:12:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133640 states. [2019-12-27 05:12:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133640 to 36293. [2019-12-27 05:12:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36293 states. [2019-12-27 05:12:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36293 states to 36293 states and 113283 transitions. [2019-12-27 05:12:58,104 INFO L78 Accepts]: Start accepts. Automaton has 36293 states and 113283 transitions. Word has length 64 [2019-12-27 05:12:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:58,104 INFO L462 AbstractCegarLoop]: Abstraction has 36293 states and 113283 transitions. [2019-12-27 05:12:58,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:12:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 36293 states and 113283 transitions. [2019-12-27 05:12:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:58,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:58,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:58,156 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2052967778, now seen corresponding path program 4 times [2019-12-27 05:12:58,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:58,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282791021] [2019-12-27 05:12:58,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:12:58,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282791021] [2019-12-27 05:12:58,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:58,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:58,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969489672] [2019-12-27 05:12:58,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:12:58,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:58,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:12:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:58,272 INFO L87 Difference]: Start difference. First operand 36293 states and 113283 transitions. Second operand 9 states. [2019-12-27 05:13:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:00,034 INFO L93 Difference]: Finished difference Result 130467 states and 395891 transitions. [2019-12-27 05:13:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:13:00,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:13:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:00,221 INFO L225 Difference]: With dead ends: 130467 [2019-12-27 05:13:00,222 INFO L226 Difference]: Without dead ends: 120912 [2019-12-27 05:13:00,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:13:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120912 states. [2019-12-27 05:13:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120912 to 35767. [2019-12-27 05:13:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35767 states. [2019-12-27 05:13:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35767 states to 35767 states and 111764 transitions. [2019-12-27 05:13:01,893 INFO L78 Accepts]: Start accepts. Automaton has 35767 states and 111764 transitions. Word has length 64 [2019-12-27 05:13:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:01,894 INFO L462 AbstractCegarLoop]: Abstraction has 35767 states and 111764 transitions. [2019-12-27 05:13:01,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:13:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35767 states and 111764 transitions. [2019-12-27 05:13:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:13:01,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:01,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:01,935 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1570564162, now seen corresponding path program 5 times [2019-12-27 05:13:01,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:01,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726160301] [2019-12-27 05:13:01,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:02,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726160301] [2019-12-27 05:13:02,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:02,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:13:02,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026788276] [2019-12-27 05:13:02,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:13:02,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:13:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:13:02,018 INFO L87 Difference]: Start difference. First operand 35767 states and 111764 transitions. Second operand 7 states. [2019-12-27 05:13:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:02,742 INFO L93 Difference]: Finished difference Result 73111 states and 223213 transitions. [2019-12-27 05:13:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:13:02,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:13:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:02,884 INFO L225 Difference]: With dead ends: 73111 [2019-12-27 05:13:02,885 INFO L226 Difference]: Without dead ends: 64213 [2019-12-27 05:13:02,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:13:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64213 states. [2019-12-27 05:13:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64213 to 35831. [2019-12-27 05:13:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35831 states. [2019-12-27 05:13:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35831 states to 35831 states and 111893 transitions. [2019-12-27 05:13:04,149 INFO L78 Accepts]: Start accepts. Automaton has 35831 states and 111893 transitions. Word has length 64 [2019-12-27 05:13:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:04,149 INFO L462 AbstractCegarLoop]: Abstraction has 35831 states and 111893 transitions. [2019-12-27 05:13:04,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:13:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35831 states and 111893 transitions. [2019-12-27 05:13:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:13:04,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:04,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:04,192 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:04,192 INFO L82 PathProgramCache]: Analyzing trace with hash -606436500, now seen corresponding path program 6 times [2019-12-27 05:13:04,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:04,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647583452] [2019-12-27 05:13:04,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:04,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647583452] [2019-12-27 05:13:04,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:04,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:13:04,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842711709] [2019-12-27 05:13:04,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:13:04,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:04,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:13:04,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:13:04,253 INFO L87 Difference]: Start difference. First operand 35831 states and 111893 transitions. Second operand 3 states. [2019-12-27 05:13:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:04,421 INFO L93 Difference]: Finished difference Result 41492 states and 128658 transitions. [2019-12-27 05:13:04,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:13:04,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:13:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:04,482 INFO L225 Difference]: With dead ends: 41492 [2019-12-27 05:13:04,482 INFO L226 Difference]: Without dead ends: 41492 [2019-12-27 05:13:04,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:13:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41492 states. [2019-12-27 05:13:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41492 to 36534. [2019-12-27 05:13:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36534 states. [2019-12-27 05:13:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36534 states to 36534 states and 114238 transitions. [2019-12-27 05:13:05,094 INFO L78 Accepts]: Start accepts. Automaton has 36534 states and 114238 transitions. Word has length 64 [2019-12-27 05:13:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:05,094 INFO L462 AbstractCegarLoop]: Abstraction has 36534 states and 114238 transitions. [2019-12-27 05:13:05,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:13:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 36534 states and 114238 transitions. [2019-12-27 05:13:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:05,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:05,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:05,134 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash -748291407, now seen corresponding path program 1 times [2019-12-27 05:13:05,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:05,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648060983] [2019-12-27 05:13:05,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:05,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648060983] [2019-12-27 05:13:05,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:05,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:13:05,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931692195] [2019-12-27 05:13:05,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:13:05,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:05,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:13:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:13:05,180 INFO L87 Difference]: Start difference. First operand 36534 states and 114238 transitions. Second operand 4 states. [2019-12-27 05:13:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:05,427 INFO L93 Difference]: Finished difference Result 45284 states and 140098 transitions. [2019-12-27 05:13:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:13:05,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 05:13:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:05,495 INFO L225 Difference]: With dead ends: 45284 [2019-12-27 05:13:05,496 INFO L226 Difference]: Without dead ends: 45284 [2019-12-27 05:13:05,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:13:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45284 states. [2019-12-27 05:13:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45284 to 37392. [2019-12-27 05:13:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37392 states. [2019-12-27 05:13:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37392 states to 37392 states and 116839 transitions. [2019-12-27 05:13:06,156 INFO L78 Accepts]: Start accepts. Automaton has 37392 states and 116839 transitions. Word has length 65 [2019-12-27 05:13:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:06,156 INFO L462 AbstractCegarLoop]: Abstraction has 37392 states and 116839 transitions. [2019-12-27 05:13:06,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:13:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 37392 states and 116839 transitions. [2019-12-27 05:13:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:06,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:06,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:06,514 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1146257839, now seen corresponding path program 2 times [2019-12-27 05:13:06,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:06,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76997323] [2019-12-27 05:13:06,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:06,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76997323] [2019-12-27 05:13:06,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:06,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:13:06,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179604618] [2019-12-27 05:13:06,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:13:06,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:13:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:13:06,563 INFO L87 Difference]: Start difference. First operand 37392 states and 116839 transitions. Second operand 4 states. [2019-12-27 05:13:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:06,923 INFO L93 Difference]: Finished difference Result 52375 states and 163071 transitions. [2019-12-27 05:13:06,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:13:06,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 05:13:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:07,006 INFO L225 Difference]: With dead ends: 52375 [2019-12-27 05:13:07,006 INFO L226 Difference]: Without dead ends: 52375 [2019-12-27 05:13:07,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:13:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52375 states. [2019-12-27 05:13:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52375 to 39294. [2019-12-27 05:13:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39294 states. [2019-12-27 05:13:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39294 states to 39294 states and 124071 transitions. [2019-12-27 05:13:07,762 INFO L78 Accepts]: Start accepts. Automaton has 39294 states and 124071 transitions. Word has length 65 [2019-12-27 05:13:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:07,762 INFO L462 AbstractCegarLoop]: Abstraction has 39294 states and 124071 transitions. [2019-12-27 05:13:07,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:13:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39294 states and 124071 transitions. [2019-12-27 05:13:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:07,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:07,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:07,806 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -232484785, now seen corresponding path program 3 times [2019-12-27 05:13:07,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:07,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166674003] [2019-12-27 05:13:07,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:07,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166674003] [2019-12-27 05:13:07,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:07,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:13:07,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692260901] [2019-12-27 05:13:07,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:13:07,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:13:07,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:13:07,904 INFO L87 Difference]: Start difference. First operand 39294 states and 124071 transitions. Second operand 8 states. [2019-12-27 05:13:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:09,035 INFO L93 Difference]: Finished difference Result 111154 states and 345137 transitions. [2019-12-27 05:13:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:13:09,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:13:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:09,199 INFO L225 Difference]: With dead ends: 111154 [2019-12-27 05:13:09,199 INFO L226 Difference]: Without dead ends: 103541 [2019-12-27 05:13:09,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:13:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103541 states. [2019-12-27 05:13:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103541 to 39904. [2019-12-27 05:13:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39904 states. [2019-12-27 05:13:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39904 states to 39904 states and 126332 transitions. [2019-12-27 05:13:10,769 INFO L78 Accepts]: Start accepts. Automaton has 39904 states and 126332 transitions. Word has length 65 [2019-12-27 05:13:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:10,769 INFO L462 AbstractCegarLoop]: Abstraction has 39904 states and 126332 transitions. [2019-12-27 05:13:10,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:13:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 39904 states and 126332 transitions. [2019-12-27 05:13:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:10,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:10,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:10,814 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:10,814 INFO L82 PathProgramCache]: Analyzing trace with hash 208975201, now seen corresponding path program 4 times [2019-12-27 05:13:10,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:10,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847171522] [2019-12-27 05:13:10,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:10,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847171522] [2019-12-27 05:13:10,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:10,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:13:10,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001943263] [2019-12-27 05:13:10,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:13:10,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:10,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:13:10,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:13:10,913 INFO L87 Difference]: Start difference. First operand 39904 states and 126332 transitions. Second operand 9 states. [2019-12-27 05:13:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:12,668 INFO L93 Difference]: Finished difference Result 139705 states and 428487 transitions. [2019-12-27 05:13:12,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:13:12,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:13:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:12,874 INFO L225 Difference]: With dead ends: 139705 [2019-12-27 05:13:12,874 INFO L226 Difference]: Without dead ends: 129264 [2019-12-27 05:13:12,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:13:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129264 states. [2019-12-27 05:13:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129264 to 40930. [2019-12-27 05:13:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40930 states. [2019-12-27 05:13:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40930 states to 40930 states and 128544 transitions. [2019-12-27 05:13:14,709 INFO L78 Accepts]: Start accepts. Automaton has 40930 states and 128544 transitions. Word has length 65 [2019-12-27 05:13:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:14,710 INFO L462 AbstractCegarLoop]: Abstraction has 40930 states and 128544 transitions. [2019-12-27 05:13:14,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:13:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 40930 states and 128544 transitions. [2019-12-27 05:13:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:14,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:14,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:14,756 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:14,757 INFO L82 PathProgramCache]: Analyzing trace with hash 652655719, now seen corresponding path program 5 times [2019-12-27 05:13:14,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:14,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752174498] [2019-12-27 05:13:14,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:14,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752174498] [2019-12-27 05:13:14,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:14,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:13:14,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424889208] [2019-12-27 05:13:14,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:13:14,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:13:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:13:14,879 INFO L87 Difference]: Start difference. First operand 40930 states and 128544 transitions. Second operand 9 states. [2019-12-27 05:13:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:16,374 INFO L93 Difference]: Finished difference Result 118599 states and 362563 transitions. [2019-12-27 05:13:16,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:13:16,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:13:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:16,555 INFO L225 Difference]: With dead ends: 118599 [2019-12-27 05:13:16,556 INFO L226 Difference]: Without dead ends: 113587 [2019-12-27 05:13:16,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:13:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113587 states. [2019-12-27 05:13:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113587 to 39327. [2019-12-27 05:13:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39327 states. [2019-12-27 05:13:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39327 states to 39327 states and 124096 transitions. [2019-12-27 05:13:18,256 INFO L78 Accepts]: Start accepts. Automaton has 39327 states and 124096 transitions. Word has length 65 [2019-12-27 05:13:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:18,256 INFO L462 AbstractCegarLoop]: Abstraction has 39327 states and 124096 transitions. [2019-12-27 05:13:18,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:13:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 39327 states and 124096 transitions. [2019-12-27 05:13:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:18,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:18,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:18,300 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:18,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1727661840, now seen corresponding path program 1 times [2019-12-27 05:13:18,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:18,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90444220] [2019-12-27 05:13:18,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:18,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90444220] [2019-12-27 05:13:18,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:18,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:13:18,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673573165] [2019-12-27 05:13:18,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:13:18,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:13:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:13:18,419 INFO L87 Difference]: Start difference. First operand 39327 states and 124096 transitions. Second operand 7 states. [2019-12-27 05:13:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:20,095 INFO L93 Difference]: Finished difference Result 68485 states and 209927 transitions. [2019-12-27 05:13:20,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:13:20,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:13:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:20,207 INFO L225 Difference]: With dead ends: 68485 [2019-12-27 05:13:20,207 INFO L226 Difference]: Without dead ends: 68485 [2019-12-27 05:13:20,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:13:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68485 states. [2019-12-27 05:13:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68485 to 39927. [2019-12-27 05:13:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39927 states. [2019-12-27 05:13:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39927 states to 39927 states and 125888 transitions. [2019-12-27 05:13:21,121 INFO L78 Accepts]: Start accepts. Automaton has 39927 states and 125888 transitions. Word has length 65 [2019-12-27 05:13:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:21,121 INFO L462 AbstractCegarLoop]: Abstraction has 39927 states and 125888 transitions. [2019-12-27 05:13:21,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:13:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 39927 states and 125888 transitions. [2019-12-27 05:13:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:21,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:21,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:21,527 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1601587072, now seen corresponding path program 2 times [2019-12-27 05:13:21,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:21,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69295451] [2019-12-27 05:13:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:21,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69295451] [2019-12-27 05:13:21,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:21,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:13:21,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724711226] [2019-12-27 05:13:21,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:13:21,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:13:21,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:13:21,684 INFO L87 Difference]: Start difference. First operand 39927 states and 125888 transitions. Second operand 8 states. [2019-12-27 05:13:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:23,682 INFO L93 Difference]: Finished difference Result 77088 states and 236106 transitions. [2019-12-27 05:13:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:13:23,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:13:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:23,797 INFO L225 Difference]: With dead ends: 77088 [2019-12-27 05:13:23,797 INFO L226 Difference]: Without dead ends: 77088 [2019-12-27 05:13:23,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:13:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77088 states. [2019-12-27 05:13:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77088 to 41392. [2019-12-27 05:13:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41392 states. [2019-12-27 05:13:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41392 states to 41392 states and 130708 transitions. [2019-12-27 05:13:24,810 INFO L78 Accepts]: Start accepts. Automaton has 41392 states and 130708 transitions. Word has length 65 [2019-12-27 05:13:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:24,810 INFO L462 AbstractCegarLoop]: Abstraction has 41392 states and 130708 transitions. [2019-12-27 05:13:24,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:13:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 41392 states and 130708 transitions. [2019-12-27 05:13:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:13:24,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:24,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:24,858 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2080466144, now seen corresponding path program 3 times [2019-12-27 05:13:24,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:24,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597384292] [2019-12-27 05:13:24,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:24,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597384292] [2019-12-27 05:13:24,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:24,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:13:24,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129375903] [2019-12-27 05:13:24,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:13:24,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:13:24,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:13:24,924 INFO L87 Difference]: Start difference. First operand 41392 states and 130708 transitions. Second operand 3 states. [2019-12-27 05:13:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:25,103 INFO L93 Difference]: Finished difference Result 41392 states and 130707 transitions. [2019-12-27 05:13:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:13:25,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:13:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:25,168 INFO L225 Difference]: With dead ends: 41392 [2019-12-27 05:13:25,168 INFO L226 Difference]: Without dead ends: 41392 [2019-12-27 05:13:25,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:13:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41392 states. [2019-12-27 05:13:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41392 to 31202. [2019-12-27 05:13:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31202 states. [2019-12-27 05:13:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31202 states to 31202 states and 99725 transitions. [2019-12-27 05:13:26,057 INFO L78 Accepts]: Start accepts. Automaton has 31202 states and 99725 transitions. Word has length 65 [2019-12-27 05:13:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:26,057 INFO L462 AbstractCegarLoop]: Abstraction has 31202 states and 99725 transitions. [2019-12-27 05:13:26,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:13:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31202 states and 99725 transitions. [2019-12-27 05:13:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:13:26,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:26,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:26,094 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:26,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash 771646180, now seen corresponding path program 1 times [2019-12-27 05:13:26,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:26,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878638723] [2019-12-27 05:13:26,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:26,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878638723] [2019-12-27 05:13:26,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:26,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:13:26,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793765185] [2019-12-27 05:13:26,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:13:26,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:13:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:13:26,265 INFO L87 Difference]: Start difference. First operand 31202 states and 99725 transitions. Second operand 9 states. [2019-12-27 05:13:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:28,639 INFO L93 Difference]: Finished difference Result 56634 states and 175879 transitions. [2019-12-27 05:13:28,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 05:13:28,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:13:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:28,728 INFO L225 Difference]: With dead ends: 56634 [2019-12-27 05:13:28,728 INFO L226 Difference]: Without dead ends: 56634 [2019-12-27 05:13:28,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:13:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56634 states. [2019-12-27 05:13:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56634 to 30999. [2019-12-27 05:13:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30999 states. [2019-12-27 05:13:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30999 states to 30999 states and 99068 transitions. [2019-12-27 05:13:29,438 INFO L78 Accepts]: Start accepts. Automaton has 30999 states and 99068 transitions. Word has length 66 [2019-12-27 05:13:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:29,438 INFO L462 AbstractCegarLoop]: Abstraction has 30999 states and 99068 transitions. [2019-12-27 05:13:29,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:13:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 30999 states and 99068 transitions. [2019-12-27 05:13:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:13:29,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:29,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:29,474 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:29,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:29,474 INFO L82 PathProgramCache]: Analyzing trace with hash 241793892, now seen corresponding path program 2 times [2019-12-27 05:13:29,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:29,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778513475] [2019-12-27 05:13:29,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:13:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:13:29,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778513475] [2019-12-27 05:13:29,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:13:29,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:13:29,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207619582] [2019-12-27 05:13:29,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:13:29,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:13:29,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:13:29,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:13:29,530 INFO L87 Difference]: Start difference. First operand 30999 states and 99068 transitions. Second operand 3 states. [2019-12-27 05:13:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:13:29,634 INFO L93 Difference]: Finished difference Result 23320 states and 73623 transitions. [2019-12-27 05:13:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:13:29,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:13:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:13:29,684 INFO L225 Difference]: With dead ends: 23320 [2019-12-27 05:13:29,685 INFO L226 Difference]: Without dead ends: 23320 [2019-12-27 05:13:29,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:13:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23320 states. [2019-12-27 05:13:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23320 to 20919. [2019-12-27 05:13:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20919 states. [2019-12-27 05:13:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20919 states to 20919 states and 65920 transitions. [2019-12-27 05:13:30,357 INFO L78 Accepts]: Start accepts. Automaton has 20919 states and 65920 transitions. Word has length 66 [2019-12-27 05:13:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:13:30,358 INFO L462 AbstractCegarLoop]: Abstraction has 20919 states and 65920 transitions. [2019-12-27 05:13:30,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:13:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 20919 states and 65920 transitions. [2019-12-27 05:13:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:13:30,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:13:30,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:13:30,397 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:13:30,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:13:30,397 INFO L82 PathProgramCache]: Analyzing trace with hash -190644257, now seen corresponding path program 1 times [2019-12-27 05:13:30,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:13:30,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020571592] [2019-12-27 05:13:30,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:13:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:13:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:13:30,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:13:30,584 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:13:30,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_25) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= v_~z~0_28 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~z$r_buff0_thd2~0_20 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (= 0 v_~z$r_buff1_thd2~0_16) (= |v_ULTIMATE.start_main_~#t165~0.offset_15| 0) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd1~0_27 0) (= v_~x~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t165~0.base_19|)) (= 0 v_~weak$$choice0~0_7) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t165~0.base_19| 4)) (= 0 v_~z$w_buff1_used~0_74) (= v_~z$w_buff0_used~0_111 0) (= 0 v_~z$r_buff1_thd1~0_19) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t165~0.base_19|) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_24) (= (store .cse0 |v_ULTIMATE.start_main_~#t165~0.base_19| 1) |v_#valid_61|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_19|) |v_ULTIMATE.start_main_~#t165~0.offset_15| 0))) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_15|, ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t165~0.base=|v_ULTIMATE.start_main_~#t165~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ULTIMATE.start_main_~#t165~0.offset=|v_ULTIMATE.start_main_~#t165~0.offset_15|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_18, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t166~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t165~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t165~0.offset, ULTIMATE.start_main_~#t166~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t167~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:13:30,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t166~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11|) |v_ULTIMATE.start_main_~#t166~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t166~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t166~0.base_11|) (= |v_ULTIMATE.start_main_~#t166~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t166~0.offset, ULTIMATE.start_main_~#t166~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:13:30,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd1~0_17 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_18 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:13:30,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1473043913 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1473043913 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1473043913| ~z$w_buff1~0_In-1473043913) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1473043913| ~z~0_In-1473043913) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1473043913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473043913, ~z$w_buff1~0=~z$w_buff1~0_In-1473043913, ~z~0=~z~0_In-1473043913} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1473043913|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1473043913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473043913, ~z$w_buff1~0=~z$w_buff1~0_In-1473043913, ~z~0=~z~0_In-1473043913} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:13:30,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= v_~z~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 05:13:30,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1486685777 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1486685777 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1486685777| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1486685777| ~z$w_buff0_used~0_In1486685777) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1486685777} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1486685777|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1486685777} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:13:30,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1426515208 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1426515208 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1426515208 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1426515208 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1426515208| ~z$w_buff1_used~0_In-1426515208) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1426515208|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426515208, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1426515208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426515208, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1426515208} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1426515208, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1426515208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1426515208, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1426515208|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1426515208} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:13:30,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t167~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t167~0.offset_8| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t167~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9|) |v_ULTIMATE.start_main_~#t167~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t167~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_8|, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t167~0.base] because there is no mapped edge [2019-12-27 05:13:30,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2139381170 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out2139381170| ~z$w_buff0~0_In2139381170) (= |P2Thread1of1ForFork0_#t~ite20_In2139381170| |P2Thread1of1ForFork0_#t~ite20_Out2139381170|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2139381170 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In2139381170 256))) (= 0 (mod ~z$w_buff0_used~0_In2139381170 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In2139381170 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out2139381170| ~z$w_buff0~0_In2139381170) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out2139381170| |P2Thread1of1ForFork0_#t~ite20_Out2139381170|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In2139381170, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139381170, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2139381170, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139381170, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2139381170, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In2139381170|, ~weak$$choice2~0=~weak$$choice2~0_In2139381170} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out2139381170|, ~z$w_buff0~0=~z$w_buff0~0_In2139381170, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139381170, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2139381170, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139381170, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2139381170, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out2139381170|, ~weak$$choice2~0=~weak$$choice2~0_In2139381170} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:13:30,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In876796992 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out876796992| ~z$w_buff1~0_In876796992) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In876796992 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In876796992 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In876796992 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In876796992 256)))) (= |P2Thread1of1ForFork0_#t~ite24_Out876796992| |P2Thread1of1ForFork0_#t~ite23_Out876796992|)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out876796992| ~z$w_buff1~0_In876796992) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In876796992| |P2Thread1of1ForFork0_#t~ite23_Out876796992|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In876796992, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In876796992, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In876796992|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876796992, ~z$w_buff1~0=~z$w_buff1~0_In876796992, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In876796992, ~weak$$choice2~0=~weak$$choice2~0_In876796992} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In876796992, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out876796992|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In876796992, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out876796992|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876796992, ~z$w_buff1~0=~z$w_buff1~0_In876796992, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In876796992, ~weak$$choice2~0=~weak$$choice2~0_In876796992} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:13:30,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1525700322 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1525700322| ~z$w_buff0_used~0_In1525700322) (= |P2Thread1of1ForFork0_#t~ite26_In1525700322| |P2Thread1of1ForFork0_#t~ite26_Out1525700322|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out1525700322| |P2Thread1of1ForFork0_#t~ite27_Out1525700322|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1525700322 256)))) (or (= (mod ~z$w_buff0_used~0_In1525700322 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In1525700322 256)) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In1525700322 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite26_Out1525700322| ~z$w_buff0_used~0_In1525700322) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1525700322|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1525700322, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1525700322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1525700322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1525700322, ~weak$$choice2~0=~weak$$choice2~0_In1525700322} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1525700322|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1525700322|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1525700322, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1525700322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1525700322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1525700322, ~weak$$choice2~0=~weak$$choice2~0_In1525700322} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:13:30,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff0_thd3~0_48)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:13:30,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:13:30,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In862219926 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In862219926 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out862219926| ~z$w_buff1~0_In862219926)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out862219926| ~z~0_In862219926)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In862219926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In862219926, ~z$w_buff1~0=~z$w_buff1~0_In862219926, ~z~0=~z~0_In862219926} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out862219926|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In862219926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In862219926, ~z$w_buff1~0=~z$w_buff1~0_In862219926, ~z~0=~z~0_In862219926} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:13:30,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 05:13:30,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1788516199 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1788516199 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1788516199|)) (and (= ~z$w_buff0_used~0_In1788516199 |P2Thread1of1ForFork0_#t~ite40_Out1788516199|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1788516199} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1788516199|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1788516199} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:13:30,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1405764287 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1405764287 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1405764287 |P1Thread1of1ForFork2_#t~ite13_Out-1405764287|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1405764287|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1405764287} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1405764287|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1405764287} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:13:30,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1522226585 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1522226585 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1522226585 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1522226585 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1522226585|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In1522226585 |P1Thread1of1ForFork2_#t~ite14_Out1522226585|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1522226585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522226585, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1522226585} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1522226585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522226585, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1522226585|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1522226585} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:13:30,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L775-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:13:30,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2134891904 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2134891904 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2134891904 |P0Thread1of1ForFork1_#t~ite5_Out-2134891904|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-2134891904|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134891904, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2134891904} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-2134891904|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134891904, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2134891904} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:13:30,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1468621749 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1468621749 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1468621749 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1468621749 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1468621749| ~z$w_buff1_used~0_In-1468621749) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1468621749|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1468621749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468621749, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1468621749} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1468621749|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1468621749, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468621749, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1468621749} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:13:30,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In1228058467 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1228058467 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1228058467 ~z$r_buff0_thd1~0_In1228058467)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1228058467 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1228058467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1228058467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1228058467, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1228058467|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1228058467} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:13:30,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In817252036 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In817252036 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In817252036 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In817252036 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out817252036| ~z$r_buff1_thd1~0_In817252036) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out817252036| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In817252036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817252036, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In817252036} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out817252036|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In817252036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In817252036, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In817252036} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:13:30,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_16 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:13:30,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1531533742 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1531533742 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1531533742 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1531533742 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1531533742|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1531533742 |P2Thread1of1ForFork0_#t~ite41_Out1531533742|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1531533742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531533742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1531533742} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1531533742, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1531533742, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1531533742, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1531533742|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:13:30,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2100730564 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2100730564 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-2100730564|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-2100730564| ~z$r_buff0_thd3~0_In-2100730564)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2100730564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2100730564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2100730564, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-2100730564|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:13:30,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-77179902 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-77179902 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-77179902 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-77179902 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-77179902| ~z$r_buff1_thd3~0_In-77179902) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-77179902| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-77179902, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-77179902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77179902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-77179902} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-77179902|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-77179902, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-77179902, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77179902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-77179902} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:13:30,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:13:30,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:13:30,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1224493589| |ULTIMATE.start_main_#t~ite48_Out1224493589|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1224493589 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1224493589 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out1224493589| ~z$w_buff1~0_In1224493589) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In1224493589 |ULTIMATE.start_main_#t~ite47_Out1224493589|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1224493589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1224493589, ~z$w_buff1~0=~z$w_buff1~0_In1224493589, ~z~0=~z~0_In1224493589} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1224493589, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1224493589|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1224493589, ~z$w_buff1~0=~z$w_buff1~0_In1224493589, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1224493589|, ~z~0=~z~0_In1224493589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:13:30,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1325484193 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1325484193 256)))) (or (and (= ~z$w_buff0_used~0_In1325484193 |ULTIMATE.start_main_#t~ite49_Out1325484193|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out1325484193|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1325484193, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1325484193, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1325484193|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:13:30,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In998153640 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In998153640 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In998153640 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In998153640 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out998153640| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out998153640| ~z$w_buff1_used~0_In998153640)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In998153640, ~z$w_buff0_used~0=~z$w_buff0_used~0_In998153640, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In998153640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998153640} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out998153640|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In998153640, ~z$w_buff0_used~0=~z$w_buff0_used~0_In998153640, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In998153640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998153640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:13:30,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1135864868 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1135864868 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1135864868 |ULTIMATE.start_main_#t~ite51_Out1135864868|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1135864868| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1135864868, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1135864868} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1135864868, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1135864868|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1135864868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:13:30,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1487841888 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1487841888 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1487841888 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1487841888 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1487841888| ~z$r_buff1_thd0~0_In-1487841888) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-1487841888| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1487841888, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1487841888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487841888} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1487841888|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1487841888, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1487841888, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487841888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:13:30,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256)) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:13:30,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:13:30 BasicIcfg [2019-12-27 05:13:30,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:13:30,707 INFO L168 Benchmark]: Toolchain (without parser) took 131097.41 ms. Allocated memory was 137.9 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 101.1 MB in the beginning and 829.3 MB in the end (delta: -728.3 MB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 05:13:30,707 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 05:13:30,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.14 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 153.6 MB in the end (delta: -52.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:13:30,708 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.27 ms. Allocated memory is still 200.8 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:13:30,709 INFO L168 Benchmark]: Boogie Preprocessor took 39.97 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:13:30,709 INFO L168 Benchmark]: RCFGBuilder took 863.35 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 98.2 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:13:30,709 INFO L168 Benchmark]: TraceAbstraction took 129262.35 ms. Allocated memory was 200.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 98.2 MB in the beginning and 829.3 MB in the end (delta: -731.1 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 05:13:30,713 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 852.14 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 153.6 MB in the end (delta: -52.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.27 ms. Allocated memory is still 200.8 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.97 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 863.35 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 98.2 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129262.35 ms. Allocated memory was 200.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 98.2 MB in the beginning and 829.3 MB in the end (delta: -731.1 MB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 95 ProgramPointsAfterwards, 214 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7246 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82443 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 128.9s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 44.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8715 SDtfs, 13860 SDslu, 24821 SDs, 0 SdLazy, 15672 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 84 SyntacticMatches, 21 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158867occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 838421 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1607 NumberOfCodeBlocks, 1607 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1506 ConstructedInterpolants, 0 QuantifiedInterpolants, 256669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...