/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/mix000_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:35:48,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:35:48,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:35:48,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:35:48,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:35:48,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:35:48,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:35:48,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:35:48,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:35:48,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:35:48,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:35:48,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:35:48,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:35:48,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:35:48,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:35:48,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:35:48,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:35:48,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:35:48,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:35:48,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:35:48,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:35:48,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:35:48,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:35:48,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:35:48,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:35:48,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:35:48,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:35:48,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:35:48,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:35:48,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:35:48,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:35:48,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:35:48,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:35:48,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:35:48,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:35:48,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:35:48,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:35:48,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:35:48,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:35:48,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:35:48,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:35:48,475 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:35:48,489 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:35:48,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:35:48,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:35:48,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:35:48,491 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:35:48,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:35:48,491 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:35:48,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:35:48,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:35:48,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:35:48,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:35:48,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:35:48,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:35:48,493 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:35:48,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:35:48,493 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:35:48,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:35:48,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:35:48,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:35:48,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:35:48,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:35:48,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:35:48,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:35:48,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:35:48,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:35:48,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:35:48,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:35:48,495 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:35:48,496 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:35:48,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:35:48,496 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:35:48,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:35:48,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:35:48,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:35:48,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:35:48,800 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:35:48,803 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:35:48,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_tso.oepc.i [2019-12-27 19:35:48,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86286af9a/6d72ec7b836e474db01d69e443ae5bd6/FLAG1b8ecf645 [2019-12-27 19:35:49,504 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:35:49,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_tso.oepc.i [2019-12-27 19:35:49,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86286af9a/6d72ec7b836e474db01d69e443ae5bd6/FLAG1b8ecf645 [2019-12-27 19:35:49,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86286af9a/6d72ec7b836e474db01d69e443ae5bd6 [2019-12-27 19:35:49,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:35:49,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:35:49,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:35:49,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:35:49,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:35:49,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:49" (1/1) ... [2019-12-27 19:35:49,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7ccef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:49, skipping insertion in model container [2019-12-27 19:35:49,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:49" (1/1) ... [2019-12-27 19:35:49,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:35:49,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:35:50,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:35:50,415 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:35:50,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:35:50,585 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:35:50,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50 WrapperNode [2019-12-27 19:35:50,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:35:50,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:35:50,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:35:50,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:35:50,596 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:35:50" (1/1) ... [2019-12-27 19:35:50,621 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:35:50" (1/1) ... [2019-12-27 19:35:50,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:35:50,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:35:50,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:35:50,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:35:50,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (1/1) ... [2019-12-27 19:35:50,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (1/1) ... [2019-12-27 19:35:50,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (1/1) ... [2019-12-27 19:35:50,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (1/1) ... [2019-12-27 19:35:50,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (1/1) ... [2019-12-27 19:35:50,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (1/1) ... [2019-12-27 19:35:50,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (1/1) ... [2019-12-27 19:35:50,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:35:50,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:35:50,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:35:50,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:35:50,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (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:35:50,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:35:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:35:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:35:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:35:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:35:50,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:35:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:35:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:35:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:35:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:35:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:35:50,766 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:35:51,683 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:35:51,684 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:35:51,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:51 BoogieIcfgContainer [2019-12-27 19:35:51,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:35:51,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:35:51,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:35:51,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:35:51,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:35:49" (1/3) ... [2019-12-27 19:35:51,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f16864c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:51, skipping insertion in model container [2019-12-27 19:35:51,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:50" (2/3) ... [2019-12-27 19:35:51,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f16864c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:51, skipping insertion in model container [2019-12-27 19:35:51,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:51" (3/3) ... [2019-12-27 19:35:51,694 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_tso.oepc.i [2019-12-27 19:35:51,704 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:35:51,705 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:35:51,713 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:35:51,714 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:35:51,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,842 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,847 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,847 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:51,868 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 19:35:51,886 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:35:51,887 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:35:51,887 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:35:51,887 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:35:51,887 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:35:51,887 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:35:51,887 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:35:51,887 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:35:51,904 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 19:35:51,906 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 19:35:52,026 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 19:35:52,027 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:35:52,045 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 19:35:52,079 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 19:35:52,143 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 19:35:52,143 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:35:52,156 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 19:35:52,189 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 19:35:52,190 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:35:54,771 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-12-27 19:35:55,389 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 19:35:55,513 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 19:35:55,567 INFO L206 etLargeBlockEncoding]: Checked pairs total: 156567 [2019-12-27 19:35:55,568 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 19:35:55,572 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 141 transitions [2019-12-27 19:35:57,658 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 31650 states. [2019-12-27 19:35:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 31650 states. [2019-12-27 19:35:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:35:57,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:57,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:35:57,666 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1078912, now seen corresponding path program 1 times [2019-12-27 19:35:57,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:57,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744313023] [2019-12-27 19:35:57,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:57,882 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:35:57,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744313023] [2019-12-27 19:35:57,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:57,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:35:57,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762707021] [2019-12-27 19:35:57,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:57,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:57,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:35:57,904 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:57,908 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:57,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:57,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:57,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:57,927 INFO L87 Difference]: Start difference. First operand 31650 states. Second operand 3 states. [2019-12-27 19:35:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:58,486 INFO L93 Difference]: Finished difference Result 31498 states and 111612 transitions. [2019-12-27 19:35:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:58,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:35:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:58,745 INFO L225 Difference]: With dead ends: 31498 [2019-12-27 19:35:58,745 INFO L226 Difference]: Without dead ends: 29342 [2019-12-27 19:35:58,747 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:36:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29342 states. [2019-12-27 19:36:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29342 to 29342. [2019-12-27 19:36:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29342 states. [2019-12-27 19:36:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29342 states to 29342 states and 103886 transitions. [2019-12-27 19:36:01,420 INFO L78 Accepts]: Start accepts. Automaton has 29342 states and 103886 transitions. Word has length 3 [2019-12-27 19:36:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:01,420 INFO L462 AbstractCegarLoop]: Abstraction has 29342 states and 103886 transitions. [2019-12-27 19:36:01,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:36:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 29342 states and 103886 transitions. [2019-12-27 19:36:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:36:01,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:01,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:36:01,425 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash 559991540, now seen corresponding path program 1 times [2019-12-27 19:36:01,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:01,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199373907] [2019-12-27 19:36:01,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:01,489 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:36:01,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199373907] [2019-12-27 19:36:01,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:01,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:36:01,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701607011] [2019-12-27 19:36:01,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:01,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:01,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:36:01,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:01,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:01,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:36:01,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:01,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:36:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:36:01,499 INFO L87 Difference]: Start difference. First operand 29342 states and 103886 transitions. Second operand 3 states. [2019-12-27 19:36:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:01,601 INFO L93 Difference]: Finished difference Result 3451 states and 8567 transitions. [2019-12-27 19:36:01,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:36:01,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:36:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:01,612 INFO L225 Difference]: With dead ends: 3451 [2019-12-27 19:36:01,612 INFO L226 Difference]: Without dead ends: 3451 [2019-12-27 19:36:01,615 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:36:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2019-12-27 19:36:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2019-12-27 19:36:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-12-27 19:36:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 8567 transitions. [2019-12-27 19:36:01,736 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 8567 transitions. Word has length 11 [2019-12-27 19:36:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:01,737 INFO L462 AbstractCegarLoop]: Abstraction has 3451 states and 8567 transitions. [2019-12-27 19:36:01,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:36:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 8567 transitions. [2019-12-27 19:36:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:36:01,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:01,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:36:01,746 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1482577634, now seen corresponding path program 1 times [2019-12-27 19:36:01,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:01,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027608420] [2019-12-27 19:36:01,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:02,464 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:36:02,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027608420] [2019-12-27 19:36:02,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:02,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:36:02,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153589807] [2019-12-27 19:36:02,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:02,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:02,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:36:02,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:02,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:02,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:36:02,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:36:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:36:02,473 INFO L87 Difference]: Start difference. First operand 3451 states and 8567 transitions. Second operand 4 states. [2019-12-27 19:36:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:02,766 INFO L93 Difference]: Finished difference Result 4533 states and 11006 transitions. [2019-12-27 19:36:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:36:02,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 19:36:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:02,777 INFO L225 Difference]: With dead ends: 4533 [2019-12-27 19:36:02,777 INFO L226 Difference]: Without dead ends: 4533 [2019-12-27 19:36:02,778 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:36:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-12-27 19:36:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4465. [2019-12-27 19:36:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-12-27 19:36:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 10874 transitions. [2019-12-27 19:36:02,897 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 10874 transitions. Word has length 14 [2019-12-27 19:36:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:02,897 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 10874 transitions. [2019-12-27 19:36:02,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:36:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 10874 transitions. [2019-12-27 19:36:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:36:02,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:02,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:36:02,899 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1284762389, now seen corresponding path program 1 times [2019-12-27 19:36:02,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:02,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872659633] [2019-12-27 19:36:02,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:02,945 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:36:02,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872659633] [2019-12-27 19:36:02,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:02,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:02,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686248660] [2019-12-27 19:36:02,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:02,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:02,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:36:02,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:02,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:02,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:36:02,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:36:02,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:36:02,956 INFO L87 Difference]: Start difference. First operand 4465 states and 10874 transitions. Second operand 3 states. [2019-12-27 19:36:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:03,051 INFO L93 Difference]: Finished difference Result 7903 states and 18336 transitions. [2019-12-27 19:36:03,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:36:03,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 19:36:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:03,082 INFO L225 Difference]: With dead ends: 7903 [2019-12-27 19:36:03,083 INFO L226 Difference]: Without dead ends: 7903 [2019-12-27 19:36:03,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:36:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2019-12-27 19:36:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 6842. [2019-12-27 19:36:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2019-12-27 19:36:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 16113 transitions. [2019-12-27 19:36:03,250 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 16113 transitions. Word has length 15 [2019-12-27 19:36:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:03,250 INFO L462 AbstractCegarLoop]: Abstraction has 6842 states and 16113 transitions. [2019-12-27 19:36:03,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:36:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 16113 transitions. [2019-12-27 19:36:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:36:03,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:03,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:36:03,252 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1823214846, now seen corresponding path program 1 times [2019-12-27 19:36:03,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:03,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969146183] [2019-12-27 19:36:03,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:03,314 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:36:03,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969146183] [2019-12-27 19:36:03,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:03,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:36:03,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [635708894] [2019-12-27 19:36:03,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:03,318 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:03,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:36:03,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:03,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:03,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:36:03,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:36:03,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:36:03,323 INFO L87 Difference]: Start difference. First operand 6842 states and 16113 transitions. Second operand 4 states. [2019-12-27 19:36:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:03,612 INFO L93 Difference]: Finished difference Result 8322 states and 19313 transitions. [2019-12-27 19:36:03,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:36:03,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 19:36:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:03,640 INFO L225 Difference]: With dead ends: 8322 [2019-12-27 19:36:03,640 INFO L226 Difference]: Without dead ends: 8322 [2019-12-27 19:36:03,640 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:36:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-27 19:36:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 6895. [2019-12-27 19:36:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6895 states. [2019-12-27 19:36:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 16226 transitions. [2019-12-27 19:36:03,789 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 16226 transitions. Word has length 17 [2019-12-27 19:36:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:03,790 INFO L462 AbstractCegarLoop]: Abstraction has 6895 states and 16226 transitions. [2019-12-27 19:36:03,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:36:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 16226 transitions. [2019-12-27 19:36:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:36:03,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:03,825 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:36:03,825 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:03,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1246091973, now seen corresponding path program 1 times [2019-12-27 19:36:03,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:03,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768598321] [2019-12-27 19:36:03,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:03,926 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:36:03,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768598321] [2019-12-27 19:36:03,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:03,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:03,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438967865] [2019-12-27 19:36:03,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:03,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:03,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:36:03,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:03,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:03,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:36:03,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:03,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:36:03,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:36:03,939 INFO L87 Difference]: Start difference. First operand 6895 states and 16226 transitions. Second operand 5 states. [2019-12-27 19:36:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:04,392 INFO L93 Difference]: Finished difference Result 9279 states and 21293 transitions. [2019-12-27 19:36:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:36:04,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 19:36:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:04,410 INFO L225 Difference]: With dead ends: 9279 [2019-12-27 19:36:04,410 INFO L226 Difference]: Without dead ends: 9279 [2019-12-27 19:36:04,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:36:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2019-12-27 19:36:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 8842. [2019-12-27 19:36:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8842 states. [2019-12-27 19:36:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8842 states to 8842 states and 20427 transitions. [2019-12-27 19:36:04,597 INFO L78 Accepts]: Start accepts. Automaton has 8842 states and 20427 transitions. Word has length 27 [2019-12-27 19:36:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:04,598 INFO L462 AbstractCegarLoop]: Abstraction has 8842 states and 20427 transitions. [2019-12-27 19:36:04,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:36:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 20427 transitions. [2019-12-27 19:36:04,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 19:36:04,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:04,606 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] [2019-12-27 19:36:04,607 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:04,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:04,607 INFO L82 PathProgramCache]: Analyzing trace with hash -326843675, now seen corresponding path program 1 times [2019-12-27 19:36:04,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:04,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992564691] [2019-12-27 19:36:04,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:36:04,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992564691] [2019-12-27 19:36:04,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:04,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:04,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053882466] [2019-12-27 19:36:04,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:04,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:04,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 30 transitions. [2019-12-27 19:36:04,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:04,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:04,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:36:04,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:36:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:36:04,663 INFO L87 Difference]: Start difference. First operand 8842 states and 20427 transitions. Second operand 3 states. [2019-12-27 19:36:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:04,762 INFO L93 Difference]: Finished difference Result 9983 states and 21907 transitions. [2019-12-27 19:36:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:36:04,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 19:36:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:04,778 INFO L225 Difference]: With dead ends: 9983 [2019-12-27 19:36:04,778 INFO L226 Difference]: Without dead ends: 9983 [2019-12-27 19:36:04,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:36:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-12-27 19:36:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 8811. [2019-12-27 19:36:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-27 19:36:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 19466 transitions. [2019-12-27 19:36:04,937 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 19466 transitions. Word has length 30 [2019-12-27 19:36:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:04,937 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 19466 transitions. [2019-12-27 19:36:04,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:36:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 19466 transitions. [2019-12-27 19:36:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:36:04,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:04,947 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:36:04,947 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1451833890, now seen corresponding path program 1 times [2019-12-27 19:36:04,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:04,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431778002] [2019-12-27 19:36:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:05,036 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:36:05,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431778002] [2019-12-27 19:36:05,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:05,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:05,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222952421] [2019-12-27 19:36:05,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:05,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:05,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 19:36:05,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:05,099 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:05,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:36:05,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:05,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:36:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:36:05,101 INFO L87 Difference]: Start difference. First operand 8811 states and 19466 transitions. Second operand 5 states. [2019-12-27 19:36:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:05,568 INFO L93 Difference]: Finished difference Result 9934 states and 21689 transitions. [2019-12-27 19:36:05,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:36:05,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 19:36:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:05,582 INFO L225 Difference]: With dead ends: 9934 [2019-12-27 19:36:05,582 INFO L226 Difference]: Without dead ends: 9934 [2019-12-27 19:36:05,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:36:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9934 states. [2019-12-27 19:36:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9934 to 7897. [2019-12-27 19:36:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 19:36:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 17615 transitions. [2019-12-27 19:36:05,724 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 17615 transitions. Word has length 33 [2019-12-27 19:36:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:05,727 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 17615 transitions. [2019-12-27 19:36:05,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:36:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 17615 transitions. [2019-12-27 19:36:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:36:05,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:05,742 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:36:05,742 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1521082095, now seen corresponding path program 1 times [2019-12-27 19:36:05,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:05,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747491042] [2019-12-27 19:36:05,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:05,817 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:36:05,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747491042] [2019-12-27 19:36:05,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:05,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:05,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632089622] [2019-12-27 19:36:05,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:05,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:05,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-27 19:36:05,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:05,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:05,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:36:05,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:36:05,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:36:05,840 INFO L87 Difference]: Start difference. First operand 7897 states and 17615 transitions. Second operand 4 states. [2019-12-27 19:36:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:05,876 INFO L93 Difference]: Finished difference Result 5532 states and 12270 transitions. [2019-12-27 19:36:05,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:36:05,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 19:36:05,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:05,886 INFO L225 Difference]: With dead ends: 5532 [2019-12-27 19:36:05,886 INFO L226 Difference]: Without dead ends: 5532 [2019-12-27 19:36:05,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:36:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-12-27 19:36:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5428. [2019-12-27 19:36:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2019-12-27 19:36:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 12077 transitions. [2019-12-27 19:36:06,004 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 12077 transitions. Word has length 39 [2019-12-27 19:36:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:06,004 INFO L462 AbstractCegarLoop]: Abstraction has 5428 states and 12077 transitions. [2019-12-27 19:36:06,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:36:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 12077 transitions. [2019-12-27 19:36:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:36:06,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:06,020 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, 1] [2019-12-27 19:36:06,020 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash -180233684, now seen corresponding path program 1 times [2019-12-27 19:36:06,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:06,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902192941] [2019-12-27 19:36:06,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:06,137 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:36:06,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902192941] [2019-12-27 19:36:06,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:06,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:36:06,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1368107752] [2019-12-27 19:36:06,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:06,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:06,400 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 19:36:06,400 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:06,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:36:06,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:36:06,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:36:06,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:36:06,522 INFO L87 Difference]: Start difference. First operand 5428 states and 12077 transitions. Second operand 11 states. [2019-12-27 19:36:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:07,229 INFO L93 Difference]: Finished difference Result 10275 states and 22585 transitions. [2019-12-27 19:36:07,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:36:07,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-12-27 19:36:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:07,243 INFO L225 Difference]: With dead ends: 10275 [2019-12-27 19:36:07,243 INFO L226 Difference]: Without dead ends: 9146 [2019-12-27 19:36:07,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:36:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9146 states. [2019-12-27 19:36:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9146 to 6812. [2019-12-27 19:36:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2019-12-27 19:36:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 15382 transitions. [2019-12-27 19:36:07,377 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 15382 transitions. Word has length 68 [2019-12-27 19:36:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:07,378 INFO L462 AbstractCegarLoop]: Abstraction has 6812 states and 15382 transitions. [2019-12-27 19:36:07,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:36:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 15382 transitions. [2019-12-27 19:36:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:36:07,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:07,394 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, 1] [2019-12-27 19:36:07,394 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1054499084, now seen corresponding path program 2 times [2019-12-27 19:36:07,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:07,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798651076] [2019-12-27 19:36:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:07,545 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:36:07,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798651076] [2019-12-27 19:36:07,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:07,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:07,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217352059] [2019-12-27 19:36:07,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:07,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:07,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 299 transitions. [2019-12-27 19:36:07,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:07,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:36:07,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:36:07,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:36:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:36:07,884 INFO L87 Difference]: Start difference. First operand 6812 states and 15382 transitions. Second operand 6 states. [2019-12-27 19:36:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:08,018 INFO L93 Difference]: Finished difference Result 9900 states and 22320 transitions. [2019-12-27 19:36:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:36:08,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 19:36:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:08,029 INFO L225 Difference]: With dead ends: 9900 [2019-12-27 19:36:08,029 INFO L226 Difference]: Without dead ends: 8364 [2019-12-27 19:36:08,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:36:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-12-27 19:36:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8264. [2019-12-27 19:36:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8264 states. [2019-12-27 19:36:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 18802 transitions. [2019-12-27 19:36:08,157 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 18802 transitions. Word has length 68 [2019-12-27 19:36:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:08,157 INFO L462 AbstractCegarLoop]: Abstraction has 8264 states and 18802 transitions. [2019-12-27 19:36:08,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:36:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 18802 transitions. [2019-12-27 19:36:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:36:08,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:08,175 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, 1] [2019-12-27 19:36:08,176 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:08,176 INFO L82 PathProgramCache]: Analyzing trace with hash 283351324, now seen corresponding path program 3 times [2019-12-27 19:36:08,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:08,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016727146] [2019-12-27 19:36:08,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:08,309 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:36:08,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016727146] [2019-12-27 19:36:08,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:08,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:36:08,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086787853] [2019-12-27 19:36:08,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:08,336 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:08,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 198 transitions. [2019-12-27 19:36:08,434 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:08,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:36:08,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:36:08,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:08,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:36:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:36:08,458 INFO L87 Difference]: Start difference. First operand 8264 states and 18802 transitions. Second operand 9 states. [2019-12-27 19:36:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:08,992 INFO L93 Difference]: Finished difference Result 12633 states and 28391 transitions. [2019-12-27 19:36:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:36:08,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-27 19:36:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:09,006 INFO L225 Difference]: With dead ends: 12633 [2019-12-27 19:36:09,006 INFO L226 Difference]: Without dead ends: 12150 [2019-12-27 19:36:09,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:36:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12150 states. [2019-12-27 19:36:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12150 to 8320. [2019-12-27 19:36:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-12-27 19:36:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 18925 transitions. [2019-12-27 19:36:09,170 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 18925 transitions. Word has length 68 [2019-12-27 19:36:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:09,171 INFO L462 AbstractCegarLoop]: Abstraction has 8320 states and 18925 transitions. [2019-12-27 19:36:09,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:36:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 18925 transitions. [2019-12-27 19:36:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:36:09,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:09,190 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, 1] [2019-12-27 19:36:09,191 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:09,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash 741146474, now seen corresponding path program 4 times [2019-12-27 19:36:09,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:09,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356783089] [2019-12-27 19:36:09,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:09,279 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:36:09,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356783089] [2019-12-27 19:36:09,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:09,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:36:09,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134731076] [2019-12-27 19:36:09,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:09,303 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:09,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 19:36:09,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:09,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:36:09,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:36:09,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:09,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:36:09,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:36:09,491 INFO L87 Difference]: Start difference. First operand 8320 states and 18925 transitions. Second operand 6 states. [2019-12-27 19:36:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:09,701 INFO L93 Difference]: Finished difference Result 14353 states and 32381 transitions. [2019-12-27 19:36:09,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:36:09,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 19:36:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:09,713 INFO L225 Difference]: With dead ends: 14353 [2019-12-27 19:36:09,713 INFO L226 Difference]: Without dead ends: 12179 [2019-12-27 19:36:09,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:36:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2019-12-27 19:36:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 9546. [2019-12-27 19:36:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9546 states. [2019-12-27 19:36:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9546 states to 9546 states and 21681 transitions. [2019-12-27 19:36:09,879 INFO L78 Accepts]: Start accepts. Automaton has 9546 states and 21681 transitions. Word has length 68 [2019-12-27 19:36:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:09,879 INFO L462 AbstractCegarLoop]: Abstraction has 9546 states and 21681 transitions. [2019-12-27 19:36:09,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:36:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 9546 states and 21681 transitions. [2019-12-27 19:36:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:36:09,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:09,897 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, 1] [2019-12-27 19:36:09,897 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash -439547742, now seen corresponding path program 5 times [2019-12-27 19:36:09,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:09,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970118015] [2019-12-27 19:36:09,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:09,970 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:36:09,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970118015] [2019-12-27 19:36:09,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:09,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:09,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1915644347] [2019-12-27 19:36:09,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:09,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:10,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 166 transitions. [2019-12-27 19:36:10,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:10,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:10,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:36:10,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:10,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:36:10,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:36:10,077 INFO L87 Difference]: Start difference. First operand 9546 states and 21681 transitions. Second operand 4 states. [2019-12-27 19:36:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:10,115 INFO L93 Difference]: Finished difference Result 10263 states and 23212 transitions. [2019-12-27 19:36:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:36:10,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 19:36:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:10,117 INFO L225 Difference]: With dead ends: 10263 [2019-12-27 19:36:10,117 INFO L226 Difference]: Without dead ends: 909 [2019-12-27 19:36:10,118 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:36:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-27 19:36:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-12-27 19:36:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 19:36:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1891 transitions. [2019-12-27 19:36:10,131 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1891 transitions. Word has length 68 [2019-12-27 19:36:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:10,131 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1891 transitions. [2019-12-27 19:36:10,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:36:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1891 transitions. [2019-12-27 19:36:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 19:36:10,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:10,133 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, 1, 1] [2019-12-27 19:36:10,133 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:10,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1610368982, now seen corresponding path program 1 times [2019-12-27 19:36:10,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:10,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363632143] [2019-12-27 19:36:10,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:10,221 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:36:10,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363632143] [2019-12-27 19:36:10,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:10,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:36:10,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [17891919] [2019-12-27 19:36:10,222 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:10,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:10,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 304 transitions. [2019-12-27 19:36:10,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:10,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:36:10,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:36:10,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:10,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:36:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:36:10,398 INFO L87 Difference]: Start difference. First operand 909 states and 1891 transitions. Second operand 4 states. [2019-12-27 19:36:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:10,465 INFO L93 Difference]: Finished difference Result 1030 states and 2133 transitions. [2019-12-27 19:36:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:36:10,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 19:36:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:10,470 INFO L225 Difference]: With dead ends: 1030 [2019-12-27 19:36:10,471 INFO L226 Difference]: Without dead ends: 1030 [2019-12-27 19:36:10,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 4 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:36:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-12-27 19:36:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 942. [2019-12-27 19:36:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 19:36:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1957 transitions. [2019-12-27 19:36:10,483 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1957 transitions. Word has length 69 [2019-12-27 19:36:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:10,483 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1957 transitions. [2019-12-27 19:36:10,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:36:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1957 transitions. [2019-12-27 19:36:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 19:36:10,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:10,486 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, 1, 1, 1] [2019-12-27 19:36:10,486 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1855866882, now seen corresponding path program 1 times [2019-12-27 19:36:10,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:10,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317983886] [2019-12-27 19:36:10,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:10,658 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:36:10,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317983886] [2019-12-27 19:36:10,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:10,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:36:10,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [712595692] [2019-12-27 19:36:10,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:10,682 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:10,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 302 transitions. [2019-12-27 19:36:10,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:11,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 19:36:11,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:36:11,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:11,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:36:11,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:36:11,005 INFO L87 Difference]: Start difference. First operand 942 states and 1957 transitions. Second operand 15 states. [2019-12-27 19:36:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:13,320 INFO L93 Difference]: Finished difference Result 2063 states and 4009 transitions. [2019-12-27 19:36:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 19:36:13,320 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2019-12-27 19:36:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:13,323 INFO L225 Difference]: With dead ends: 2063 [2019-12-27 19:36:13,323 INFO L226 Difference]: Without dead ends: 2039 [2019-12-27 19:36:13,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:36:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-12-27 19:36:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1313. [2019-12-27 19:36:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-12-27 19:36:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 2622 transitions. [2019-12-27 19:36:13,338 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 2622 transitions. Word has length 70 [2019-12-27 19:36:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:13,338 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 2622 transitions. [2019-12-27 19:36:13,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:36:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 2622 transitions. [2019-12-27 19:36:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 19:36:13,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:13,340 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, 1, 1, 1] [2019-12-27 19:36:13,340 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:13,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1395207600, now seen corresponding path program 2 times [2019-12-27 19:36:13,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:13,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748732115] [2019-12-27 19:36:13,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:36:13,409 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:36:13,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748732115] [2019-12-27 19:36:13,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:36:13,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:36:13,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1248159003] [2019-12-27 19:36:13,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:36:13,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:36:13,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 232 transitions. [2019-12-27 19:36:13,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:36:13,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:36:13,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:36:13,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:36:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:36:13,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:36:13,570 INFO L87 Difference]: Start difference. First operand 1313 states and 2622 transitions. Second operand 3 states. [2019-12-27 19:36:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:36:13,583 INFO L93 Difference]: Finished difference Result 1313 states and 2621 transitions. [2019-12-27 19:36:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:36:13,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 19:36:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:36:13,586 INFO L225 Difference]: With dead ends: 1313 [2019-12-27 19:36:13,586 INFO L226 Difference]: Without dead ends: 1313 [2019-12-27 19:36:13,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:36:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-12-27 19:36:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1135. [2019-12-27 19:36:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-12-27 19:36:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2293 transitions. [2019-12-27 19:36:13,601 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2293 transitions. Word has length 70 [2019-12-27 19:36:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:36:13,601 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 2293 transitions. [2019-12-27 19:36:13,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:36:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2293 transitions. [2019-12-27 19:36:13,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 19:36:13,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:36:13,604 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, 1, 1, 1, 1] [2019-12-27 19:36:13,604 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:36:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:36:13,604 INFO L82 PathProgramCache]: Analyzing trace with hash 309404191, now seen corresponding path program 1 times [2019-12-27 19:36:13,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:36:13,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944555207] [2019-12-27 19:36:13,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:36:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:36:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:36:13,789 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:36:13,790 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:36:13,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_23) (= 0 |v_ULTIMATE.start_main_~#t10~0.offset_18|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t10~0.base_23|) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_79 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~__unbuffered_cnt~0_17) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~weak$$choice2~0_36) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t10~0.base_23| 1)) (= v_~y$r_buff0_thd2~0_63 0) (= v_~y$r_buff0_thd0~0_19 0) (= v_~y$w_buff0_used~0_136 0) (= 0 v_~y$flush_delayed~0_18) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t10~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t10~0.base_23|) |v_ULTIMATE.start_main_~#t10~0.offset_18| 0)) |v_#memory_int_17|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t10~0.base_23| 4)) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~y~0_32 0) (= v_~y$mem_tmp~0_14 0) (= v_~main$tmp_guard1~0_14 0) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~y$w_buff1~0_32) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t10~0.base_23|)) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$r_buff1_thd2~0_38) (= 0 v_~y$w_buff0~0_34) (= 0 v_~x~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_11|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_11|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_79, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, ULTIMATE.start_main_~#t11~0.base=|v_ULTIMATE.start_main_~#t11~0.base_19|, #length=|v_#length_17|, ~y~0=v_~y~0_32, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t11~0.offset=|v_ULTIMATE.start_main_~#t11~0.offset_16|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_38, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t10~0.base=|v_ULTIMATE.start_main_~#t10~0.base_23|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_46|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_~#t10~0.offset=|v_ULTIMATE.start_main_~#t10~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_23, ~x~0=v_~x~0_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t11~0.base, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t11~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t10~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t10~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 19:36:13,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L5-->L744: Formula: (and (= ~weak$$choice2~0_Out-1847375914 ~y$flush_delayed~0_Out-1847375914) (= ~y$r_buff0_thd0~0_In-1847375914 ~y$r_buff1_thd0~0_Out-1847375914) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1847375914 0)) (= ~y$r_buff0_thd1~0_Out-1847375914 1) (= ~y~0_In-1847375914 ~y$mem_tmp~0_Out-1847375914) (= ~y$r_buff1_thd2~0_Out-1847375914 ~y$r_buff0_thd2~0_In-1847375914) (= |P0Thread1of1ForFork1_#t~nondet3_In-1847375914| ~weak$$choice0~0_Out-1847375914) (= ~y$r_buff0_thd1~0_In-1847375914 ~y$r_buff1_thd1~0_Out-1847375914) (= ~weak$$choice2~0_Out-1847375914 |P0Thread1of1ForFork1_#t~nondet4_In-1847375914|)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1847375914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1847375914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1847375914, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1847375914, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1847375914|, ~y~0=~y~0_In-1847375914, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1847375914|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1847375914, ~weak$$choice0~0=~weak$$choice0~0_Out-1847375914, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1847375914, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1847375914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1847375914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1847375914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1847375914, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1847375914, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1847375914, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1847375914|, ~y~0=~y~0_In-1847375914, ~weak$$choice2~0=~weak$$choice2~0_Out-1847375914, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1847375914|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1847375914} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 19:36:13,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t11~0.offset_10| 0) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t11~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t11~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t11~0.base_11| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t11~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t11~0.base_11|) |v_ULTIMATE.start_main_~#t11~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t11~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t11~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t11~0.base=|v_ULTIMATE.start_main_~#t11~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t11~0.offset=|v_ULTIMATE.start_main_~#t11~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t11~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t11~0.offset] because there is no mapped edge [2019-12-27 19:36:13,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-891664315 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-891664315 256))) (.cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-891664315| |P0Thread1of1ForFork1_#t~ite6_Out-891664315|))) (or (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork1_#t~ite5_Out-891664315| ~y$w_buff1~0_In-891664315)) (and (not .cse1) (not .cse2) (= |P0Thread1of1ForFork1_#t~ite5_Out-891664315| ~y$w_buff0~0_In-891664315) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-891664315, ~y$w_buff1~0=~y$w_buff1~0_In-891664315, ~y$w_buff0~0=~y$w_buff0~0_In-891664315, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-891664315} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-891664315|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-891664315, ~y$w_buff1~0=~y$w_buff1~0_In-891664315, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-891664315|, ~y$w_buff0~0=~y$w_buff0~0_In-891664315, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-891664315} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 19:36:13,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_48)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:36:13,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1844425620 256)))) (or (and (= ~y~0_In1844425620 |P0Thread1of1ForFork1_#t~ite25_Out1844425620|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In1844425620 |P0Thread1of1ForFork1_#t~ite25_Out1844425620|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1844425620, ~y$flush_delayed~0=~y$flush_delayed~0_In1844425620, ~y~0=~y~0_In1844425620} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1844425620, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out1844425620|, ~y$flush_delayed~0=~y$flush_delayed~0_In1844425620, ~y~0=~y~0_In1844425620} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 19:36:13,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1203625276 256)))) (or (and .cse0 (= |P1Thread1of1ForFork0_#t~ite54_Out1203625276| ~y~0_In1203625276)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out1203625276| ~y$mem_tmp~0_In1203625276)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1203625276, ~y$flush_delayed~0=~y$flush_delayed~0_In1203625276, ~y~0=~y~0_In1203625276} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1203625276, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out1203625276|, ~y$flush_delayed~0=~y$flush_delayed~0_In1203625276, ~y~0=~y~0_In1203625276} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 19:36:13,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-223471208 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-223471208 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-223471208|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-223471208 |P0Thread1of1ForFork1_#t~ite28_Out-223471208|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-223471208, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-223471208} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-223471208, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-223471208|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-223471208} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 19:36:13,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1426675552 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1426675552 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1426675552 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1426675552 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-1426675552|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite29_Out-1426675552| ~y$w_buff1_used~0_In-1426675552) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1426675552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1426675552, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1426675552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426675552} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1426675552, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1426675552, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-1426675552|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1426675552, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1426675552} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 19:36:13,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-789545234 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-789545234 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-789545234 ~y$r_buff0_thd1~0_In-789545234)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out-789545234 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-789545234, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-789545234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-789545234, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-789545234, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-789545234|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 19:36:13,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1575879504 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1575879504 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1575879504 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1575879504 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite31_Out1575879504| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite31_Out1575879504| ~y$r_buff1_thd1~0_In1575879504) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1575879504, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1575879504, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1575879504, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1575879504} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1575879504, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1575879504, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1575879504, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1575879504|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1575879504} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 19:36:13,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1495485663 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1495485663 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite55_Out-1495485663| ~y$w_buff1~0_In-1495485663) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite55_Out-1495485663| ~y~0_In-1495485663) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1495485663, ~y$w_buff1~0=~y$w_buff1~0_In-1495485663, ~y~0=~y~0_In-1495485663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1495485663} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1495485663, ~y$w_buff1~0=~y$w_buff1~0_In-1495485663, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-1495485663|, ~y~0=~y~0_In-1495485663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1495485663} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 19:36:13,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_27 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_7|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-27 19:36:13,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In280846656 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In280846656 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out280846656| ~y$w_buff0_used~0_In280846656)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out280846656| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In280846656, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In280846656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In280846656, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In280846656, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out280846656|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 19:36:13,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1200196915 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1200196915 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1200196915 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1200196915 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out-1200196915|)) (and (= ~y$w_buff1_used~0_In-1200196915 |P1Thread1of1ForFork0_#t~ite58_Out-1200196915|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1200196915, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200196915, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1200196915, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1200196915} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1200196915, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200196915, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1200196915, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-1200196915|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1200196915} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 19:36:13,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In353398253 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In353398253 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite59_Out353398253| ~y$r_buff0_thd2~0_In353398253) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite59_Out353398253| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In353398253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In353398253} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In353398253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In353398253, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out353398253|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 19:36:13,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd1~0_36 |v_P0Thread1of1ForFork1_#t~ite31_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_8|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 19:36:13,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1513347090 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1513347090 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1513347090 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1513347090 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1513347090| 0)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out-1513347090| ~y$r_buff1_thd2~0_In-1513347090) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1513347090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1513347090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1513347090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1513347090} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1513347090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1513347090, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1513347090|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1513347090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1513347090} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 19:36:13,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y$r_buff1_thd2~0_34 |v_P1Thread1of1ForFork0_#t~ite60_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 19:36:13,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 19:36:13,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite64_Out548369725| |ULTIMATE.start_main_#t~ite63_Out548369725|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In548369725 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In548369725 256)))) (or (and .cse0 (= ~y$w_buff1~0_In548369725 |ULTIMATE.start_main_#t~ite63_Out548369725|) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite63_Out548369725| ~y~0_In548369725) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In548369725, ~y~0=~y~0_In548369725, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In548369725, ~y$w_buff1_used~0=~y$w_buff1_used~0_In548369725} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out548369725|, ~y$w_buff1~0=~y$w_buff1~0_In548369725, ~y~0=~y~0_In548369725, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In548369725, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out548369725|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In548369725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 19:36:13,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1890160475 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1890160475 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1890160475 |ULTIMATE.start_main_#t~ite65_Out1890160475|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite65_Out1890160475|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1890160475, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1890160475} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1890160475, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1890160475, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1890160475|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 19:36:13,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-850864799 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-850864799 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-850864799 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-850864799 256) 0))) (or (and (= ~y$w_buff1_used~0_In-850864799 |ULTIMATE.start_main_#t~ite66_Out-850864799|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite66_Out-850864799|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-850864799, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-850864799, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-850864799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-850864799} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-850864799, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-850864799, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-850864799|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-850864799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-850864799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 19:36:13,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1725506754 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1725506754 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1725506754 |ULTIMATE.start_main_#t~ite67_Out1725506754|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out1725506754| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1725506754, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1725506754} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1725506754, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1725506754, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1725506754|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 19:36:13,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1624764927 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1624764927 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1624764927 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1624764927 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-1624764927| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-1624764927| ~y$r_buff1_thd0~0_In-1624764927)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1624764927, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1624764927, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1624764927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1624764927} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1624764927, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1624764927, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1624764927|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1624764927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1624764927} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 19:36:13,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_~__unbuffered_p0_EAX~0_9 1) (= 0 v_~__unbuffered_p1_EBX~0_9) (= |v_ULTIMATE.start_main_#t~ite68_15| v_~y$r_buff1_thd0~0_20)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_15|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:36:13,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:36:13 BasicIcfg [2019-12-27 19:36:13,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:36:13,981 INFO L168 Benchmark]: Toolchain (without parser) took 24252.82 ms. Allocated memory was 142.6 MB in the beginning and 982.0 MB in the end (delta: 839.4 MB). Free memory was 98.5 MB in the beginning and 376.4 MB in the end (delta: -277.9 MB). Peak memory consumption was 561.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:36:13,982 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 142.6 MB. Free memory is still 118.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:36:13,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.65 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 153.2 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:36:13,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 200.3 MB. Free memory was 153.2 MB in the beginning and 150.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:36:13,984 INFO L168 Benchmark]: Boogie Preprocessor took 41.97 ms. Allocated memory is still 200.3 MB. Free memory was 150.2 MB in the beginning and 147.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:36:13,984 INFO L168 Benchmark]: RCFGBuilder took 990.20 ms. Allocated memory is still 200.3 MB. Free memory was 147.2 MB in the beginning and 91.1 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:36:13,985 INFO L168 Benchmark]: TraceAbstraction took 22292.49 ms. Allocated memory was 200.3 MB in the beginning and 982.0 MB in the end (delta: 781.7 MB). Free memory was 91.1 MB in the beginning and 376.4 MB in the end (delta: -285.3 MB). Peak memory consumption was 496.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:36:13,988 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.69 ms. Allocated memory is still 142.6 MB. Free memory is still 118.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.65 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 98.5 MB in the beginning and 153.2 MB in the end (delta: -54.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 200.3 MB. Free memory was 153.2 MB in the beginning and 150.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.97 ms. Allocated memory is still 200.3 MB. Free memory was 150.2 MB in the beginning and 147.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 990.20 ms. Allocated memory is still 200.3 MB. Free memory was 147.2 MB in the beginning and 91.1 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22292.49 ms. Allocated memory was 200.3 MB in the beginning and 982.0 MB in the end (delta: 781.7 MB). Free memory was 91.1 MB in the beginning and 376.4 MB in the end (delta: -285.3 MB). Peak memory consumption was 496.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 116 ProgramPointsAfterwards, 246 TransitionsBefore, 141 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 9313 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 156567 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t10, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t11, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4158 SDtfs, 4119 SDslu, 11859 SDs, 0 SdLazy, 4243 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 13 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 16195 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 809 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 128445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...