/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/mix022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:26:42,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:26:42,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:26:42,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:26:42,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:26:42,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:26:42,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:26:42,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:26:42,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:26:42,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:26:42,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:26:42,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:26:42,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:26:42,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:26:42,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:26:42,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:26:42,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:26:42,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:26:42,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:26:42,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:26:42,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:26:42,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:26:42,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:26:42,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:26:42,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:26:42,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:26:42,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:26:42,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:26:42,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:26:42,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:26:42,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:26:42,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:26:42,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:26:42,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:26:42,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:26:42,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:26:42,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:26:42,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:26:42,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:26:42,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:26:42,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:26:42,574 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 20:26:42,594 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:26:42,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:26:42,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:26:42,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:26:42,596 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:26:42,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:26:42,596 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:26:42,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:26:42,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:26:42,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:26:42,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:26:42,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:26:42,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:26:42,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:26:42,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:26:42,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:26:42,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:26:42,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:26:42,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:26:42,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:26:42,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:26:42,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:26:42,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:26:42,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:26:42,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:26:42,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:26:42,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:26:42,600 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:26:42,600 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:26:42,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:26:42,601 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:26:42,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:26:42,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:26:42,915 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:26:42,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:26:42,920 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:26:42,921 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:26:42,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-27 20:26:42,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8827abd1/7c6ee76d0e9d42929737a514c01154ff/FLAGa0c10f947 [2019-12-27 20:26:43,512 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:26:43,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc.i [2019-12-27 20:26:43,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8827abd1/7c6ee76d0e9d42929737a514c01154ff/FLAGa0c10f947 [2019-12-27 20:26:43,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8827abd1/7c6ee76d0e9d42929737a514c01154ff [2019-12-27 20:26:43,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:26:43,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:26:43,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:26:43,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:26:43,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:26:43,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:26:43" (1/1) ... [2019-12-27 20:26:43,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9b7dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:43, skipping insertion in model container [2019-12-27 20:26:43,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:26:43" (1/1) ... [2019-12-27 20:26:43,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:26:43,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:26:44,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:26:44,486 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:26:44,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:26:44,638 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:26:44,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44 WrapperNode [2019-12-27 20:26:44,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:26:44,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:26:44,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:26:44,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:26:44,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:26:44,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:26:44,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:26:44,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:26:44,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (1/1) ... [2019-12-27 20:26:44,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:26:44,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:26:44,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:26:44,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:26:44,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (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 20:26:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:26:44,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:26:44,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:26:44,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:26:44,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:26:44,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:26:44,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:26:44,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:26:44,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:26:44,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:26:44,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:26:44,832 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 20:26:45,523 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:26:45,524 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:26:45,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:26:45 BoogieIcfgContainer [2019-12-27 20:26:45,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:26:45,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:26:45,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:26:45,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:26:45,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:26:43" (1/3) ... [2019-12-27 20:26:45,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abf3f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:26:45, skipping insertion in model container [2019-12-27 20:26:45,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:26:44" (2/3) ... [2019-12-27 20:26:45,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abf3f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:26:45, skipping insertion in model container [2019-12-27 20:26:45,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:26:45" (3/3) ... [2019-12-27 20:26:45,538 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-12-27 20:26:45,551 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:26:45,552 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:26:45,564 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:26:45,565 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:26:45,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,622 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,687 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,699 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:26:45,718 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:26:45,743 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:26:45,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:26:45,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:26:45,744 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:26:45,744 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:26:45,744 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:26:45,744 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:26:45,744 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:26:45,768 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 20:26:45,771 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:26:45,913 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:26:45,913 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:26:45,932 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:26:45,955 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:26:46,046 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:26:46,046 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:26:46,056 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:26:46,074 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:26:46,075 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:26:49,269 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 20:26:49,519 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 20:26:49,623 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 20:26:49,645 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 20:26:49,645 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 20:26:49,648 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 20:26:50,159 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 20:26:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 20:26:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:26:50,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:50,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:26:50,168 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 20:26:50,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:50,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593268577] [2019-12-27 20:26:50,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:50,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593268577] [2019-12-27 20:26:50,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:50,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:26:50,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291640875] [2019-12-27 20:26:50,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:50,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:50,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:26:50,434 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:50,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:26:50,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:26:50,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:26:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:26:50,451 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 20:26:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:50,762 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 20:26:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:26:50,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:26:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:50,866 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 20:26:50,866 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 20:26:50,868 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 20:26:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 20:26:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 20:26:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 20:26:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 20:26:51,364 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 20:26:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:51,364 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 20:26:51,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:26:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 20:26:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:26:51,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:51,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:26:51,370 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 20:26:51,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:51,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338828852] [2019-12-27 20:26:51,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:51,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338828852] [2019-12-27 20:26:51,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:51,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:26:51,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439447691] [2019-12-27 20:26:51,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:51,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:51,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:26:51,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:51,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:26:51,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:26:51,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:26:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:26:51,536 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 20:26:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:52,026 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-27 20:26:52,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:26:52,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:26:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:52,098 INFO L225 Difference]: With dead ends: 13062 [2019-12-27 20:26:52,099 INFO L226 Difference]: Without dead ends: 13055 [2019-12-27 20:26:52,099 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 20:26:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-27 20:26:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-27 20:26:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 20:26:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-27 20:26:53,104 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-27 20:26:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:53,105 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-27 20:26:53,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:26:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-27 20:26:53,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:26:53,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:53,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:26:53,110 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:53,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:53,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 20:26:53,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:53,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40162388] [2019-12-27 20:26:53,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:53,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40162388] [2019-12-27 20:26:53,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:53,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:26:53,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913066414] [2019-12-27 20:26:53,215 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:53,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:53,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:26:53,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:53,221 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:26:53,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:26:53,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:53,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:26:53,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:26:53,222 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-27 20:26:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:53,484 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-27 20:26:53,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:26:53,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:26:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:53,541 INFO L225 Difference]: With dead ends: 13877 [2019-12-27 20:26:53,541 INFO L226 Difference]: Without dead ends: 13877 [2019-12-27 20:26:53,542 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 20:26:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-27 20:26:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-27 20:26:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-27 20:26:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-27 20:26:54,046 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-27 20:26:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:54,047 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-27 20:26:54,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:26:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-27 20:26:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:26:54,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:54,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:26:54,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:54,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-27 20:26:54,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:54,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30195894] [2019-12-27 20:26:54,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:54,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30195894] [2019-12-27 20:26:54,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:54,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:26:54,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823758542] [2019-12-27 20:26:54,102 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:54,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:54,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 20:26:54,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:54,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:26:54,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:26:54,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:26:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:26:54,109 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-27 20:26:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:54,174 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-27 20:26:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:26:54,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:26:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:54,211 INFO L225 Difference]: With dead ends: 12386 [2019-12-27 20:26:54,211 INFO L226 Difference]: Without dead ends: 12386 [2019-12-27 20:26:54,212 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 20:26:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-27 20:26:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-27 20:26:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-27 20:26:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-27 20:26:54,747 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-27 20:26:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:54,747 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-27 20:26:54,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:26:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-27 20:26:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 20:26:54,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:54,753 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 20:26:54,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:54,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-27 20:26:54,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:54,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168966699] [2019-12-27 20:26:54,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:54,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168966699] [2019-12-27 20:26:54,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:54,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:26:54,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520908905] [2019-12-27 20:26:54,823 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:54,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:54,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 20:26:54,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:54,835 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:26:54,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:26:54,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:26:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:26:54,837 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 4 states. [2019-12-27 20:26:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:54,881 INFO L93 Difference]: Finished difference Result 2361 states and 5903 transitions. [2019-12-27 20:26:54,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:26:54,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 20:26:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:54,887 INFO L225 Difference]: With dead ends: 2361 [2019-12-27 20:26:54,887 INFO L226 Difference]: Without dead ends: 1670 [2019-12-27 20:26:54,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:26:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-27 20:26:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1654. [2019-12-27 20:26:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 20:26:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-27 20:26:54,920 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 17 [2019-12-27 20:26:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:54,920 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-27 20:26:54,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:26:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-27 20:26:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:26:54,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:54,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:26:54,923 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:54,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 20:26:54,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:54,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511485329] [2019-12-27 20:26:54,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:55,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511485329] [2019-12-27 20:26:55,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:55,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:26:55,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658840082] [2019-12-27 20:26:55,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:55,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:55,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:26:55,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:55,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:26:55,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:26:55,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:26:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:26:55,060 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-27 20:26:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:55,692 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-27 20:26:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:26:55,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:26:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:55,702 INFO L225 Difference]: With dead ends: 4552 [2019-12-27 20:26:55,702 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 20:26:55,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:26:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 20:26:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-27 20:26:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-27 20:26:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-27 20:26:55,755 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-27 20:26:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:55,755 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-27 20:26:55,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:26:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-27 20:26:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:26:55,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:55,758 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] [2019-12-27 20:26:55,759 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-27 20:26:55,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:55,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027595222] [2019-12-27 20:26:55,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:55,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027595222] [2019-12-27 20:26:55,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:55,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:26:55,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738522002] [2019-12-27 20:26:55,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:55,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:55,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:26:55,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:55,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:26:55,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:26:55,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:26:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:26:55,862 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 4 states. [2019-12-27 20:26:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:55,891 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-27 20:26:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:26:55,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 20:26:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:55,898 INFO L225 Difference]: With dead ends: 3872 [2019-12-27 20:26:55,898 INFO L226 Difference]: Without dead ends: 2030 [2019-12-27 20:26:55,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:26:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-27 20:26:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-27 20:26:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-27 20:26:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-27 20:26:56,068 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-27 20:26:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:56,068 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-27 20:26:56,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:26:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-27 20:26:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:26:56,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:56,071 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] [2019-12-27 20:26:56,072 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 20:26:56,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:56,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107948742] [2019-12-27 20:26:56,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:56,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107948742] [2019-12-27 20:26:56,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:56,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:26:56,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338441132] [2019-12-27 20:26:56,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:56,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:56,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:26:56,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:56,193 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:26:56,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:26:56,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:26:56,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:26:56,194 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-27 20:26:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:56,695 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-27 20:26:56,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:26:56,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 20:26:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:56,702 INFO L225 Difference]: With dead ends: 3736 [2019-12-27 20:26:56,702 INFO L226 Difference]: Without dead ends: 3707 [2019-12-27 20:26:56,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:26:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-27 20:26:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-27 20:26:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 20:26:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-27 20:26:56,747 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-27 20:26:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:56,748 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-27 20:26:56,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:26:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-27 20:26:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:26:56,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:56,751 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 20:26:56,751 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:56,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:56,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-27 20:26:56,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:56,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538418596] [2019-12-27 20:26:56,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:56,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538418596] [2019-12-27 20:26:56,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:56,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:26:56,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302331124] [2019-12-27 20:26:56,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:56,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:56,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:26:56,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:56,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:26:56,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:26:56,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:26:56,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:26:56,936 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 8 states. [2019-12-27 20:26:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:57,731 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-27 20:26:57,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:26:57,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:26:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:57,737 INFO L225 Difference]: With dead ends: 2989 [2019-12-27 20:26:57,737 INFO L226 Difference]: Without dead ends: 2989 [2019-12-27 20:26:57,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:26:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-27 20:26:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-27 20:26:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 20:26:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-27 20:26:57,780 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-27 20:26:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:57,781 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-27 20:26:57,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:26:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-27 20:26:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:26:57,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:57,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:26:57,786 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 20:26:57,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:57,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117713514] [2019-12-27 20:26:57,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:57,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117713514] [2019-12-27 20:26:57,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:57,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:26:57,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779014757] [2019-12-27 20:26:57,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:57,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:57,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:26:57,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:57,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:26:57,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:26:57,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:26:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:26:57,908 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 6 states. [2019-12-27 20:26:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:57,955 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-27 20:26:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:26:57,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:26:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:57,958 INFO L225 Difference]: With dead ends: 1549 [2019-12-27 20:26:57,958 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 20:26:57,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:26:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 20:26:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-27 20:26:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-27 20:26:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-27 20:26:57,977 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-27 20:26:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:57,978 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-27 20:26:57,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:26:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-27 20:26:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:26:57,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:57,981 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] [2019-12-27 20:26:57,982 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-27 20:26:57,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:57,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347006869] [2019-12-27 20:26:57,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:58,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347006869] [2019-12-27 20:26:58,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:58,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:26:58,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [404760033] [2019-12-27 20:26:58,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:58,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:58,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 135 transitions. [2019-12-27 20:26:58,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:58,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:26:58,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:26:58,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:58,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:26:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:26:58,527 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 9 states. [2019-12-27 20:26:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:26:58,810 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-27 20:26:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:26:58,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:26:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:26:58,812 INFO L225 Difference]: With dead ends: 2115 [2019-12-27 20:26:58,812 INFO L226 Difference]: Without dead ends: 1423 [2019-12-27 20:26:58,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:26:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-27 20:26:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-27 20:26:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 20:26:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-27 20:26:58,833 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-27 20:26:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:26:58,833 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-27 20:26:58,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:26:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-27 20:26:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:26:58,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:26:58,837 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] [2019-12-27 20:26:58,837 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:26:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:26:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-27 20:26:58,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:26:58,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682180139] [2019-12-27 20:26:58,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:26:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:26:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:26:58,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682180139] [2019-12-27 20:26:58,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:26:58,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:26:58,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907556660] [2019-12-27 20:26:58,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:26:58,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:26:59,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 133 transitions. [2019-12-27 20:26:59,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:26:59,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:26:59,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:26:59,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:26:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:26:59,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:26:59,113 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 8 states. [2019-12-27 20:27:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:00,715 INFO L93 Difference]: Finished difference Result 2567 states and 5315 transitions. [2019-12-27 20:27:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 20:27:00,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 20:27:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:00,720 INFO L225 Difference]: With dead ends: 2567 [2019-12-27 20:27:00,720 INFO L226 Difference]: Without dead ends: 2567 [2019-12-27 20:27:00,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 20:27:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2019-12-27 20:27:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 1287. [2019-12-27 20:27:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-12-27 20:27:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2769 transitions. [2019-12-27 20:27:00,752 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2769 transitions. Word has length 51 [2019-12-27 20:27:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:00,752 INFO L462 AbstractCegarLoop]: Abstraction has 1287 states and 2769 transitions. [2019-12-27 20:27:00,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:27:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2769 transitions. [2019-12-27 20:27:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:00,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:00,757 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] [2019-12-27 20:27:00,757 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:00,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1716241888, now seen corresponding path program 3 times [2019-12-27 20:27:00,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:00,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160461412] [2019-12-27 20:27:00,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:00,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160461412] [2019-12-27 20:27:00,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:00,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:00,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430305612] [2019-12-27 20:27:00,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:00,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:00,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 118 transitions. [2019-12-27 20:27:00,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:00,934 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:00,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:00,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:00,936 INFO L87 Difference]: Start difference. First operand 1287 states and 2769 transitions. Second operand 3 states. [2019-12-27 20:27:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:01,001 INFO L93 Difference]: Finished difference Result 1642 states and 3493 transitions. [2019-12-27 20:27:01,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:01,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:27:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:01,004 INFO L225 Difference]: With dead ends: 1642 [2019-12-27 20:27:01,004 INFO L226 Difference]: Without dead ends: 1642 [2019-12-27 20:27:01,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-12-27 20:27:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1271. [2019-12-27 20:27:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-27 20:27:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2729 transitions. [2019-12-27 20:27:01,036 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2729 transitions. Word has length 51 [2019-12-27 20:27:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:01,036 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 2729 transitions. [2019-12-27 20:27:01,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2729 transitions. [2019-12-27 20:27:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:01,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:01,041 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] [2019-12-27 20:27:01,041 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:01,042 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-27 20:27:01,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:01,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471543108] [2019-12-27 20:27:01,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:01,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471543108] [2019-12-27 20:27:01,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:01,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:27:01,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582232640] [2019-12-27 20:27:01,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:01,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:01,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:01,246 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:01,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:27:01,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:01,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:01,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:01,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:01,324 INFO L87 Difference]: Start difference. First operand 1271 states and 2729 transitions. Second operand 9 states. [2019-12-27 20:27:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:03,098 INFO L93 Difference]: Finished difference Result 2538 states and 5234 transitions. [2019-12-27 20:27:03,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:27:03,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 20:27:03,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:03,102 INFO L225 Difference]: With dead ends: 2538 [2019-12-27 20:27:03,102 INFO L226 Difference]: Without dead ends: 2538 [2019-12-27 20:27:03,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:27:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-12-27 20:27:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 1286. [2019-12-27 20:27:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-27 20:27:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-27 20:27:03,129 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-27 20:27:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:03,129 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-27 20:27:03,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-27 20:27:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:03,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:03,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] [2019-12-27 20:27:03,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 20:27:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-27 20:27:03,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:03,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278619106] [2019-12-27 20:27:03,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:03,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278619106] [2019-12-27 20:27:03,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:03,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:03,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264794702] [2019-12-27 20:27:03,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:03,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:03,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:03,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:03,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:03,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:03,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:03,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:03,276 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-27 20:27:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:03,530 INFO L93 Difference]: Finished difference Result 1970 states and 4215 transitions. [2019-12-27 20:27:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:03,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:27:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:03,533 INFO L225 Difference]: With dead ends: 1970 [2019-12-27 20:27:03,534 INFO L226 Difference]: Without dead ends: 1970 [2019-12-27 20:27:03,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-27 20:27:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1316. [2019-12-27 20:27:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-12-27 20:27:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2818 transitions. [2019-12-27 20:27:03,553 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2818 transitions. Word has length 52 [2019-12-27 20:27:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:03,553 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 2818 transitions. [2019-12-27 20:27:03,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2818 transitions. [2019-12-27 20:27:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:03,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:03,557 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] [2019-12-27 20:27:03,557 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-27 20:27:03,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:03,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705625932] [2019-12-27 20:27:03,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:03,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705625932] [2019-12-27 20:27:03,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:03,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:03,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129811277] [2019-12-27 20:27:03,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:03,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:03,712 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 120 transitions. [2019-12-27 20:27:03,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:03,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:03,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:03,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:03,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:03,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:03,714 INFO L87 Difference]: Start difference. First operand 1316 states and 2818 transitions. Second operand 3 states. [2019-12-27 20:27:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:03,732 INFO L93 Difference]: Finished difference Result 1315 states and 2816 transitions. [2019-12-27 20:27:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:03,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:27:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:03,734 INFO L225 Difference]: With dead ends: 1315 [2019-12-27 20:27:03,734 INFO L226 Difference]: Without dead ends: 1315 [2019-12-27 20:27:03,735 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 20:27:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-12-27 20:27:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 935. [2019-12-27 20:27:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-27 20:27:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2029 transitions. [2019-12-27 20:27:03,750 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2029 transitions. Word has length 52 [2019-12-27 20:27:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:03,750 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2029 transitions. [2019-12-27 20:27:03,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2029 transitions. [2019-12-27 20:27:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:27:03,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:03,752 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] [2019-12-27 20:27:03,753 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 20:27:03,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:03,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591204170] [2019-12-27 20:27:03,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:03,919 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:27:03,919 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:27:03,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_22|) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t585~0.base_22| 4)) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_22|) 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= |v_ULTIMATE.start_main_~#t585~0.offset_17| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t585~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t585~0.base_22|) |v_ULTIMATE.start_main_~#t585~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #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_103, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_22|, #length=|v_#length_17|, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_18|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~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_24, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_17|, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:27:03,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:27:03,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:27:03,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1062994834 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1062994834 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1062994834| ~y$w_buff0_used~0_In-1062994834)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1062994834| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1062994834, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1062994834} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1062994834|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1062994834, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1062994834} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:27:03,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2136286262 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2136286262 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In2136286262 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2136286262 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2136286262|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In2136286262 |P0Thread1of1ForFork0_#t~ite6_Out2136286262|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2136286262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2136286262, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2136286262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2136286262} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2136286262|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2136286262, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2136286262, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2136286262, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2136286262} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:27:03,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-109531768 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-109531768 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-109531768 ~y$r_buff0_thd1~0_In-109531768)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out-109531768 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109531768, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-109531768} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109531768, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-109531768|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-109531768} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:27:03,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1268054031 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1268054031| |P1Thread1of1ForFork1_#t~ite14_Out-1268054031|) (= ~y$w_buff0~0_In-1268054031 |P1Thread1of1ForFork1_#t~ite14_Out-1268054031|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1268054031 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1268054031 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1268054031 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1268054031 256)))))) (and (= ~y$w_buff0~0_In-1268054031 |P1Thread1of1ForFork1_#t~ite15_Out-1268054031|) (= |P1Thread1of1ForFork1_#t~ite14_In-1268054031| |P1Thread1of1ForFork1_#t~ite14_Out-1268054031|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1268054031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1268054031, ~y$w_buff0~0=~y$w_buff0~0_In-1268054031, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1268054031, ~weak$$choice2~0=~weak$$choice2~0_In-1268054031, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1268054031|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1268054031} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1268054031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1268054031, ~y$w_buff0~0=~y$w_buff0~0_In-1268054031, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1268054031, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1268054031|, ~weak$$choice2~0=~weak$$choice2~0_In-1268054031, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1268054031|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1268054031} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:27:03,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1532335244 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In-1532335244| |P1Thread1of1ForFork1_#t~ite17_Out-1532335244|) (= ~y$w_buff1~0_In-1532335244 |P1Thread1of1ForFork1_#t~ite18_Out-1532335244|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1532335244 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1532335244 256)) (and (= (mod ~y$w_buff1_used~0_In-1532335244 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1532335244 256))))) (= |P1Thread1of1ForFork1_#t~ite18_Out-1532335244| |P1Thread1of1ForFork1_#t~ite17_Out-1532335244|) .cse0 (= ~y$w_buff1~0_In-1532335244 |P1Thread1of1ForFork1_#t~ite17_Out-1532335244|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1532335244, ~y$w_buff1~0=~y$w_buff1~0_In-1532335244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1532335244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1532335244, ~weak$$choice2~0=~weak$$choice2~0_In-1532335244, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1532335244|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1532335244} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1532335244, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1532335244|, ~y$w_buff1~0=~y$w_buff1~0_In-1532335244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1532335244, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1532335244, ~weak$$choice2~0=~weak$$choice2~0_In-1532335244, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1532335244|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1532335244} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:27:03,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1089781814 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In-1089781814| |P1Thread1of1ForFork1_#t~ite20_Out-1089781814|) (= ~y$w_buff0_used~0_In-1089781814 |P1Thread1of1ForFork1_#t~ite21_Out-1089781814|) (not .cse0)) (and (= ~y$w_buff0_used~0_In-1089781814 |P1Thread1of1ForFork1_#t~ite20_Out-1089781814|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1089781814 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-1089781814 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1089781814 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1089781814 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1089781814| |P1Thread1of1ForFork1_#t~ite20_Out-1089781814|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1089781814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1089781814, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1089781814|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1089781814, ~weak$$choice2~0=~weak$$choice2~0_In-1089781814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1089781814} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1089781814, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1089781814, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1089781814|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1089781814, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1089781814|, ~weak$$choice2~0=~weak$$choice2~0_In-1089781814, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1089781814} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:27:03,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:27:03,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In485947848 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out485947848| |P1Thread1of1ForFork1_#t~ite29_Out485947848|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In485947848 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In485947848 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In485947848 256))) (and (= 0 (mod ~y$r_buff1_thd2~0_In485947848 256)) .cse0))) .cse1 (= ~y$r_buff1_thd2~0_In485947848 |P1Thread1of1ForFork1_#t~ite29_Out485947848|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In485947848| |P1Thread1of1ForFork1_#t~ite29_Out485947848|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out485947848| ~y$r_buff1_thd2~0_In485947848)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In485947848, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In485947848|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485947848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In485947848, ~weak$$choice2~0=~weak$$choice2~0_In485947848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485947848} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In485947848, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out485947848|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out485947848|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In485947848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In485947848, ~weak$$choice2~0=~weak$$choice2~0_In485947848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In485947848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 20:27:03,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1992475823 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1992475823 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1992475823 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1992475823 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1992475823|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In1992475823 |P0Thread1of1ForFork0_#t~ite8_Out1992475823|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1992475823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1992475823, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1992475823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1992475823} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1992475823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1992475823, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1992475823|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1992475823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1992475823} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:27:03,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:27:03,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:27:03,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In631656715 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In631656715 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out631656715| ~y$w_buff1~0_In631656715) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out631656715| ~y~0_In631656715)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In631656715, ~y$w_buff1~0=~y$w_buff1~0_In631656715, ~y~0=~y~0_In631656715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In631656715} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In631656715, ~y$w_buff1~0=~y$w_buff1~0_In631656715, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out631656715|, ~y~0=~y~0_In631656715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In631656715} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 20:27:03,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 20:27:03,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2124878161 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2124878161 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2124878161|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out2124878161| ~y$w_buff0_used~0_In2124878161) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2124878161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2124878161} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2124878161, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2124878161, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2124878161|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:27:03,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1038791986 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1038791986 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1038791986 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1038791986 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1038791986 |P1Thread1of1ForFork1_#t~ite35_Out-1038791986|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1038791986|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1038791986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038791986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038791986, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038791986} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1038791986, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038791986, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038791986, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1038791986|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1038791986} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:27:03,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1342338729 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1342338729 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1342338729| ~y$r_buff0_thd2~0_In-1342338729)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1342338729|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1342338729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1342338729} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1342338729, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1342338729, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1342338729|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:27:03,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-224556064 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-224556064 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-224556064 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-224556064 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-224556064|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out-224556064| ~y$r_buff1_thd2~0_In-224556064)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-224556064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-224556064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-224556064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-224556064} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-224556064, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-224556064, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-224556064, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-224556064|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-224556064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:03,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:03,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:27:03,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1115785725 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1115785725 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1115785725| ~y$w_buff1~0_In1115785725) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1115785725| ~y~0_In1115785725)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1115785725, ~y~0=~y~0_In1115785725, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1115785725, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115785725} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1115785725|, ~y$w_buff1~0=~y$w_buff1~0_In1115785725, ~y~0=~y~0_In1115785725, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1115785725, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115785725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:27:03,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:27:03,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1376085588 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1376085588 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1376085588 |ULTIMATE.start_main_#t~ite42_Out-1376085588|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1376085588|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376085588, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1376085588} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1376085588, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1376085588, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1376085588|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:27:03,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In60640235 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In60640235 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In60640235 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In60640235 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out60640235|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In60640235 |ULTIMATE.start_main_#t~ite43_Out60640235|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In60640235, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In60640235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In60640235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In60640235} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In60640235, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In60640235, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out60640235|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In60640235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In60640235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:27:03,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-575729457 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-575729457 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-575729457 |ULTIMATE.start_main_#t~ite44_Out-575729457|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-575729457|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-575729457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-575729457} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-575729457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-575729457, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-575729457|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:27:03,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1884759287 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1884759287 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1884759287 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1884759287 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1884759287| ~y$r_buff1_thd0~0_In-1884759287) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1884759287| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1884759287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1884759287, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1884759287, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884759287} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1884759287, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1884759287, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1884759287, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1884759287|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884759287} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:27:03,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:27:04,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:27:04 BasicIcfg [2019-12-27 20:27:04,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:27:04,007 INFO L168 Benchmark]: Toolchain (without parser) took 20161.26 ms. Allocated memory was 144.7 MB in the beginning and 769.7 MB in the end (delta: 625.0 MB). Free memory was 101.0 MB in the beginning and 308.1 MB in the end (delta: -207.0 MB). Peak memory consumption was 417.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:04,008 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:27:04,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.74 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 154.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:04,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.25 ms. Allocated memory is still 201.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:04,010 INFO L168 Benchmark]: Boogie Preprocessor took 41.79 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:04,011 INFO L168 Benchmark]: RCFGBuilder took 777.89 ms. Allocated memory is still 201.9 MB. Free memory was 149.0 MB in the beginning and 104.6 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:04,012 INFO L168 Benchmark]: TraceAbstraction took 18478.18 ms. Allocated memory was 201.9 MB in the beginning and 769.7 MB in the end (delta: 567.8 MB). Free memory was 104.6 MB in the beginning and 308.1 MB in the end (delta: -203.5 MB). Peak memory consumption was 364.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:04,022 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.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.74 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 154.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.25 ms. Allocated memory is still 201.9 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.79 ms. Allocated memory is still 201.9 MB. Free memory was 151.8 MB in the beginning and 149.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.89 ms. Allocated memory is still 201.9 MB. Free memory was 149.0 MB in the beginning and 104.6 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18478.18 ms. Allocated memory was 201.9 MB in the beginning and 769.7 MB in the end (delta: 567.8 MB). Free memory was 104.6 MB in the beginning and 308.1 MB in the end (delta: -203.5 MB). Peak memory consumption was 364.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, 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] [L762] 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_p1_EAX=2, __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=2, 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] [L738] 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) [L762] 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) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L763] 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)) [L764] 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)) [L765] 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)) [L766] 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_p1_EAX=2, __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=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 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=1, __unbuffered_p1_EAX=2, __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=2, 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] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, 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] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2239 SDtfs, 2684 SDslu, 5028 SDs, 0 SdLazy, 4147 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 58 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 11603 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 58528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...