/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:58:33,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:58:33,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:58:33,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:58:33,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:58:33,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:58:33,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:58:33,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:58:33,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:58:33,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:58:33,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:58:33,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:58:33,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:58:33,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:58:33,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:58:33,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:58:33,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:58:33,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:58:33,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:58:33,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:58:33,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:58:33,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:58:33,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:58:33,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:58:33,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:58:33,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:58:33,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:58:33,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:58:33,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:58:33,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:58:33,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:58:33,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:58:33,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:58:33,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:58:33,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:58:33,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:58:33,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:58:33,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:58:33,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:58:33,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:58:33,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:58:33,456 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-MCR.epf [2019-12-27 19:58:33,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:58:33,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:58:33,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:58:33,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:58:33,477 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:58:33,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:58:33,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:58:33,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:58:33,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:58:33,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:58:33,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:58:33,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:58:33,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:58:33,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:58:33,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:58:33,480 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:58:33,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:58:33,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:58:33,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:58:33,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:58:33,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:58:33,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:58:33,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:58:33,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:58:33,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:58:33,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:58:33,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:58:33,483 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:58:33,483 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:58:33,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:58:33,484 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:58:33,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:58:33,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:58:33,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:58:33,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:58:33,767 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:58:33,767 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:58:33,768 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-27 19:58:33,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedc8406d/4bc7fd0e723c4b6b98f1d96c3f24e960/FLAG05a0711a1 [2019-12-27 19:58:34,394 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:58:34,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_pso.oepc.i [2019-12-27 19:58:34,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedc8406d/4bc7fd0e723c4b6b98f1d96c3f24e960/FLAG05a0711a1 [2019-12-27 19:58:34,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedc8406d/4bc7fd0e723c4b6b98f1d96c3f24e960 [2019-12-27 19:58:34,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:58:34,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:58:34,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:58:34,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:58:34,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:58:34,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:58:34" (1/1) ... [2019-12-27 19:58:34,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7e5a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:34, skipping insertion in model container [2019-12-27 19:58:34,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:58:34" (1/1) ... [2019-12-27 19:58:34,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:58:34,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:58:35,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:58:35,340 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:58:35,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:58:35,506 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:58:35,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35 WrapperNode [2019-12-27 19:58:35,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:58:35,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:58:35,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:58:35,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:58:35,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:58:35,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:58:35,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:58:35,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:58:35,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (1/1) ... [2019-12-27 19:58:35,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:58:35,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:58:35,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:58:35,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:58:35,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (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 19:58:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:58:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:58:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:58:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:58:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:58:35,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:58:35,686 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:58:35,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:58:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:58:35,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:58:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:58:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:58:35,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:58:35,690 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 19:58:36,469 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:58:36,470 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:58:36,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:58:36 BoogieIcfgContainer [2019-12-27 19:58:36,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:58:36,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:58:36,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:58:36,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:58:36,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:58:34" (1/3) ... [2019-12-27 19:58:36,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706e3cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:58:36, skipping insertion in model container [2019-12-27 19:58:36,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:35" (2/3) ... [2019-12-27 19:58:36,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706e3cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:58:36, skipping insertion in model container [2019-12-27 19:58:36,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:58:36" (3/3) ... [2019-12-27 19:58:36,484 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.oepc.i [2019-12-27 19:58:36,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:58:36,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:58:36,510 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:58:36,511 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:58:36,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,584 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,585 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,585 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,612 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,613 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,622 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,622 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,649 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,651 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,660 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,665 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:36,684 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:58:36,704 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:58:36,704 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:58:36,704 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:58:36,704 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:58:36,704 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:58:36,704 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:58:36,705 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:58:36,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:58:36,722 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 19:58:36,724 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 19:58:36,841 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 19:58:36,841 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:58:36,860 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:58:36,883 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 19:58:36,981 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 19:58:36,981 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:58:36,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:58:37,017 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:58:37,019 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:58:40,670 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 19:58:40,805 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 19:58:40,840 INFO L206 etLargeBlockEncoding]: Checked pairs total: 95714 [2019-12-27 19:58:40,840 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 19:58:40,844 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 108 transitions [2019-12-27 19:59:06,295 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138242 states. [2019-12-27 19:59:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 138242 states. [2019-12-27 19:59:06,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:59:06,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:06,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:59:06,304 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 19:59:06,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:06,309 INFO L82 PathProgramCache]: Analyzing trace with hash 917980, now seen corresponding path program 1 times [2019-12-27 19:59:06,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:06,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305122477] [2019-12-27 19:59:06,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:06,553 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 19:59:06,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305122477] [2019-12-27 19:59:06,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:06,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:59:06,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146062693] [2019-12-27 19:59:06,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:06,559 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:06,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:59:06,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:06,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:06,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:59:06,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:59:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:06,585 INFO L87 Difference]: Start difference. First operand 138242 states. Second operand 3 states. [2019-12-27 19:59:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:08,038 INFO L93 Difference]: Finished difference Result 137016 states and 586554 transitions. [2019-12-27 19:59:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:59:08,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:59:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:08,681 INFO L225 Difference]: With dead ends: 137016 [2019-12-27 19:59:08,681 INFO L226 Difference]: Without dead ends: 128980 [2019-12-27 19:59:08,683 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 19:59:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128980 states. [2019-12-27 19:59:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128980 to 128980. [2019-12-27 19:59:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128980 states. [2019-12-27 19:59:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128980 states to 128980 states and 551484 transitions. [2019-12-27 19:59:25,981 INFO L78 Accepts]: Start accepts. Automaton has 128980 states and 551484 transitions. Word has length 3 [2019-12-27 19:59:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:25,982 INFO L462 AbstractCegarLoop]: Abstraction has 128980 states and 551484 transitions. [2019-12-27 19:59:25,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:59:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 128980 states and 551484 transitions. [2019-12-27 19:59:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:59:25,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:25,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:59:25,991 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 19:59:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 178231614, now seen corresponding path program 1 times [2019-12-27 19:59:25,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:25,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452322698] [2019-12-27 19:59:25,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:26,143 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 19:59:26,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452322698] [2019-12-27 19:59:26,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:26,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:59:26,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1503420791] [2019-12-27 19:59:26,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:26,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:26,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:59:26,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:26,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:26,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:59:26,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:26,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:59:26,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:59:26,157 INFO L87 Difference]: Start difference. First operand 128980 states and 551484 transitions. Second operand 4 states. [2019-12-27 19:59:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:27,744 INFO L93 Difference]: Finished difference Result 200378 states and 822381 transitions. [2019-12-27 19:59:27,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:59:27,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 19:59:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:34,307 INFO L225 Difference]: With dead ends: 200378 [2019-12-27 19:59:34,308 INFO L226 Difference]: Without dead ends: 200329 [2019-12-27 19:59:34,308 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 19:59:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200329 states. [2019-12-27 19:59:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200329 to 184385. [2019-12-27 19:59:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184385 states. [2019-12-27 19:59:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184385 states to 184385 states and 766782 transitions. [2019-12-27 19:59:46,214 INFO L78 Accepts]: Start accepts. Automaton has 184385 states and 766782 transitions. Word has length 11 [2019-12-27 19:59:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:46,215 INFO L462 AbstractCegarLoop]: Abstraction has 184385 states and 766782 transitions. [2019-12-27 19:59:46,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:59:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 184385 states and 766782 transitions. [2019-12-27 19:59:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:59:46,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:46,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:59:46,224 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 19:59:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash -786514357, now seen corresponding path program 1 times [2019-12-27 19:59:46,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:46,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634201917] [2019-12-27 19:59:46,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:46,292 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 19:59:46,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634201917] [2019-12-27 19:59:46,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:46,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:59:46,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [356724725] [2019-12-27 19:59:46,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:46,295 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:46,297 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:59:46,297 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:46,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:46,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:59:46,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:59:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:46,298 INFO L87 Difference]: Start difference. First operand 184385 states and 766782 transitions. Second operand 3 states. [2019-12-27 19:59:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:46,471 INFO L93 Difference]: Finished difference Result 38211 states and 124394 transitions. [2019-12-27 19:59:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:59:46,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:59:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:46,568 INFO L225 Difference]: With dead ends: 38211 [2019-12-27 19:59:46,569 INFO L226 Difference]: Without dead ends: 38211 [2019-12-27 19:59:46,569 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 19:59:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-12-27 19:59:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38211. [2019-12-27 19:59:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38211 states. [2019-12-27 19:59:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38211 states to 38211 states and 124394 transitions. [2019-12-27 19:59:47,273 INFO L78 Accepts]: Start accepts. Automaton has 38211 states and 124394 transitions. Word has length 13 [2019-12-27 19:59:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:47,273 INFO L462 AbstractCegarLoop]: Abstraction has 38211 states and 124394 transitions. [2019-12-27 19:59:47,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:59:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 38211 states and 124394 transitions. [2019-12-27 19:59:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:59:47,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:47,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:59:47,276 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 19:59:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1326052248, now seen corresponding path program 1 times [2019-12-27 19:59:47,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:47,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949044380] [2019-12-27 19:59:47,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:47,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 19:59:47,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949044380] [2019-12-27 19:59:47,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:47,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:47,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1150931214] [2019-12-27 19:59:47,364 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:47,371 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:47,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:59:47,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:47,374 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:47,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:59:47,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:59:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:59:47,376 INFO L87 Difference]: Start difference. First operand 38211 states and 124394 transitions. Second operand 5 states. [2019-12-27 19:59:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:48,325 INFO L93 Difference]: Finished difference Result 52954 states and 170202 transitions. [2019-12-27 19:59:48,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:59:48,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 19:59:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:48,414 INFO L225 Difference]: With dead ends: 52954 [2019-12-27 19:59:48,414 INFO L226 Difference]: Without dead ends: 52954 [2019-12-27 19:59:48,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:59:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52954 states. [2019-12-27 19:59:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52954 to 45311. [2019-12-27 19:59:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45311 states. [2019-12-27 19:59:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45311 states to 45311 states and 146879 transitions. [2019-12-27 19:59:49,338 INFO L78 Accepts]: Start accepts. Automaton has 45311 states and 146879 transitions. Word has length 16 [2019-12-27 19:59:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:49,338 INFO L462 AbstractCegarLoop]: Abstraction has 45311 states and 146879 transitions. [2019-12-27 19:59:49,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:59:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45311 states and 146879 transitions. [2019-12-27 19:59:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:59:49,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:49,351 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 19:59:49,352 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 19:59:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash 572858118, now seen corresponding path program 1 times [2019-12-27 19:59:49,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:49,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900663700] [2019-12-27 19:59:49,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:49,457 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 19:59:49,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900663700] [2019-12-27 19:59:49,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:49,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:59:49,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [570003685] [2019-12-27 19:59:49,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:49,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:49,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 19:59:49,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:49,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:59:49,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:59:49,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:59:49,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:59:49,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:59:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:59:49,571 INFO L87 Difference]: Start difference. First operand 45311 states and 146879 transitions. Second operand 9 states. [2019-12-27 19:59:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:50,855 INFO L93 Difference]: Finished difference Result 72804 states and 228787 transitions. [2019-12-27 19:59:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:59:50,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-27 19:59:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:51,490 INFO L225 Difference]: With dead ends: 72804 [2019-12-27 19:59:51,491 INFO L226 Difference]: Without dead ends: 72790 [2019-12-27 19:59:51,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:59:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72790 states. [2019-12-27 19:59:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72790 to 44975. [2019-12-27 19:59:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44975 states. [2019-12-27 19:59:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44975 states to 44975 states and 144930 transitions. [2019-12-27 19:59:52,499 INFO L78 Accepts]: Start accepts. Automaton has 44975 states and 144930 transitions. Word has length 22 [2019-12-27 19:59:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:52,499 INFO L462 AbstractCegarLoop]: Abstraction has 44975 states and 144930 transitions. [2019-12-27 19:59:52,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:59:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 44975 states and 144930 transitions. [2019-12-27 19:59:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:59:52,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:52,517 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 19:59:52,517 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 19:59:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash -775936505, now seen corresponding path program 1 times [2019-12-27 19:59:52,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:52,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566494209] [2019-12-27 19:59:52,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:52,582 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 19:59:52,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566494209] [2019-12-27 19:59:52,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:52,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:52,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [641026036] [2019-12-27 19:59:52,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:52,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:52,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:59:52,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:52,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:59:52,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:59:52,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:52,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:59:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:59:52,624 INFO L87 Difference]: Start difference. First operand 44975 states and 144930 transitions. Second operand 5 states. [2019-12-27 19:59:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:52,717 INFO L93 Difference]: Finished difference Result 18102 states and 54995 transitions. [2019-12-27 19:59:52,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:59:52,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:59:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:52,746 INFO L225 Difference]: With dead ends: 18102 [2019-12-27 19:59:52,747 INFO L226 Difference]: Without dead ends: 18102 [2019-12-27 19:59:52,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:59:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18102 states. [2019-12-27 19:59:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18102 to 17802. [2019-12-27 19:59:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17802 states. [2019-12-27 19:59:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17802 states to 17802 states and 54181 transitions. [2019-12-27 19:59:53,038 INFO L78 Accepts]: Start accepts. Automaton has 17802 states and 54181 transitions. Word has length 25 [2019-12-27 19:59:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:53,038 INFO L462 AbstractCegarLoop]: Abstraction has 17802 states and 54181 transitions. [2019-12-27 19:59:53,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:59:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 17802 states and 54181 transitions. [2019-12-27 19:59:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:59:53,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:53,052 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 19:59:53,052 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 19:59:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:53,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1393972684, now seen corresponding path program 1 times [2019-12-27 19:59:53,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:53,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524639599] [2019-12-27 19:59:53,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:53,158 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 19:59:53,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524639599] [2019-12-27 19:59:53,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:53,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:59:53,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1090379178] [2019-12-27 19:59:53,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:53,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:53,171 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:59:53,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:53,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:53,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:59:53,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:53,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:59:53,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:59:53,173 INFO L87 Difference]: Start difference. First operand 17802 states and 54181 transitions. Second operand 6 states. [2019-12-27 19:59:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:53,740 INFO L93 Difference]: Finished difference Result 25666 states and 75651 transitions. [2019-12-27 19:59:53,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:59:53,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 19:59:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:53,785 INFO L225 Difference]: With dead ends: 25666 [2019-12-27 19:59:53,786 INFO L226 Difference]: Without dead ends: 25666 [2019-12-27 19:59:53,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:59:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25666 states. [2019-12-27 19:59:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25666 to 20719. [2019-12-27 19:59:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2019-12-27 19:59:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 62283 transitions. [2019-12-27 19:59:54,431 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 62283 transitions. Word has length 27 [2019-12-27 19:59:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:54,432 INFO L462 AbstractCegarLoop]: Abstraction has 20719 states and 62283 transitions. [2019-12-27 19:59:54,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:59:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 62283 transitions. [2019-12-27 19:59:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:59:54,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:54,454 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 19:59:54,454 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 19:59:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1695040076, now seen corresponding path program 1 times [2019-12-27 19:59:54,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:54,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357923636] [2019-12-27 19:59:54,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:54,527 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 19:59:54,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357923636] [2019-12-27 19:59:54,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:54,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:54,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97710432] [2019-12-27 19:59:54,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:54,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:54,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 74 transitions. [2019-12-27 19:59:54,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:54,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:59:54,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:59:54,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:54,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:59:54,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:59:54,593 INFO L87 Difference]: Start difference. First operand 20719 states and 62283 transitions. Second operand 6 states. [2019-12-27 19:59:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:55,089 INFO L93 Difference]: Finished difference Result 25941 states and 77027 transitions. [2019-12-27 19:59:55,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:59:55,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 19:59:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:55,138 INFO L225 Difference]: With dead ends: 25941 [2019-12-27 19:59:55,138 INFO L226 Difference]: Without dead ends: 25941 [2019-12-27 19:59:55,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:59:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25941 states. [2019-12-27 19:59:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25941 to 21961. [2019-12-27 19:59:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21961 states. [2019-12-27 19:59:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21961 states to 21961 states and 66303 transitions. [2019-12-27 19:59:55,561 INFO L78 Accepts]: Start accepts. Automaton has 21961 states and 66303 transitions. Word has length 33 [2019-12-27 19:59:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:55,562 INFO L462 AbstractCegarLoop]: Abstraction has 21961 states and 66303 transitions. [2019-12-27 19:59:55,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:59:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 21961 states and 66303 transitions. [2019-12-27 19:59:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:59:55,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:55,586 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 19:59:55,586 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 19:59:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:55,587 INFO L82 PathProgramCache]: Analyzing trace with hash 843232464, now seen corresponding path program 2 times [2019-12-27 19:59:55,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:55,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135591008] [2019-12-27 19:59:55,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:55,726 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 19:59:55,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135591008] [2019-12-27 19:59:55,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:55,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:59:55,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1096210284] [2019-12-27 19:59:55,728 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:55,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:55,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 19:59:55,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:55,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:59:55,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:59:55,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:59:55,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:55,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:59:55,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:59:55,865 INFO L87 Difference]: Start difference. First operand 21961 states and 66303 transitions. Second operand 11 states. [2019-12-27 19:59:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:57,825 INFO L93 Difference]: Finished difference Result 41081 states and 121295 transitions. [2019-12-27 19:59:57,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 19:59:57,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-12-27 19:59:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:57,888 INFO L225 Difference]: With dead ends: 41081 [2019-12-27 19:59:57,888 INFO L226 Difference]: Without dead ends: 41081 [2019-12-27 19:59:57,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:59:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41081 states. [2019-12-27 19:59:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41081 to 22293. [2019-12-27 19:59:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22293 states. [2019-12-27 19:59:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22293 states to 22293 states and 67787 transitions. [2019-12-27 19:59:58,406 INFO L78 Accepts]: Start accepts. Automaton has 22293 states and 67787 transitions. Word has length 33 [2019-12-27 19:59:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:58,407 INFO L462 AbstractCegarLoop]: Abstraction has 22293 states and 67787 transitions. [2019-12-27 19:59:58,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:59:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 22293 states and 67787 transitions. [2019-12-27 19:59:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:59:58,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:58,436 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 19:59:58,436 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 19:59:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 353210315, now seen corresponding path program 1 times [2019-12-27 19:59:58,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:58,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979761347] [2019-12-27 19:59:58,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:58,494 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 19:59:58,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979761347] [2019-12-27 19:59:58,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:58,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:59:58,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556875737] [2019-12-27 19:59:58,495 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:58,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:58,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 296 transitions. [2019-12-27 19:59:58,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:58,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:58,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:59:58,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:59:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:58,826 INFO L87 Difference]: Start difference. First operand 22293 states and 67787 transitions. Second operand 3 states. [2019-12-27 19:59:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:58,906 INFO L93 Difference]: Finished difference Result 22292 states and 67785 transitions. [2019-12-27 19:59:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:59:58,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 19:59:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:58,937 INFO L225 Difference]: With dead ends: 22292 [2019-12-27 19:59:58,937 INFO L226 Difference]: Without dead ends: 22292 [2019-12-27 19:59:58,937 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 19:59:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22292 states. [2019-12-27 19:59:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22292 to 22292. [2019-12-27 19:59:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22292 states. [2019-12-27 19:59:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22292 states to 22292 states and 67785 transitions. [2019-12-27 19:59:59,271 INFO L78 Accepts]: Start accepts. Automaton has 22292 states and 67785 transitions. Word has length 39 [2019-12-27 19:59:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:59,271 INFO L462 AbstractCegarLoop]: Abstraction has 22292 states and 67785 transitions. [2019-12-27 19:59:59,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:59:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22292 states and 67785 transitions. [2019-12-27 19:59:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:59:59,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:59,295 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 19:59:59,295 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 19:59:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1411726100, now seen corresponding path program 1 times [2019-12-27 19:59:59,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:59,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379542874] [2019-12-27 19:59:59,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:59,400 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 19:59:59,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379542874] [2019-12-27 19:59:59,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:59,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:59:59,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424277350] [2019-12-27 19:59:59,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:59,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:59,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 358 transitions. [2019-12-27 19:59:59,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:59,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 19:59:59,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:59:59,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:59:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:59:59,757 INFO L87 Difference]: Start difference. First operand 22292 states and 67785 transitions. Second operand 13 states. [2019-12-27 20:00:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:02,404 INFO L93 Difference]: Finished difference Result 81807 states and 244755 transitions. [2019-12-27 20:00:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:00:02,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-12-27 20:00:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:02,531 INFO L225 Difference]: With dead ends: 81807 [2019-12-27 20:00:02,531 INFO L226 Difference]: Without dead ends: 81807 [2019-12-27 20:00:02,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:00:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81807 states. [2019-12-27 20:00:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81807 to 28279. [2019-12-27 20:00:03,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28279 states. [2019-12-27 20:00:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28279 states to 28279 states and 86088 transitions. [2019-12-27 20:00:03,876 INFO L78 Accepts]: Start accepts. Automaton has 28279 states and 86088 transitions. Word has length 40 [2019-12-27 20:00:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:03,877 INFO L462 AbstractCegarLoop]: Abstraction has 28279 states and 86088 transitions. [2019-12-27 20:00:03,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 20:00:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 28279 states and 86088 transitions. [2019-12-27 20:00:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:00:03,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:03,914 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 20:00:03,914 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 20:00:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1919201076, now seen corresponding path program 2 times [2019-12-27 20:00:03,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:03,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923562843] [2019-12-27 20:00:03,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:03,996 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 20:00:03,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923562843] [2019-12-27 20:00:03,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:03,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:00:03,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1787708779] [2019-12-27 20:00:03,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:04,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:04,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 404 transitions. [2019-12-27 20:00:04,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:04,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:00:04,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:00:04,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:04,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:00:04,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:00:04,120 INFO L87 Difference]: Start difference. First operand 28279 states and 86088 transitions. Second operand 6 states. [2019-12-27 20:00:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:05,069 INFO L93 Difference]: Finished difference Result 38884 states and 117950 transitions. [2019-12-27 20:00:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:00:05,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 20:00:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:05,132 INFO L225 Difference]: With dead ends: 38884 [2019-12-27 20:00:05,133 INFO L226 Difference]: Without dead ends: 38884 [2019-12-27 20:00:05,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38884 states. [2019-12-27 20:00:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38884 to 34173. [2019-12-27 20:00:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34173 states. [2019-12-27 20:00:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34173 states to 34173 states and 104547 transitions. [2019-12-27 20:00:05,721 INFO L78 Accepts]: Start accepts. Automaton has 34173 states and 104547 transitions. Word has length 40 [2019-12-27 20:00:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:05,721 INFO L462 AbstractCegarLoop]: Abstraction has 34173 states and 104547 transitions. [2019-12-27 20:00:05,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:00:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34173 states and 104547 transitions. [2019-12-27 20:00:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:00:05,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:05,770 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 20:00:05,771 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 20:00:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1859885306, now seen corresponding path program 3 times [2019-12-27 20:00:05,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:05,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299541758] [2019-12-27 20:00:05,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:05,863 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 20:00:05,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299541758] [2019-12-27 20:00:05,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:05,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:05,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522229619] [2019-12-27 20:00:05,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:05,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:05,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 20:00:05,962 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:05,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:00:05,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:05,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:05,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:05,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:05,967 INFO L87 Difference]: Start difference. First operand 34173 states and 104547 transitions. Second operand 3 states. [2019-12-27 20:00:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:06,091 INFO L93 Difference]: Finished difference Result 34073 states and 104238 transitions. [2019-12-27 20:00:06,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:06,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 20:00:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:06,165 INFO L225 Difference]: With dead ends: 34073 [2019-12-27 20:00:06,165 INFO L226 Difference]: Without dead ends: 34073 [2019-12-27 20:00:06,166 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 20:00:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34073 states. [2019-12-27 20:00:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34073 to 29003. [2019-12-27 20:00:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29003 states. [2019-12-27 20:00:07,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29003 states to 29003 states and 89799 transitions. [2019-12-27 20:00:07,130 INFO L78 Accepts]: Start accepts. Automaton has 29003 states and 89799 transitions. Word has length 40 [2019-12-27 20:00:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:07,130 INFO L462 AbstractCegarLoop]: Abstraction has 29003 states and 89799 transitions. [2019-12-27 20:00:07,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:07,130 INFO L276 IsEmpty]: Start isEmpty. Operand 29003 states and 89799 transitions. [2019-12-27 20:00:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:00:07,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:07,164 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] [2019-12-27 20:00:07,164 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 20:00:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1927216762, now seen corresponding path program 1 times [2019-12-27 20:00:07,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:07,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802813775] [2019-12-27 20:00:07,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:07,235 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 20:00:07,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802813775] [2019-12-27 20:00:07,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:07,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:00:07,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394385059] [2019-12-27 20:00:07,236 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:07,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:07,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 359 transitions. [2019-12-27 20:00:07,327 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:07,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:00:07,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:00:07,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:00:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:07,374 INFO L87 Difference]: Start difference. First operand 29003 states and 89799 transitions. Second operand 7 states. [2019-12-27 20:00:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:07,547 INFO L93 Difference]: Finished difference Result 27560 states and 86536 transitions. [2019-12-27 20:00:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:00:07,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 20:00:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:07,618 INFO L225 Difference]: With dead ends: 27560 [2019-12-27 20:00:07,618 INFO L226 Difference]: Without dead ends: 26077 [2019-12-27 20:00:07,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26077 states. [2019-12-27 20:00:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26077 to 25933. [2019-12-27 20:00:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25933 states. [2019-12-27 20:00:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25933 states to 25933 states and 82354 transitions. [2019-12-27 20:00:08,343 INFO L78 Accepts]: Start accepts. Automaton has 25933 states and 82354 transitions. Word has length 41 [2019-12-27 20:00:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:08,344 INFO L462 AbstractCegarLoop]: Abstraction has 25933 states and 82354 transitions. [2019-12-27 20:00:08,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:00:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25933 states and 82354 transitions. [2019-12-27 20:00:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:00:08,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:08,396 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 20:00:08,397 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 20:00:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:08,397 INFO L82 PathProgramCache]: Analyzing trace with hash 482834342, now seen corresponding path program 1 times [2019-12-27 20:00:08,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:08,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558736970] [2019-12-27 20:00:08,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:08,456 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 20:00:08,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558736970] [2019-12-27 20:00:08,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:08,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:08,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305110473] [2019-12-27 20:00:08,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:08,479 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:08,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 413 transitions. [2019-12-27 20:00:08,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:08,726 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:00:08,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:08,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:08,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:08,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:08,727 INFO L87 Difference]: Start difference. First operand 25933 states and 82354 transitions. Second operand 3 states. [2019-12-27 20:00:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:08,870 INFO L93 Difference]: Finished difference Result 31919 states and 100655 transitions. [2019-12-27 20:00:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:08,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:00:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:08,920 INFO L225 Difference]: With dead ends: 31919 [2019-12-27 20:00:08,921 INFO L226 Difference]: Without dead ends: 31919 [2019-12-27 20:00:08,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 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 20:00:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31919 states. [2019-12-27 20:00:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31919 to 23882. [2019-12-27 20:00:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23882 states. [2019-12-27 20:00:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23882 states to 23882 states and 75736 transitions. [2019-12-27 20:00:09,368 INFO L78 Accepts]: Start accepts. Automaton has 23882 states and 75736 transitions. Word has length 65 [2019-12-27 20:00:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:09,368 INFO L462 AbstractCegarLoop]: Abstraction has 23882 states and 75736 transitions. [2019-12-27 20:00:09,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 23882 states and 75736 transitions. [2019-12-27 20:00:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:00:09,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:09,393 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 20:00:09,393 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 20:00:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1347625235, now seen corresponding path program 1 times [2019-12-27 20:00:09,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:09,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583888423] [2019-12-27 20:00:09,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:09,497 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 20:00:09,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583888423] [2019-12-27 20:00:09,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:09,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:00:09,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300696692] [2019-12-27 20:00:09,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:09,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:10,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 413 transitions. [2019-12-27 20:00:10,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:10,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 20:00:10,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:00:10,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:10,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:00:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:00:10,252 INFO L87 Difference]: Start difference. First operand 23882 states and 75736 transitions. Second operand 11 states. [2019-12-27 20:00:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:12,545 INFO L93 Difference]: Finished difference Result 87200 states and 272905 transitions. [2019-12-27 20:00:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:00:12,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 20:00:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:12,649 INFO L225 Difference]: With dead ends: 87200 [2019-12-27 20:00:12,649 INFO L226 Difference]: Without dead ends: 66273 [2019-12-27 20:00:12,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-12-27 20:00:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66273 states. [2019-12-27 20:00:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66273 to 28174. [2019-12-27 20:00:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28174 states. [2019-12-27 20:00:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28174 states to 28174 states and 89497 transitions. [2019-12-27 20:00:13,431 INFO L78 Accepts]: Start accepts. Automaton has 28174 states and 89497 transitions. Word has length 65 [2019-12-27 20:00:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:13,431 INFO L462 AbstractCegarLoop]: Abstraction has 28174 states and 89497 transitions. [2019-12-27 20:00:13,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:00:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 28174 states and 89497 transitions. [2019-12-27 20:00:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:00:13,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:13,461 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 20:00:13,461 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 20:00:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1859069805, now seen corresponding path program 2 times [2019-12-27 20:00:13,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:13,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579086315] [2019-12-27 20:00:13,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:13,555 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 20:00:13,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579086315] [2019-12-27 20:00:13,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:13,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:00:13,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [236049949] [2019-12-27 20:00:13,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:13,577 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:14,243 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 287 states and 548 transitions. [2019-12-27 20:00:14,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:14,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:00:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:00:14,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:00:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:14,285 INFO L87 Difference]: Start difference. First operand 28174 states and 89497 transitions. Second operand 7 states. [2019-12-27 20:00:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:14,852 INFO L93 Difference]: Finished difference Result 69005 states and 216230 transitions. [2019-12-27 20:00:14,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:00:14,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 20:00:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:14,934 INFO L225 Difference]: With dead ends: 69005 [2019-12-27 20:00:14,934 INFO L226 Difference]: Without dead ends: 49841 [2019-12-27 20:00:14,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:00:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49841 states. [2019-12-27 20:00:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49841 to 32236. [2019-12-27 20:00:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32236 states. [2019-12-27 20:00:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32236 states to 32236 states and 102060 transitions. [2019-12-27 20:00:15,657 INFO L78 Accepts]: Start accepts. Automaton has 32236 states and 102060 transitions. Word has length 65 [2019-12-27 20:00:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:15,658 INFO L462 AbstractCegarLoop]: Abstraction has 32236 states and 102060 transitions. [2019-12-27 20:00:15,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:00:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 32236 states and 102060 transitions. [2019-12-27 20:00:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:00:15,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:15,697 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 20:00:15,697 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 20:00:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1166151863, now seen corresponding path program 3 times [2019-12-27 20:00:15,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:15,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878744490] [2019-12-27 20:00:15,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:15,790 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 20:00:15,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878744490] [2019-12-27 20:00:15,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:15,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:00:15,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1404667862] [2019-12-27 20:00:15,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:15,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:16,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 427 transitions. [2019-12-27 20:00:16,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:16,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:00:16,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:00:16,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:00:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:00:16,122 INFO L87 Difference]: Start difference. First operand 32236 states and 102060 transitions. Second operand 8 states. [2019-12-27 20:00:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:17,272 INFO L93 Difference]: Finished difference Result 84480 states and 266498 transitions. [2019-12-27 20:00:17,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 20:00:17,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 20:00:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:17,390 INFO L225 Difference]: With dead ends: 84480 [2019-12-27 20:00:17,390 INFO L226 Difference]: Without dead ends: 75196 [2019-12-27 20:00:17,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:00:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75196 states. [2019-12-27 20:00:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75196 to 32700. [2019-12-27 20:00:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32700 states. [2019-12-27 20:00:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32700 states to 32700 states and 103904 transitions. [2019-12-27 20:00:18,784 INFO L78 Accepts]: Start accepts. Automaton has 32700 states and 103904 transitions. Word has length 65 [2019-12-27 20:00:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:18,784 INFO L462 AbstractCegarLoop]: Abstraction has 32700 states and 103904 transitions. [2019-12-27 20:00:18,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:00:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 32700 states and 103904 transitions. [2019-12-27 20:00:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:00:18,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:18,824 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 20:00:18,824 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 20:00:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1738755691, now seen corresponding path program 4 times [2019-12-27 20:00:18,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:18,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599081019] [2019-12-27 20:00:18,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:18,936 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 20:00:18,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599081019] [2019-12-27 20:00:18,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:18,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:00:18,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138998984] [2019-12-27 20:00:18,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:18,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:19,151 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 344 transitions. [2019-12-27 20:00:19,151 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:19,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:00:19,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:00:19,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:00:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:00:19,288 INFO L87 Difference]: Start difference. First operand 32700 states and 103904 transitions. Second operand 11 states. [2019-12-27 20:00:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:22,198 INFO L93 Difference]: Finished difference Result 126723 states and 394308 transitions. [2019-12-27 20:00:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 20:00:22,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 20:00:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:22,379 INFO L225 Difference]: With dead ends: 126723 [2019-12-27 20:00:22,379 INFO L226 Difference]: Without dead ends: 113532 [2019-12-27 20:00:22,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=569, Invalid=2083, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 20:00:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113532 states. [2019-12-27 20:00:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113532 to 32773. [2019-12-27 20:00:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32773 states. [2019-12-27 20:00:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32773 states to 32773 states and 104223 transitions. [2019-12-27 20:00:24,094 INFO L78 Accepts]: Start accepts. Automaton has 32773 states and 104223 transitions. Word has length 65 [2019-12-27 20:00:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:24,094 INFO L462 AbstractCegarLoop]: Abstraction has 32773 states and 104223 transitions. [2019-12-27 20:00:24,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:00:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 32773 states and 104223 transitions. [2019-12-27 20:00:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 20:00:24,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:24,128 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 20:00:24,128 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 20:00:24,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash -20463533, now seen corresponding path program 5 times [2019-12-27 20:00:24,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:24,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143052335] [2019-12-27 20:00:24,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:24,187 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 20:00:24,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143052335] [2019-12-27 20:00:24,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:24,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:24,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [481451848] [2019-12-27 20:00:24,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:24,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:24,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 345 transitions. [2019-12-27 20:00:24,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:24,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:00:24,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:24,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:24,368 INFO L87 Difference]: Start difference. First operand 32773 states and 104223 transitions. Second operand 3 states. [2019-12-27 20:00:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:24,541 INFO L93 Difference]: Finished difference Result 38250 states and 120770 transitions. [2019-12-27 20:00:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:24,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 20:00:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:24,598 INFO L225 Difference]: With dead ends: 38250 [2019-12-27 20:00:24,599 INFO L226 Difference]: Without dead ends: 38250 [2019-12-27 20:00:24,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 20:00:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38250 states. [2019-12-27 20:00:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38250 to 33549. [2019-12-27 20:00:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33549 states. [2019-12-27 20:00:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33549 states to 33549 states and 107038 transitions. [2019-12-27 20:00:25,196 INFO L78 Accepts]: Start accepts. Automaton has 33549 states and 107038 transitions. Word has length 65 [2019-12-27 20:00:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:25,196 INFO L462 AbstractCegarLoop]: Abstraction has 33549 states and 107038 transitions. [2019-12-27 20:00:25,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33549 states and 107038 transitions. [2019-12-27 20:00:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:25,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:25,233 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 20:00:25,233 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 20:00:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1278998798, now seen corresponding path program 1 times [2019-12-27 20:00:25,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:25,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435382245] [2019-12-27 20:00:25,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:25,286 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 20:00:25,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435382245] [2019-12-27 20:00:25,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:25,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:00:25,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [637510469] [2019-12-27 20:00:25,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:25,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:25,956 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 445 transitions. [2019-12-27 20:00:25,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:25,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:00:25,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:00:25,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:25,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:00:25,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:00:25,988 INFO L87 Difference]: Start difference. First operand 33549 states and 107038 transitions. Second operand 5 states. [2019-12-27 20:00:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:26,642 INFO L93 Difference]: Finished difference Result 56235 states and 178287 transitions. [2019-12-27 20:00:26,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:00:26,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 20:00:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:26,743 INFO L225 Difference]: With dead ends: 56235 [2019-12-27 20:00:26,743 INFO L226 Difference]: Without dead ends: 56235 [2019-12-27 20:00:26,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56235 states. [2019-12-27 20:00:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56235 to 36561. [2019-12-27 20:00:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36561 states. [2019-12-27 20:00:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36561 states to 36561 states and 117800 transitions. [2019-12-27 20:00:27,584 INFO L78 Accepts]: Start accepts. Automaton has 36561 states and 117800 transitions. Word has length 66 [2019-12-27 20:00:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:27,584 INFO L462 AbstractCegarLoop]: Abstraction has 36561 states and 117800 transitions. [2019-12-27 20:00:27,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:00:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36561 states and 117800 transitions. [2019-12-27 20:00:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:27,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:27,627 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 20:00:27,627 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 20:00:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:27,628 INFO L82 PathProgramCache]: Analyzing trace with hash -789500612, now seen corresponding path program 2 times [2019-12-27 20:00:27,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:27,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765300864] [2019-12-27 20:00:27,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:27,670 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 20:00:27,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765300864] [2019-12-27 20:00:27,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:27,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:27,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72212771] [2019-12-27 20:00:27,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:27,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:27,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 333 transitions. [2019-12-27 20:00:27,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:27,949 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:00:27,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:27,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:27,950 INFO L87 Difference]: Start difference. First operand 36561 states and 117800 transitions. Second operand 3 states. [2019-12-27 20:00:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:28,467 INFO L93 Difference]: Finished difference Result 50635 states and 161648 transitions. [2019-12-27 20:00:28,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:28,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 20:00:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:28,601 INFO L225 Difference]: With dead ends: 50635 [2019-12-27 20:00:28,601 INFO L226 Difference]: Without dead ends: 50635 [2019-12-27 20:00:28,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 20:00:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50635 states. [2019-12-27 20:00:30,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50635 to 36570. [2019-12-27 20:00:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36570 states. [2019-12-27 20:00:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36570 states to 36570 states and 117795 transitions. [2019-12-27 20:00:30,379 INFO L78 Accepts]: Start accepts. Automaton has 36570 states and 117795 transitions. Word has length 66 [2019-12-27 20:00:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:30,380 INFO L462 AbstractCegarLoop]: Abstraction has 36570 states and 117795 transitions. [2019-12-27 20:00:30,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36570 states and 117795 transitions. [2019-12-27 20:00:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:30,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:30,465 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 20:00:30,465 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 20:00:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1493977688, now seen corresponding path program 3 times [2019-12-27 20:00:30,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:30,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168895642] [2019-12-27 20:00:30,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:30,629 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 20:00:30,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168895642] [2019-12-27 20:00:30,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:30,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:00:30,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [499271637] [2019-12-27 20:00:30,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:30,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:30,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 399 transitions. [2019-12-27 20:00:30,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:31,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:00:31,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:00:31,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:31,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:00:31,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:00:31,072 INFO L87 Difference]: Start difference. First operand 36570 states and 117795 transitions. Second operand 10 states. [2019-12-27 20:00:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:36,492 INFO L93 Difference]: Finished difference Result 199474 states and 621104 transitions. [2019-12-27 20:00:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 20:00:36,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 20:00:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:36,766 INFO L225 Difference]: With dead ends: 199474 [2019-12-27 20:00:36,766 INFO L226 Difference]: Without dead ends: 165073 [2019-12-27 20:00:36,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=679, Invalid=2861, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 20:00:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165073 states. [2019-12-27 20:00:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165073 to 39214. [2019-12-27 20:00:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39214 states. [2019-12-27 20:00:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39214 states to 39214 states and 127074 transitions. [2019-12-27 20:00:39,182 INFO L78 Accepts]: Start accepts. Automaton has 39214 states and 127074 transitions. Word has length 66 [2019-12-27 20:00:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:39,182 INFO L462 AbstractCegarLoop]: Abstraction has 39214 states and 127074 transitions. [2019-12-27 20:00:39,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:00:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 39214 states and 127074 transitions. [2019-12-27 20:00:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:39,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:39,227 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 20:00:39,227 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 20:00:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 296393914, now seen corresponding path program 4 times [2019-12-27 20:00:39,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:39,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972830775] [2019-12-27 20:00:39,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:39,347 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 20:00:39,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972830775] [2019-12-27 20:00:39,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:39,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:00:39,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745686710] [2019-12-27 20:00:39,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:39,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:39,587 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 384 transitions. [2019-12-27 20:00:39,587 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:39,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:00:39,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:00:39,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:00:39,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:00:39,645 INFO L87 Difference]: Start difference. First operand 39214 states and 127074 transitions. Second operand 10 states. [2019-12-27 20:00:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:41,681 INFO L93 Difference]: Finished difference Result 147514 states and 466171 transitions. [2019-12-27 20:00:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 20:00:41,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 20:00:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:42,559 INFO L225 Difference]: With dead ends: 147514 [2019-12-27 20:00:42,559 INFO L226 Difference]: Without dead ends: 123738 [2019-12-27 20:00:42,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1037, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 20:00:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123738 states. [2019-12-27 20:00:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123738 to 40416. [2019-12-27 20:00:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40416 states. [2019-12-27 20:00:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40416 states to 40416 states and 131050 transitions. [2019-12-27 20:00:43,941 INFO L78 Accepts]: Start accepts. Automaton has 40416 states and 131050 transitions. Word has length 66 [2019-12-27 20:00:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:43,942 INFO L462 AbstractCegarLoop]: Abstraction has 40416 states and 131050 transitions. [2019-12-27 20:00:43,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:00:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 40416 states and 131050 transitions. [2019-12-27 20:00:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 20:00:43,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:43,993 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 20:00:43,993 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 20:00:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1869416178, now seen corresponding path program 1 times [2019-12-27 20:00:43,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:43,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376414615] [2019-12-27 20:00:43,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:44,061 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 20:00:44,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376414615] [2019-12-27 20:00:44,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:44,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:44,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1135723010] [2019-12-27 20:00:44,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:44,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:44,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 348 transitions. [2019-12-27 20:00:44,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:44,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:00:44,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:00:44,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:00:44,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:00:44,344 INFO L87 Difference]: Start difference. First operand 40416 states and 131050 transitions. Second operand 6 states. [2019-12-27 20:00:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:44,792 INFO L93 Difference]: Finished difference Result 41551 states and 130853 transitions. [2019-12-27 20:00:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:00:44,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 20:00:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:44,859 INFO L225 Difference]: With dead ends: 41551 [2019-12-27 20:00:44,859 INFO L226 Difference]: Without dead ends: 41551 [2019-12-27 20:00:44,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:00:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41551 states. [2019-12-27 20:00:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41551 to 29343. [2019-12-27 20:00:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2019-12-27 20:00:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 93182 transitions. [2019-12-27 20:00:45,434 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 93182 transitions. Word has length 66 [2019-12-27 20:00:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:45,434 INFO L462 AbstractCegarLoop]: Abstraction has 29343 states and 93182 transitions. [2019-12-27 20:00:45,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:00:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 93182 transitions. [2019-12-27 20:00:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:45,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:45,465 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 20:00:45,465 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 20:00:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1833062279, now seen corresponding path program 1 times [2019-12-27 20:00:45,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:45,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960148709] [2019-12-27 20:00:45,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:45,568 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 20:00:45,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960148709] [2019-12-27 20:00:45,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:45,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:00:45,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598622037] [2019-12-27 20:00:45,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:45,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:46,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 397 transitions. [2019-12-27 20:00:46,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:46,221 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 20:00:46,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:00:46,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:00:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:00:46,222 INFO L87 Difference]: Start difference. First operand 29343 states and 93182 transitions. Second operand 11 states. [2019-12-27 20:00:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:47,827 INFO L93 Difference]: Finished difference Result 53018 states and 166799 transitions. [2019-12-27 20:00:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:00:47,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 20:00:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:47,901 INFO L225 Difference]: With dead ends: 53018 [2019-12-27 20:00:47,902 INFO L226 Difference]: Without dead ends: 44183 [2019-12-27 20:00:47,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:00:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44183 states. [2019-12-27 20:00:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44183 to 30162. [2019-12-27 20:00:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30162 states. [2019-12-27 20:00:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30162 states to 30162 states and 95242 transitions. [2019-12-27 20:00:48,521 INFO L78 Accepts]: Start accepts. Automaton has 30162 states and 95242 transitions. Word has length 67 [2019-12-27 20:00:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:48,521 INFO L462 AbstractCegarLoop]: Abstraction has 30162 states and 95242 transitions. [2019-12-27 20:00:48,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:00:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 30162 states and 95242 transitions. [2019-12-27 20:00:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:48,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:48,555 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 20:00:48,555 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 20:00:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1111850191, now seen corresponding path program 2 times [2019-12-27 20:00:48,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:48,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460394938] [2019-12-27 20:00:48,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:48,609 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 20:00:48,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460394938] [2019-12-27 20:00:48,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:48,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:00:48,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314723287] [2019-12-27 20:00:48,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:48,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:48,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 492 transitions. [2019-12-27 20:00:48,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:48,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:00:48,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:00:48,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:00:48,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:00:48,949 INFO L87 Difference]: Start difference. First operand 30162 states and 95242 transitions. Second operand 4 states. [2019-12-27 20:00:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:49,218 INFO L93 Difference]: Finished difference Result 30162 states and 95018 transitions. [2019-12-27 20:00:49,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:00:49,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 20:00:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:49,280 INFO L225 Difference]: With dead ends: 30162 [2019-12-27 20:00:49,281 INFO L226 Difference]: Without dead ends: 30162 [2019-12-27 20:00:49,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 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 20:00:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30162 states. [2019-12-27 20:00:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30162 to 25074. [2019-12-27 20:00:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25074 states. [2019-12-27 20:00:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25074 states to 25074 states and 78617 transitions. [2019-12-27 20:00:50,063 INFO L78 Accepts]: Start accepts. Automaton has 25074 states and 78617 transitions. Word has length 67 [2019-12-27 20:00:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:50,064 INFO L462 AbstractCegarLoop]: Abstraction has 25074 states and 78617 transitions. [2019-12-27 20:00:50,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:00:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 25074 states and 78617 transitions. [2019-12-27 20:00:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:50,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:50,088 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 20:00:50,089 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 20:00:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1228876713, now seen corresponding path program 1 times [2019-12-27 20:00:50,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:50,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292188363] [2019-12-27 20:00:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:50,242 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 20:00:50,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292188363] [2019-12-27 20:00:50,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:50,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:00:50,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [855974871] [2019-12-27 20:00:50,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:50,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:50,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 490 transitions. [2019-12-27 20:00:50,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:50,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:00:50,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:00:50,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:00:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:00:50,439 INFO L87 Difference]: Start difference. First operand 25074 states and 78617 transitions. Second operand 10 states. [2019-12-27 20:00:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:51,426 INFO L93 Difference]: Finished difference Result 47790 states and 149025 transitions. [2019-12-27 20:00:51,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 20:00:51,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 20:00:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:51,499 INFO L225 Difference]: With dead ends: 47790 [2019-12-27 20:00:51,499 INFO L226 Difference]: Without dead ends: 45875 [2019-12-27 20:00:51,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 20:00:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45875 states. [2019-12-27 20:00:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45875 to 28651. [2019-12-27 20:00:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28651 states. [2019-12-27 20:00:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28651 states to 28651 states and 89787 transitions. [2019-12-27 20:00:52,108 INFO L78 Accepts]: Start accepts. Automaton has 28651 states and 89787 transitions. Word has length 67 [2019-12-27 20:00:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:52,108 INFO L462 AbstractCegarLoop]: Abstraction has 28651 states and 89787 transitions. [2019-12-27 20:00:52,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:00:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 28651 states and 89787 transitions. [2019-12-27 20:00:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:52,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:52,141 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 20:00:52,141 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 20:00:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1322343339, now seen corresponding path program 2 times [2019-12-27 20:00:52,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:52,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291389468] [2019-12-27 20:00:52,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:52,285 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 20:00:52,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291389468] [2019-12-27 20:00:52,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:52,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:00:52,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786247975] [2019-12-27 20:00:52,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:52,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:52,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 314 states and 639 transitions. [2019-12-27 20:00:52,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:52,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:00:52,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:00:52,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:52,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:00:52,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:00:52,808 INFO L87 Difference]: Start difference. First operand 28651 states and 89787 transitions. Second operand 11 states. [2019-12-27 20:00:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:54,721 INFO L93 Difference]: Finished difference Result 55939 states and 173590 transitions. [2019-12-27 20:00:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 20:00:54,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 20:00:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:54,795 INFO L225 Difference]: With dead ends: 55939 [2019-12-27 20:00:54,795 INFO L226 Difference]: Without dead ends: 48944 [2019-12-27 20:00:54,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 20:00:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48944 states. [2019-12-27 20:00:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48944 to 24541. [2019-12-27 20:00:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24541 states. [2019-12-27 20:00:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24541 states to 24541 states and 76706 transitions. [2019-12-27 20:00:55,384 INFO L78 Accepts]: Start accepts. Automaton has 24541 states and 76706 transitions. Word has length 67 [2019-12-27 20:00:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:55,384 INFO L462 AbstractCegarLoop]: Abstraction has 24541 states and 76706 transitions. [2019-12-27 20:00:55,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:00:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 24541 states and 76706 transitions. [2019-12-27 20:00:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:00:55,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:55,409 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 20:00:55,409 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 20:00:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash -163030355, now seen corresponding path program 3 times [2019-12-27 20:00:55,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:55,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074198397] [2019-12-27 20:00:55,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:56,067 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 20:00:56,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074198397] [2019-12-27 20:00:56,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:56,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 20:00:56,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217218136] [2019-12-27 20:00:56,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:56,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:56,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 513 transitions. [2019-12-27 20:00:56,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:56,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:56,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:00:56,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:00:56,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 20:00:56,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 20:00:56,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 20:00:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:00:56,948 INFO L87 Difference]: Start difference. First operand 24541 states and 76706 transitions. Second operand 24 states. [2019-12-27 20:01:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:02,682 INFO L93 Difference]: Finished difference Result 34111 states and 105164 transitions. [2019-12-27 20:01:02,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 20:01:02,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2019-12-27 20:01:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:02,907 INFO L225 Difference]: With dead ends: 34111 [2019-12-27 20:01:02,907 INFO L226 Difference]: Without dead ends: 32328 [2019-12-27 20:01:02,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 20:01:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32328 states. [2019-12-27 20:01:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32328 to 24877. [2019-12-27 20:01:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24877 states. [2019-12-27 20:01:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24877 states to 24877 states and 77627 transitions. [2019-12-27 20:01:03,345 INFO L78 Accepts]: Start accepts. Automaton has 24877 states and 77627 transitions. Word has length 67 [2019-12-27 20:01:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:03,346 INFO L462 AbstractCegarLoop]: Abstraction has 24877 states and 77627 transitions. [2019-12-27 20:01:03,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 20:01:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 24877 states and 77627 transitions. [2019-12-27 20:01:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:01:03,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:03,374 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 20:01:03,374 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 20:01:03,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:03,375 INFO L82 PathProgramCache]: Analyzing trace with hash 713576877, now seen corresponding path program 4 times [2019-12-27 20:01:03,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:03,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541360961] [2019-12-27 20:01:03,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:03,554 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 20:01:03,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541360961] [2019-12-27 20:01:03,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:03,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:01:03,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [857115525] [2019-12-27 20:01:03,555 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:03,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:03,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 526 transitions. [2019-12-27 20:01:03,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:03,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:01:03,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:01:03,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:01:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:01:03,933 INFO L87 Difference]: Start difference. First operand 24877 states and 77627 transitions. Second operand 12 states. [2019-12-27 20:01:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:06,071 INFO L93 Difference]: Finished difference Result 52403 states and 162336 transitions. [2019-12-27 20:01:06,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 20:01:06,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 20:01:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:06,149 INFO L225 Difference]: With dead ends: 52403 [2019-12-27 20:01:06,149 INFO L226 Difference]: Without dead ends: 51384 [2019-12-27 20:01:06,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 20:01:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51384 states. [2019-12-27 20:01:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51384 to 27443. [2019-12-27 20:01:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27443 states. [2019-12-27 20:01:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27443 states to 27443 states and 85632 transitions. [2019-12-27 20:01:06,807 INFO L78 Accepts]: Start accepts. Automaton has 27443 states and 85632 transitions. Word has length 67 [2019-12-27 20:01:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:06,807 INFO L462 AbstractCegarLoop]: Abstraction has 27443 states and 85632 transitions. [2019-12-27 20:01:06,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:01:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27443 states and 85632 transitions. [2019-12-27 20:01:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:01:06,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:06,835 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 20:01:06,835 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 20:01:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1030170367, now seen corresponding path program 5 times [2019-12-27 20:01:06,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:06,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294219167] [2019-12-27 20:01:06,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:07,354 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 20:01:07,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294219167] [2019-12-27 20:01:07,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:07,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 20:01:07,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489144972] [2019-12-27 20:01:07,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:07,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:07,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 318 states and 655 transitions. [2019-12-27 20:01:07,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:07,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:01:08,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 20:01:08,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 20:01:08,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:08,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 20:01:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:01:08,288 INFO L87 Difference]: Start difference. First operand 27443 states and 85632 transitions. Second operand 19 states. [2019-12-27 20:01:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:12,711 INFO L93 Difference]: Finished difference Result 43614 states and 134837 transitions. [2019-12-27 20:01:12,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 20:01:12,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 20:01:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:12,771 INFO L225 Difference]: With dead ends: 43614 [2019-12-27 20:01:12,771 INFO L226 Difference]: Without dead ends: 39619 [2019-12-27 20:01:12,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 17 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 20:01:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39619 states. [2019-12-27 20:01:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39619 to 24122. [2019-12-27 20:01:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24122 states. [2019-12-27 20:01:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24122 states to 24122 states and 75275 transitions. [2019-12-27 20:01:13,297 INFO L78 Accepts]: Start accepts. Automaton has 24122 states and 75275 transitions. Word has length 67 [2019-12-27 20:01:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:13,298 INFO L462 AbstractCegarLoop]: Abstraction has 24122 states and 75275 transitions. [2019-12-27 20:01:13,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 20:01:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24122 states and 75275 transitions. [2019-12-27 20:01:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:01:13,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:13,326 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 20:01:13,326 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 20:01:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 869682389, now seen corresponding path program 6 times [2019-12-27 20:01:13,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:13,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848085734] [2019-12-27 20:01:13,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:13,741 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 20:01:13,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848085734] [2019-12-27 20:01:13,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:13,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 20:01:13,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259771825] [2019-12-27 20:01:13,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:13,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:13,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 498 transitions. [2019-12-27 20:01:13,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:01:14,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 20:01:14,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:01:14,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:01:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:01:14,361 INFO L87 Difference]: Start difference. First operand 24122 states and 75275 transitions. Second operand 20 states. [2019-12-27 20:01:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:21,676 INFO L93 Difference]: Finished difference Result 41573 states and 127674 transitions. [2019-12-27 20:01:21,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 20:01:21,676 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 20:01:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:21,736 INFO L225 Difference]: With dead ends: 41573 [2019-12-27 20:01:21,736 INFO L226 Difference]: Without dead ends: 41322 [2019-12-27 20:01:21,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 16 SyntacticMatches, 14 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=437, Invalid=2533, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 20:01:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41322 states. [2019-12-27 20:01:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41322 to 23946. [2019-12-27 20:01:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23946 states. [2019-12-27 20:01:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23946 states to 23946 states and 74803 transitions. [2019-12-27 20:01:22,244 INFO L78 Accepts]: Start accepts. Automaton has 23946 states and 74803 transitions. Word has length 67 [2019-12-27 20:01:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:22,245 INFO L462 AbstractCegarLoop]: Abstraction has 23946 states and 74803 transitions. [2019-12-27 20:01:22,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:01:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23946 states and 74803 transitions. [2019-12-27 20:01:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 20:01:22,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:01:22,270 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 20:01:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1815001603, now seen corresponding path program 7 times [2019-12-27 20:01:22,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:22,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603976532] [2019-12-27 20:01:22,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:01:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:01:22,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:01:22,397 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:01:22,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~a$read_delayed_var~0.offset_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t263~0.base_25|) |v_ULTIMATE.start_main_~#t263~0.offset_19| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~a$r_buff0_thd3~0_77 0) (= v_~x~0_10 0) (= v_~a$r_buff0_thd1~0_27 0) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t263~0.base_25| 4)) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= (store .cse0 |v_ULTIMATE.start_main_~#t263~0.base_25| 1) |v_#valid_55|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t263~0.base_25|) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~a$w_buff1~0_26) (= v_~a$mem_tmp~0_10 0) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~y~0_8) (= 0 v_~a$r_buff1_thd0~0_22) (= v_~a$r_buff0_thd2~0_21 0) (= |v_#NULL.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t263~0.base_25|)) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= 0 v_~z~0_8) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~a$r_buff1_thd1~0_17) (= v_~main$tmp_guard0~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t263~0.offset_19|) (= v_~a$r_buff0_thd0~0_21 0) (= v_~a~0_27 0) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t263~0.offset=|v_ULTIMATE.start_main_~#t263~0.offset_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_17|, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ~a$read_delayed~0=v_~a$read_delayed~0_8, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_17|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_26, ~y~0=v_~y~0_8, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_21|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t263~0.base=|v_ULTIMATE.start_main_~#t263~0.base_25|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_21|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t263~0.offset, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t265~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t264~0.offset, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t265~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t263~0.base, #NULL.base, ULTIMATE.start_main_~#t264~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 20:01:22,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= v_~a$w_buff0_used~0_92 1) (= 0 (mod v_~a$w_buff1_used~0_57 256)) (= v_~a$w_buff0_used~0_93 v_~a$w_buff1_used~0_57) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_16 v_~a$w_buff1~0_18) (= 1 v_~a$w_buff0~0_15) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_18, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_15, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_92, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:01:22,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L837-1-->L839: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t264~0.base_12|) |v_ULTIMATE.start_main_~#t264~0.offset_10| 1)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t264~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t264~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t264~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t264~0.base_12| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t264~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t264~0.base=|v_ULTIMATE.start_main_~#t264~0.base_12|, ULTIMATE.start_main_~#t264~0.offset=|v_ULTIMATE.start_main_~#t264~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t264~0.base, ULTIMATE.start_main_~#t264~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:01:22,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t265~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t265~0.base_12|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t265~0.base_12| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t265~0.base_12|) |v_ULTIMATE.start_main_~#t265~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t265~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t265~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t265~0.offset=|v_ULTIMATE.start_main_~#t265~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t265~0.base=|v_ULTIMATE.start_main_~#t265~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t265~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t265~0.base] because there is no mapped edge [2019-12-27 20:01:22,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1871633855 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1871633855 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1871633855| ~a~0_In1871633855)) (and (not .cse1) (= ~a$w_buff1~0_In1871633855 |P1Thread1of1ForFork2_#t~ite9_Out1871633855|) (not .cse0)))) InVars {~a~0=~a~0_In1871633855, ~a$w_buff1~0=~a$w_buff1~0_In1871633855, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1871633855, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1871633855} OutVars{~a~0=~a~0_In1871633855, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1871633855|, ~a$w_buff1~0=~a$w_buff1~0_In1871633855, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1871633855, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1871633855} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 20:01:22,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 20:01:22,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1925624632 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1925624632 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1925624632| ~a$w_buff0_used~0_In-1925624632)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1925624632| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1925624632, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1925624632} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1925624632, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1925624632, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1925624632|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:01:22,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In2052412291 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2052412291 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out2052412291| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In2052412291 |P0Thread1of1ForFork1_#t~ite5_Out2052412291|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2052412291, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2052412291} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2052412291|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2052412291, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2052412291} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 20:01:22,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In353578402 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In353578402 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In353578402 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In353578402 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out353578402| ~a$w_buff1_used~0_In353578402) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out353578402|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In353578402, ~a$w_buff0_used~0=~a$w_buff0_used~0_In353578402, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In353578402, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353578402} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out353578402|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In353578402, ~a$w_buff0_used~0=~a$w_buff0_used~0_In353578402, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In353578402, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353578402} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 20:01:22,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1146500534 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1146500534 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1146500534 ~a$r_buff0_thd1~0_In1146500534)) (and (not .cse1) (not .cse0) (= ~a$r_buff0_thd1~0_Out1146500534 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1146500534, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1146500534} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1146500534|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1146500534, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1146500534} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:01:22,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In1107761113 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1107761113 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1107761113 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1107761113 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1107761113|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$r_buff1_thd1~0_In1107761113 |P0Thread1of1ForFork1_#t~ite8_Out1107761113|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1107761113, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1107761113, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1107761113, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1107761113} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1107761113|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1107761113, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1107761113, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1107761113, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1107761113} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 20:01:22,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L756-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:01:22,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-62390378 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-62390378 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-62390378 256)) .cse0) (and (= (mod ~a$w_buff1_used~0_In-62390378 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In-62390378 256) 0))) (= |P2Thread1of1ForFork0_#t~ite20_Out-62390378| ~a$w_buff0~0_In-62390378) .cse1 (= |P2Thread1of1ForFork0_#t~ite21_Out-62390378| |P2Thread1of1ForFork0_#t~ite20_Out-62390378|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-62390378| |P2Thread1of1ForFork0_#t~ite20_Out-62390378|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite21_Out-62390378| ~a$w_buff0~0_In-62390378)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-62390378, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-62390378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-62390378, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-62390378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-62390378, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-62390378|, ~weak$$choice2~0=~weak$$choice2~0_In-62390378} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-62390378|, ~a$w_buff0~0=~a$w_buff0~0_In-62390378, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-62390378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-62390378, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-62390378, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-62390378|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-62390378, ~weak$$choice2~0=~weak$$choice2~0_In-62390378} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 20:01:22,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1408643207 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1408643207 |P2Thread1of1ForFork0_#t~ite27_Out-1408643207|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-1408643207| |P2Thread1of1ForFork0_#t~ite26_Out-1408643207|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1408643207| |P2Thread1of1ForFork0_#t~ite26_Out-1408643207|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1408643207 256)))) (or (= (mod ~a$w_buff0_used~0_In-1408643207 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1408643207 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1408643207 256))))) (= ~a$w_buff0_used~0_In-1408643207 |P2Thread1of1ForFork0_#t~ite26_Out-1408643207|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1408643207|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1408643207, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1408643207, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1408643207, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1408643207, ~weak$$choice2~0=~weak$$choice2~0_In-1408643207} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1408643207|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1408643207|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1408643207, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1408643207, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1408643207, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1408643207, ~weak$$choice2~0=~weak$$choice2~0_In-1408643207} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 20:01:22,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_47 v_~a$r_buff0_thd3~0_46)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_46, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:01:22,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (= v_~a~0_17 v_~a$mem_tmp~0_4) (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_17, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 20:01:22,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In2136151283 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In2136151283 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out2136151283| |P2Thread1of1ForFork0_#t~ite38_Out2136151283|))) (or (and (= ~a$w_buff1~0_In2136151283 |P2Thread1of1ForFork0_#t~ite38_Out2136151283|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~a~0_In2136151283 |P2Thread1of1ForFork0_#t~ite38_Out2136151283|) .cse1))) InVars {~a~0=~a~0_In2136151283, ~a$w_buff1~0=~a$w_buff1~0_In2136151283, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2136151283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2136151283} OutVars{~a~0=~a~0_In2136151283, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2136151283|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2136151283|, ~a$w_buff1~0=~a$w_buff1~0_In2136151283, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2136151283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2136151283} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 20:01:22,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-567527046 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-567527046 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-567527046|)) (and (= ~a$w_buff0_used~0_In-567527046 |P2Thread1of1ForFork0_#t~ite40_Out-567527046|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-567527046, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-567527046} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-567527046|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-567527046, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-567527046} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 20:01:22,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-438449527 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-438449527 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-438449527 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-438449527 256) 0))) (or (and (= ~a$w_buff1_used~0_In-438449527 |P2Thread1of1ForFork0_#t~ite41_Out-438449527|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-438449527|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-438449527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-438449527, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-438449527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-438449527} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-438449527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-438449527, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-438449527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-438449527, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-438449527|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 20:01:22,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1603892514 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1603892514 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1603892514 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1603892514 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1603892514| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out1603892514| ~a$w_buff1_used~0_In1603892514) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1603892514, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1603892514, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1603892514, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1603892514} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1603892514, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1603892514, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1603892514, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1603892514|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1603892514} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 20:01:22,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1854988753 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1854988753 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1854988753|)) (and (= ~a$r_buff0_thd2~0_In1854988753 |P1Thread1of1ForFork2_#t~ite13_Out1854988753|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1854988753, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1854988753} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1854988753, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1854988753, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1854988753|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 20:01:22,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1742375408 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1742375408 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1742375408 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1742375408 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1742375408|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd2~0_In1742375408 |P1Thread1of1ForFork2_#t~ite14_Out1742375408|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1742375408, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1742375408, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742375408, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742375408} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1742375408, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1742375408, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742375408, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742375408, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1742375408|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 20:01:22,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 20:01:22,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1696780390 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1696780390 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1696780390| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1696780390| ~a$r_buff0_thd3~0_In1696780390) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1696780390, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1696780390} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1696780390, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1696780390, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1696780390|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:01:22,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In2028047290 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In2028047290 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In2028047290 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2028047290 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out2028047290| 0)) (and (= ~a$r_buff1_thd3~0_In2028047290 |P2Thread1of1ForFork0_#t~ite43_Out2028047290|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2028047290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2028047290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2028047290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2028047290} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2028047290|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2028047290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2028047290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2028047290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2028047290} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 20:01:22,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_45 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:01:22,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: 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 20:01:22,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-1979513413 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1979513413 256) 0))) (or (and (= ~a$w_buff1~0_In-1979513413 |ULTIMATE.start_main_#t~ite47_Out-1979513413|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a~0_In-1979513413 |ULTIMATE.start_main_#t~ite47_Out-1979513413|)))) InVars {~a~0=~a~0_In-1979513413, ~a$w_buff1~0=~a$w_buff1~0_In-1979513413, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1979513413, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1979513413} OutVars{~a~0=~a~0_In-1979513413, ~a$w_buff1~0=~a$w_buff1~0_In-1979513413, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1979513413|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1979513413, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1979513413} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:01:22,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_19 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 20:01:22,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1784195273 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1784195273 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1784195273| ~a$w_buff0_used~0_In-1784195273)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1784195273| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1784195273, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1784195273} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1784195273, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1784195273|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1784195273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 20:01:22,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In-1262667192 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1262667192 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1262667192 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1262667192 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-1262667192 |ULTIMATE.start_main_#t~ite50_Out-1262667192|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1262667192|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1262667192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262667192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1262667192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262667192} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1262667192|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1262667192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1262667192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1262667192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1262667192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 20:01:22,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-648597283 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-648597283 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-648597283| 0)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-648597283 |ULTIMATE.start_main_#t~ite51_Out-648597283|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-648597283, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-648597283} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-648597283|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-648597283, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-648597283} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 20:01:22,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In255484829 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In255484829 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In255484829 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In255484829 256) 0))) (or (and (= ~a$r_buff1_thd0~0_In255484829 |ULTIMATE.start_main_#t~ite52_Out255484829|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out255484829|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In255484829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In255484829, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In255484829, ~a$w_buff1_used~0=~a$w_buff1_used~0_In255484829} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out255484829|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In255484829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In255484829, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In255484829, ~a$w_buff1_used~0=~a$w_buff1_used~0_In255484829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 20:01:22,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_14) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_7 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__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_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__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_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:01:22,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:01:22 BasicIcfg [2019-12-27 20:01:22,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:01:22,527 INFO L168 Benchmark]: Toolchain (without parser) took 167804.14 ms. Allocated memory was 146.3 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 101.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 20:01:22,527 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:01:22,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.38 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 157.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:22,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.53 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:22,529 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:22,529 INFO L168 Benchmark]: RCFGBuilder took 869.49 ms. Allocated memory is still 204.5 MB. Free memory was 152.0 MB in the beginning and 101.5 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:01:22,529 INFO L168 Benchmark]: TraceAbstraction took 166051.43 ms. Allocated memory was 204.5 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 101.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 20:01:22,532 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.38 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.2 MB in the beginning and 157.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.53 ms. Allocated memory is still 204.5 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.49 ms. Allocated memory is still 204.5 MB. Free memory was 152.0 MB in the beginning and 101.5 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 166051.43 ms. Allocated memory was 204.5 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 101.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 179 ProgramPointsBefore, 97 ProgramPointsAfterwards, 216 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 30 ChoiceCompositions, 6465 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 95714 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t263, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t264, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t265, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 165.6s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 64.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9299 SDtfs, 18308 SDslu, 39065 SDs, 0 SdLazy, 31437 SolverSat, 1116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 911 GetRequests, 220 SyntacticMatches, 117 SemanticMatches, 574 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5488 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184385occurred 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: 55.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 714696 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1706 NumberOfCodeBlocks, 1706 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 363165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...