/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/mix048_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:25:23,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:25:23,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:25:23,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:25:23,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:25:23,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:25:23,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:25:23,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:25:23,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:25:23,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:25:23,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:25:23,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:25:23,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:25:23,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:25:23,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:25:23,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:25:23,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:25:23,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:25:23,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:25:23,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:25:23,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:25:23,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:25:23,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:25:23,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:25:23,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:25:23,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:25:23,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:25:23,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:25:23,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:25:23,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:25:23,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:25:23,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:25:23,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:25:23,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:25:23,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:25:23,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:25:23,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:25:23,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:25:23,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:25:23,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:25:23,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:25:23,709 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 21:25:23,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:25:23,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:25:23,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:25:23,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:25:23,726 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:25:23,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:25:23,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:25:23,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:25:23,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:25:23,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:25:23,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:25:23,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:25:23,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:25:23,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:25:23,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:25:23,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:25:23,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:25:23,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:25:23,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:25:23,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:25:23,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:25:23,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:25:23,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:25:23,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:25:23,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:25:23,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:25:23,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:25:23,730 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:25:23,730 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:25:23,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:25:23,731 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:25:23,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:25:24,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:25:24,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:25:24,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:25:24,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:25:24,039 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:25:24,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i [2019-12-27 21:25:24,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153cc8d6f/b54f3c542e424954b816db9402ae1e93/FLAGec5475cba [2019-12-27 21:25:24,698 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:25:24,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_pso.oepc.i [2019-12-27 21:25:24,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153cc8d6f/b54f3c542e424954b816db9402ae1e93/FLAGec5475cba [2019-12-27 21:25:25,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/153cc8d6f/b54f3c542e424954b816db9402ae1e93 [2019-12-27 21:25:25,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:25:25,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:25:25,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:25:25,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:25:25,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:25:25,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23588bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25, skipping insertion in model container [2019-12-27 21:25:25,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:25:25,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:25:25,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:25:25,671 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:25:25,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:25:25,802 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:25:25,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25 WrapperNode [2019-12-27 21:25:25,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:25:25,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:25:25,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:25:25,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:25:25,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:25:25,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:25:25,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:25:25,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:25:25,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (1/1) ... [2019-12-27 21:25:25,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:25:25,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:25:25,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:25:25,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:25:25,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (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 21:25:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:25:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:25:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:25:25,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:25:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:25:25,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:25:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:25:25,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:25:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:25:25,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:25:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:25:25,997 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 21:25:26,657 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:25:26,657 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:25:26,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:25:26 BoogieIcfgContainer [2019-12-27 21:25:26,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:25:26,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:25:26,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:25:26,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:25:26,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:25:25" (1/3) ... [2019-12-27 21:25:26,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c60c983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:25:26, skipping insertion in model container [2019-12-27 21:25:26,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:25:25" (2/3) ... [2019-12-27 21:25:26,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c60c983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:25:26, skipping insertion in model container [2019-12-27 21:25:26,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:25:26" (3/3) ... [2019-12-27 21:25:26,672 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.oepc.i [2019-12-27 21:25:26,682 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:25:26,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:25:26,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:25:26,696 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:25:26,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:25:26,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:25:26,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:25:26,891 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:25:26,891 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:25:26,891 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:25:26,891 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:25:26,891 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:25:26,891 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:25:26,891 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:25:26,907 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:25:26,909 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:25:26,997 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:25:26,998 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:25:27,012 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 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:25:27,030 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:25:27,095 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:25:27,096 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:25:27,104 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 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:25:27,118 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:25:27,119 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:25:30,510 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:25:30,619 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:25:30,647 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 21:25:30,647 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 21:25:30,650 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 21:25:31,060 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 21:25:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 21:25:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:25:31,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:31,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:25:31,069 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:31,076 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 21:25:31,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:31,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775027649] [2019-12-27 21:25:31,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:31,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775027649] [2019-12-27 21:25:31,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:31,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:25:31,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1571713196] [2019-12-27 21:25:31,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:31,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:31,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:25:31,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:31,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:31,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:31,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:31,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:31,396 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 21:25:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:31,666 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 21:25:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:31,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:25:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:31,756 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 21:25:31,756 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 21:25:31,758 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 21:25:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 21:25:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 21:25:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 21:25:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 21:25:32,153 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 21:25:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:32,154 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 21:25:32,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 21:25:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:25:32,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:32,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:32,158 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:32,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:32,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 21:25:32,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:32,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775223709] [2019-12-27 21:25:32,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:32,284 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 21:25:32,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775223709] [2019-12-27 21:25:32,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:32,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:32,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676357730] [2019-12-27 21:25:32,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:32,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:32,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:25:32,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:32,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:32,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:25:32,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:32,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:25:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:25:32,296 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 21:25:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:32,370 INFO L93 Difference]: Finished difference Result 1719 states and 4310 transitions. [2019-12-27 21:25:32,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:25:32,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:25:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:32,378 INFO L225 Difference]: With dead ends: 1719 [2019-12-27 21:25:32,379 INFO L226 Difference]: Without dead ends: 1263 [2019-12-27 21:25:32,379 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 21:25:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-12-27 21:25:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2019-12-27 21:25:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-12-27 21:25:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2849 transitions. [2019-12-27 21:25:32,414 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2849 transitions. Word has length 11 [2019-12-27 21:25:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:32,415 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 2849 transitions. [2019-12-27 21:25:32,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:25:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2849 transitions. [2019-12-27 21:25:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:25:32,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:32,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:25:32,417 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 21:25:32,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:32,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265870362] [2019-12-27 21:25:32,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:32,598 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 21:25:32,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265870362] [2019-12-27 21:25:32,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:32,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:32,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2121818859] [2019-12-27 21:25:32,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:32,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:32,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:25:32,608 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:32,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:32,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:25:32,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:25:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:25:32,609 INFO L87 Difference]: Start difference. First operand 1263 states and 2849 transitions. Second operand 5 states. [2019-12-27 21:25:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:32,909 INFO L93 Difference]: Finished difference Result 1830 states and 4011 transitions. [2019-12-27 21:25:32,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:25:32,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:25:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:32,921 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 21:25:32,921 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 21:25:32,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:25:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 21:25:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1523. [2019-12-27 21:25:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-27 21:25:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-27 21:25:32,970 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 14 [2019-12-27 21:25:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:32,971 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-27 21:25:32,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:25:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-27 21:25:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:25:32,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:32,975 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 21:25:32,975 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 21:25:32,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:32,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379694984] [2019-12-27 21:25:32,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:33,157 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 21:25:33,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379694984] [2019-12-27 21:25:33,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:33,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:25:33,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1440233177] [2019-12-27 21:25:33,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:33,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:33,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:25:33,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:33,170 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:33,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:33,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:33,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:33,172 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-27 21:25:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:33,600 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-27 21:25:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:25:33,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:25:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:33,614 INFO L225 Difference]: With dead ends: 2313 [2019-12-27 21:25:33,615 INFO L226 Difference]: Without dead ends: 2260 [2019-12-27 21:25:33,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:25:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-27 21:25:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-27 21:25:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-27 21:25:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-27 21:25:33,659 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-27 21:25:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:33,660 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-27 21:25:33,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-27 21:25:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:25:33,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:33,662 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 21:25:33,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:33,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-27 21:25:33,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:33,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823838040] [2019-12-27 21:25:33,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:33,752 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 21:25:33,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823838040] [2019-12-27 21:25:33,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:33,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:25:33,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [275627001] [2019-12-27 21:25:33,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:33,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:33,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 21:25:33,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:33,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:25:33,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:25:33,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:25:33,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:25:33,894 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 8 states. [2019-12-27 21:25:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:34,613 INFO L93 Difference]: Finished difference Result 2343 states and 5072 transitions. [2019-12-27 21:25:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:25:34,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-27 21:25:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:34,626 INFO L225 Difference]: With dead ends: 2343 [2019-12-27 21:25:34,626 INFO L226 Difference]: Without dead ends: 2343 [2019-12-27 21:25:34,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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 21:25:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-27 21:25:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2045. [2019-12-27 21:25:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-27 21:25:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4487 transitions. [2019-12-27 21:25:34,675 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4487 transitions. Word has length 26 [2019-12-27 21:25:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:34,675 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4487 transitions. [2019-12-27 21:25:34,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:25:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4487 transitions. [2019-12-27 21:25:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:25:34,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:34,679 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 21:25:34,679 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-27 21:25:34,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:34,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489738162] [2019-12-27 21:25:34,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:34,805 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 21:25:34,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489738162] [2019-12-27 21:25:34,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:34,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:25:34,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315600556] [2019-12-27 21:25:34,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:34,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:34,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 21:25:34,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:34,841 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:25:34,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:25:34,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:25:34,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:25:34,842 INFO L87 Difference]: Start difference. First operand 2045 states and 4487 transitions. Second operand 6 states. [2019-12-27 21:25:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:34,891 INFO L93 Difference]: Finished difference Result 1263 states and 2646 transitions. [2019-12-27 21:25:34,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:25:34,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:25:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:34,897 INFO L225 Difference]: With dead ends: 1263 [2019-12-27 21:25:34,898 INFO L226 Difference]: Without dead ends: 1144 [2019-12-27 21:25:34,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 21:25:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-27 21:25:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1055. [2019-12-27 21:25:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-27 21:25:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2231 transitions. [2019-12-27 21:25:34,921 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2231 transitions. Word has length 27 [2019-12-27 21:25:34,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:34,921 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2231 transitions. [2019-12-27 21:25:34,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:25:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2231 transitions. [2019-12-27 21:25:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:25:34,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:34,924 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 21:25:34,925 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1622987432, now seen corresponding path program 1 times [2019-12-27 21:25:34,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:34,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404994637] [2019-12-27 21:25:34,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:35,022 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 21:25:35,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404994637] [2019-12-27 21:25:35,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:35,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:25:35,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2007617190] [2019-12-27 21:25:35,023 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:35,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:35,090 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 90 transitions. [2019-12-27 21:25:35,090 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:35,100 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:25:35,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:25:35,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:25:35,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:25:35,102 INFO L87 Difference]: Start difference. First operand 1055 states and 2231 transitions. Second operand 7 states. [2019-12-27 21:25:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:35,425 INFO L93 Difference]: Finished difference Result 3013 states and 6181 transitions. [2019-12-27 21:25:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:25:35,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 21:25:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:35,434 INFO L225 Difference]: With dead ends: 3013 [2019-12-27 21:25:35,434 INFO L226 Difference]: Without dead ends: 2064 [2019-12-27 21:25:35,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:25:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-27 21:25:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1102. [2019-12-27 21:25:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-27 21:25:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2323 transitions. [2019-12-27 21:25:35,467 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2323 transitions. Word has length 51 [2019-12-27 21:25:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:35,468 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2323 transitions. [2019-12-27 21:25:35,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:25:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2323 transitions. [2019-12-27 21:25:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:25:35,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:35,471 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 21:25:35,471 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2012209130, now seen corresponding path program 2 times [2019-12-27 21:25:35,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:35,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061716379] [2019-12-27 21:25:35,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:25:35,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061716379] [2019-12-27 21:25:35,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:35,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:25:35,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1415001624] [2019-12-27 21:25:35,555 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:35,573 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:35,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 116 transitions. [2019-12-27 21:25:35,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:35,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:25:35,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:25:35,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:35,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:25:35,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:25:35,637 INFO L87 Difference]: Start difference. First operand 1102 states and 2323 transitions. Second operand 4 states. [2019-12-27 21:25:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:35,661 INFO L93 Difference]: Finished difference Result 1851 states and 3924 transitions. [2019-12-27 21:25:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:25:35,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 21:25:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:35,671 INFO L225 Difference]: With dead ends: 1851 [2019-12-27 21:25:35,671 INFO L226 Difference]: Without dead ends: 818 [2019-12-27 21:25:35,672 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 21:25:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-27 21:25:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2019-12-27 21:25:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-27 21:25:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1731 transitions. [2019-12-27 21:25:35,689 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1731 transitions. Word has length 51 [2019-12-27 21:25:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:35,690 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1731 transitions. [2019-12-27 21:25:35,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:25:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1731 transitions. [2019-12-27 21:25:35,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:25:35,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:35,692 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 21:25:35,692 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 3 times [2019-12-27 21:25:35,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:35,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273822776] [2019-12-27 21:25:35,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:35,852 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 21:25:35,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273822776] [2019-12-27 21:25:35,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:35,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:25:35,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [77515905] [2019-12-27 21:25:35,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:35,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:35,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 111 transitions. [2019-12-27 21:25:35,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:36,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:25:36,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:25:36,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:25:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:25:36,085 INFO L87 Difference]: Start difference. First operand 818 states and 1731 transitions. Second operand 9 states. [2019-12-27 21:25:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:36,359 INFO L93 Difference]: Finished difference Result 1396 states and 2860 transitions. [2019-12-27 21:25:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:25:36,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 21:25:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:36,362 INFO L225 Difference]: With dead ends: 1396 [2019-12-27 21:25:36,362 INFO L226 Difference]: Without dead ends: 948 [2019-12-27 21:25:36,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:25:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-27 21:25:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 794. [2019-12-27 21:25:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-27 21:25:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1681 transitions. [2019-12-27 21:25:36,379 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1681 transitions. Word has length 51 [2019-12-27 21:25:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:36,380 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1681 transitions. [2019-12-27 21:25:36,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:25:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1681 transitions. [2019-12-27 21:25:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:25:36,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:36,382 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 21:25:36,382 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 4 times [2019-12-27 21:25:36,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:36,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11236934] [2019-12-27 21:25:36,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:36,448 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 21:25:36,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11236934] [2019-12-27 21:25:36,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:36,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:36,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134101874] [2019-12-27 21:25:36,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:36,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:36,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 21:25:36,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:36,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:36,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:36,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:36,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:36,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:36,527 INFO L87 Difference]: Start difference. First operand 794 states and 1681 transitions. Second operand 3 states. [2019-12-27 21:25:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:36,575 INFO L93 Difference]: Finished difference Result 1036 states and 2174 transitions. [2019-12-27 21:25:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:36,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:25:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:36,578 INFO L225 Difference]: With dead ends: 1036 [2019-12-27 21:25:36,578 INFO L226 Difference]: Without dead ends: 1036 [2019-12-27 21:25:36,578 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 21:25:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-27 21:25:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 840. [2019-12-27 21:25:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-27 21:25:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1784 transitions. [2019-12-27 21:25:36,597 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1784 transitions. Word has length 51 [2019-12-27 21:25:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:36,597 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1784 transitions. [2019-12-27 21:25:36,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1784 transitions. [2019-12-27 21:25:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:25:36,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:36,600 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 21:25:36,600 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-27 21:25:36,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:36,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901390510] [2019-12-27 21:25:36,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:25:36,695 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 21:25:36,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901390510] [2019-12-27 21:25:36,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:25:36,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:25:36,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966002254] [2019-12-27 21:25:36,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:25:36,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:25:36,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 131 transitions. [2019-12-27 21:25:36,844 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:25:36,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:25:36,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:25:36,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:25:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:25:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:25:36,846 INFO L87 Difference]: Start difference. First operand 840 states and 1784 transitions. Second operand 3 states. [2019-12-27 21:25:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:25:36,881 INFO L93 Difference]: Finished difference Result 839 states and 1782 transitions. [2019-12-27 21:25:36,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:25:36,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:25:36,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:25:36,884 INFO L225 Difference]: With dead ends: 839 [2019-12-27 21:25:36,884 INFO L226 Difference]: Without dead ends: 839 [2019-12-27 21:25:36,884 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 21:25:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-12-27 21:25:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 743. [2019-12-27 21:25:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-27 21:25:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-27 21:25:36,899 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-27 21:25:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:25:36,900 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-27 21:25:36,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:25:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-27 21:25:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:25:36,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:25:36,902 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 21:25:36,902 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:25:36,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:25:36,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 21:25:36,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:25:36,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905059836] [2019-12-27 21:25:36,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:25:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:25:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:25:37,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:25:37,084 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:25:37,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_ULTIMATE.start_main_~#t1285~0.offset_19| 0) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1285~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1285~0.base_24|) |v_ULTIMATE.start_main_~#t1285~0.offset_19| 0)) |v_#memory_int_17|) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1285~0.base_24|) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1285~0.base_24| 1)) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1285~0.base_24|)) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1285~0.base_24| 4) |v_#length_17|) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~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_24|, 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_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ULTIMATE.start_main_~#t1286~0.base=|v_ULTIMATE.start_main_~#t1286~0.base_25|, ULTIMATE.start_main_~#t1286~0.offset=|v_ULTIMATE.start_main_~#t1286~0.offset_19|, ~y~0=v_~y~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_~#t1285~0.offset=|v_ULTIMATE.start_main_~#t1285~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ULTIMATE.start_main_~#t1285~0.base=|v_ULTIMATE.start_main_~#t1285~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, 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_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #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_15, 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_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} 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_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1286~0.base, ULTIMATE.start_main_~#t1286~0.offset, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1285~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1285~0.base, ~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, #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 21:25:37,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1286~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1286~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1286~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1286~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1286~0.base_13|) |v_ULTIMATE.start_main_~#t1286~0.offset_11| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1286~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1286~0.offset_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1286~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1286~0.base=|v_ULTIMATE.start_main_~#t1286~0.base_13|, ULTIMATE.start_main_~#t1286~0.offset=|v_ULTIMATE.start_main_~#t1286~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1286~0.base, ULTIMATE.start_main_~#t1286~0.offset, #length] because there is no mapped edge [2019-12-27 21:25:37,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2121324435)) (= ~y$r_buff0_thd1~0_In-2121324435 ~y$r_buff1_thd1~0_Out-2121324435) (= ~y$r_buff1_thd2~0_Out-2121324435 ~y$r_buff0_thd2~0_In-2121324435) (= ~x~0_In-2121324435 ~__unbuffered_p0_EAX~0_Out-2121324435) (= ~y$r_buff0_thd1~0_Out-2121324435 1) (= ~y$r_buff1_thd0~0_Out-2121324435 ~y$r_buff0_thd0~0_In-2121324435)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2121324435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2121324435, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2121324435, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2121324435, ~x~0=~x~0_In-2121324435} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2121324435, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2121324435, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2121324435, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2121324435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2121324435, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2121324435, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2121324435, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2121324435, ~x~0=~x~0_In-2121324435} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:25:37,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1659553108 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1659553108 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1659553108|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1659553108| ~y$w_buff0_used~0_In1659553108) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1659553108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1659553108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1659553108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1659553108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1659553108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:25:37,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1818230783 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out1818230783| ~y$w_buff0_used~0_In1818230783) (= |P1Thread1of1ForFork1_#t~ite20_In1818230783| |P1Thread1of1ForFork1_#t~ite20_Out1818230783|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1818230783 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1818230783 256))) (= 0 (mod ~y$w_buff0_used~0_In1818230783 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1818230783 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out1818230783| |P1Thread1of1ForFork1_#t~ite20_Out1818230783|) (= ~y$w_buff0_used~0_In1818230783 |P1Thread1of1ForFork1_#t~ite20_Out1818230783|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1818230783, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1818230783, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1818230783|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1818230783, ~weak$$choice2~0=~weak$$choice2~0_In1818230783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1818230783} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1818230783, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1818230783, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1818230783|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1818230783, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1818230783|, ~weak$$choice2~0=~weak$$choice2~0_In1818230783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1818230783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:25:37,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out801544867| |P1Thread1of1ForFork1_#t~ite23_Out801544867|)) (.cse1 (= (mod ~weak$$choice2~0_In801544867 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In801544867 256) 0)) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In801544867 256))) (.cse5 (= (mod ~y$w_buff1_used~0_In801544867 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In801544867 256)))) (or (and (or (and .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3)) (= ~y$w_buff1_used~0_In801544867 |P1Thread1of1ForFork1_#t~ite23_Out801544867|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In801544867| |P1Thread1of1ForFork1_#t~ite23_Out801544867|) (= ~y$w_buff1_used~0_In801544867 |P1Thread1of1ForFork1_#t~ite24_Out801544867|) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite22_In801544867| |P1Thread1of1ForFork1_#t~ite22_Out801544867|)) (let ((.cse6 (not .cse3))) (and .cse0 .cse1 (= 0 |P1Thread1of1ForFork1_#t~ite22_Out801544867|) (= |P1Thread1of1ForFork1_#t~ite23_Out801544867| |P1Thread1of1ForFork1_#t~ite22_Out801544867|) (or .cse6 (not .cse2)) (not .cse4) (or .cse6 (not .cse5)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In801544867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In801544867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In801544867, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In801544867|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In801544867|, ~weak$$choice2~0=~weak$$choice2~0_In801544867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In801544867} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In801544867, ~y$w_buff0_used~0=~y$w_buff0_used~0_In801544867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In801544867, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out801544867|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out801544867|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out801544867|, ~weak$$choice2~0=~weak$$choice2~0_In801544867, ~y$w_buff1_used~0=~y$w_buff1_used~0_In801544867} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 21:25:37,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} 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 21:25:37,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-44766229 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-44766229 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-44766229 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-44766229 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-44766229| ~y$w_buff1_used~0_In-44766229) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-44766229| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-44766229, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-44766229, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-44766229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44766229} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-44766229|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-44766229, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-44766229, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-44766229, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44766229} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:25:37,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2073168336 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2073168336 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-2073168336 ~y$r_buff0_thd1~0_Out-2073168336)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-2073168336 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2073168336, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2073168336} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2073168336, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2073168336|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2073168336} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:25:37,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-51124766 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-51124766| |P1Thread1of1ForFork1_#t~ite30_Out-51124766|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-51124766 256))) (.cse5 (= (mod ~y$w_buff0_used~0_In-51124766 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-51124766 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-51124766 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In-51124766| |P1Thread1of1ForFork1_#t~ite28_Out-51124766|) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-51124766| ~y$r_buff1_thd2~0_In-51124766) (= |P1Thread1of1ForFork1_#t~ite29_In-51124766| |P1Thread1of1ForFork1_#t~ite29_Out-51124766|) (not .cse0)) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-51124766| ~y$r_buff1_thd2~0_In-51124766) .cse0 (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse3)) (= |P1Thread1of1ForFork1_#t~ite29_Out-51124766| |P1Thread1of1ForFork1_#t~ite28_Out-51124766|) .cse1 .cse0 (not .cse5) (or .cse6 (not .cse4)) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-51124766|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-51124766, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-51124766|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-51124766, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-51124766, ~weak$$choice2~0=~weak$$choice2~0_In-51124766, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-51124766|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-51124766} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-51124766, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-51124766|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-51124766|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-51124766, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-51124766, ~weak$$choice2~0=~weak$$choice2~0_In-51124766, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-51124766|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-51124766} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:25:37,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In444244440 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In444244440 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In444244440 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In444244440 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out444244440| ~y$r_buff1_thd1~0_In444244440) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out444244440| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In444244440, ~y$w_buff0_used~0=~y$w_buff0_used~0_In444244440, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In444244440, ~y$w_buff1_used~0=~y$w_buff1_used~0_In444244440} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In444244440, ~y$w_buff0_used~0=~y$w_buff0_used~0_In444244440, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out444244440|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In444244440, ~y$w_buff1_used~0=~y$w_buff1_used~0_In444244440} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:25:37,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} 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_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 21:25:37,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1976811723 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1976811723 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1976811723| ~y$w_buff1~0_In-1976811723) (not .cse0) (not .cse1)) (and (= ~y~0_In-1976811723 |P1Thread1of1ForFork1_#t~ite32_Out-1976811723|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1976811723, ~y$w_buff1~0=~y$w_buff1~0_In-1976811723, ~y~0=~y~0_In-1976811723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1976811723} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1976811723, ~y$w_buff1~0=~y$w_buff1~0_In-1976811723, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1976811723|, ~y~0=~y~0_In-1976811723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1976811723} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:25:37,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |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_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 21:25:37,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-123801267 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-123801267 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-123801267| ~y$w_buff0_used~0_In-123801267)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-123801267|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-123801267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-123801267} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-123801267, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-123801267, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-123801267|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:25:37,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1341845796 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1341845796 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1341845796 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1341845796 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1341845796| 0)) (and (= ~y$w_buff1_used~0_In1341845796 |P1Thread1of1ForFork1_#t~ite35_Out1341845796|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1341845796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1341845796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1341845796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1341845796} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1341845796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1341845796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1341845796, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1341845796|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1341845796} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:25:37,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1493568414 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1493568414 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1493568414|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1493568414| ~y$r_buff0_thd2~0_In-1493568414) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1493568414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1493568414} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1493568414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1493568414, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1493568414|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:25:37,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1798544643 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1798544643 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1798544643 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1798544643 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1798544643|)) (and (= ~y$r_buff1_thd2~0_In1798544643 |P1Thread1of1ForFork1_#t~ite37_Out1798544643|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1798544643, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1798544643, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1798544643, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798544643} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1798544643, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1798544643, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1798544643, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1798544643|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798544643} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:25:37,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, 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 21:25:37,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, 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_10} 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 21:25:37,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:25:37,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-477501877 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-477501877 256) 0))) (or (and (= ~y~0_In-477501877 |ULTIMATE.start_main_#t~ite40_Out-477501877|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-477501877| ~y$w_buff1~0_In-477501877) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-477501877, ~y~0=~y~0_In-477501877, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477501877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477501877} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-477501877|, ~y$w_buff1~0=~y$w_buff1~0_In-477501877, ~y~0=~y~0_In-477501877, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477501877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477501877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:25:37,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~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 21:25:37,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1082161694 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1082161694 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1082161694|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1082161694 |ULTIMATE.start_main_#t~ite42_Out-1082161694|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082161694, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1082161694} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082161694, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1082161694, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1082161694|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:25:37,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-860186578 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-860186578 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-860186578 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-860186578 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-860186578| ~y$w_buff1_used~0_In-860186578) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-860186578| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-860186578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-860186578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-860186578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860186578} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-860186578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-860186578, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-860186578|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-860186578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-860186578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:25:37,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In791846638 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In791846638 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out791846638| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out791846638| ~y$r_buff0_thd0~0_In791846638)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In791846638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In791846638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In791846638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In791846638, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out791846638|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:25:37,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1926009712 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1926009712 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1926009712 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1926009712 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1926009712| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1926009712| ~y$r_buff1_thd0~0_In1926009712)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1926009712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926009712, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1926009712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926009712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1926009712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1926009712, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1926009712, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1926009712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1926009712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:25:37,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 21:25:37,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:25:37 BasicIcfg [2019-12-27 21:25:37,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:25:37,217 INFO L168 Benchmark]: Toolchain (without parser) took 12195.74 ms. Allocated memory was 136.3 MB in the beginning and 471.3 MB in the end (delta: 335.0 MB). Free memory was 98.9 MB in the beginning and 286.0 MB in the end (delta: -187.2 MB). Peak memory consumption was 147.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:37,218 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 21:25:37,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.96 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 98.7 MB in the beginning and 155.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:37,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:37,223 INFO L168 Benchmark]: Boogie Preprocessor took 45.77 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:37,224 INFO L168 Benchmark]: RCFGBuilder took 720.82 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 106.2 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:37,225 INFO L168 Benchmark]: TraceAbstraction took 10553.41 ms. Allocated memory was 201.3 MB in the beginning and 471.3 MB in the end (delta: 270.0 MB). Free memory was 106.2 MB in the beginning and 286.0 MB in the end (delta: -179.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:25:37,229 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 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.96 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 98.7 MB in the beginning and 155.4 MB in the end (delta: -56.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.77 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 720.82 ms. Allocated memory is still 201.3 MB. Free memory was 150.7 MB in the beginning and 106.2 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10553.41 ms. Allocated memory was 201.3 MB in the beginning and 471.3 MB in the end (delta: 270.0 MB). Free memory was 106.2 MB in the beginning and 286.0 MB in the end (delta: -179.8 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1285, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 [L796] FCALL, FORK 0 pthread_create(&t1286, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_p0_EAX=0, __unbuffered_p1_EAX=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=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 = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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) [L759] 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) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 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)) [L762] 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)) [L763] 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)) [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 [L765] 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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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: 10.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1344 SDtfs, 1698 SDslu, 3201 SDs, 0 SdLazy, 1441 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2762 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 69241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...