/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/podwr000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:45:45,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:45:45,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:45:45,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:45:45,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:45:45,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:45:45,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:45:45,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:45:45,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:45:45,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:45:45,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:45:45,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:45:45,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:45:45,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:45:45,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:45:45,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:45:45,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:45:45,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:45:45,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:45:45,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:45:45,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:45:45,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:45:45,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:45:45,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:45:45,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:45:45,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:45:45,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:45:45,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:45:45,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:45:45,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:45:45,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:45:45,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:45:45,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:45:45,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:45:45,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:45:45,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:45:45,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:45:45,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:45:45,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:45:45,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:45:45,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:45:45,782 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:45:45,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:45:45,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:45:45,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:45:45,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:45:45,813 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:45:45,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:45:45,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:45:45,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:45:45,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:45:45,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:45:45,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:45:45,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:45:45,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:45:45,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:45:45,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:45:45,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:45:45,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:45:45,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:45:45,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:45:45,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:45:45,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:45:45,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:45:45,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:45:45,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:45:45,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:45:45,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:45:45,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:45:45,819 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:45:45,819 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:45:45,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:45:45,820 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:45:45,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:45:46,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:45:46,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:45:46,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:45:46,100 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:45:46,101 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:45:46,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr000_power.opt.i [2019-12-27 21:45:46,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024a23ce9/3c73ed11ad6546d7a0dd6b98894342c1/FLAGe24d91e5c [2019-12-27 21:45:46,745 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:45:46,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr000_power.opt.i [2019-12-27 21:45:46,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024a23ce9/3c73ed11ad6546d7a0dd6b98894342c1/FLAGe24d91e5c [2019-12-27 21:45:47,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024a23ce9/3c73ed11ad6546d7a0dd6b98894342c1 [2019-12-27 21:45:47,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:45:47,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:45:47,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:45:47,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:45:47,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:45:47,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7133b15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47, skipping insertion in model container [2019-12-27 21:45:47,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:45:47,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:45:47,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:45:47,609 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:45:47,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:45:47,776 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:45:47,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47 WrapperNode [2019-12-27 21:45:47,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:45:47,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:45:47,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:45:47,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:45:47,787 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:45:47" (1/1) ... [2019-12-27 21:45:47,806 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:45:47" (1/1) ... [2019-12-27 21:45:47,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:45:47,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:45:47,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:45:47,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:45:47,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (1/1) ... [2019-12-27 21:45:47,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:45:47,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:45:47,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:45:47,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:45:47,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (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:45:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:45:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:45:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:45:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:45:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:45:47,951 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:45:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:45:47,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:45:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:45:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:45:47,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:45:47,955 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:45:48,630 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:45:48,631 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:45:48,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:45:48 BoogieIcfgContainer [2019-12-27 21:45:48,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:45:48,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:45:48,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:45:48,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:45:48,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:45:47" (1/3) ... [2019-12-27 21:45:48,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261679bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:45:48, skipping insertion in model container [2019-12-27 21:45:48,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:45:47" (2/3) ... [2019-12-27 21:45:48,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261679bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:45:48, skipping insertion in model container [2019-12-27 21:45:48,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:45:48" (3/3) ... [2019-12-27 21:45:48,641 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_power.opt.i [2019-12-27 21:45:48,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:45:48,653 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:45:48,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:45:48,666 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:45:48,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,719 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,719 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,769 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:45:48,794 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:45:48,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:45:48,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:45:48,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:45:48,814 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:45:48,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:45:48,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:45:48,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:45:48,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:45:48,832 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:45:48,834 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:45:48,924 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:45:48,925 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:45:48,940 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:45:48,959 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:45:49,004 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:45:49,005 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:45:49,010 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:45:49,025 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:45:49,026 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:45:50,750 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 21:45:52,592 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:45:52,700 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:45:52,727 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 21:45:52,727 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 21:45:52,730 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 21:45:53,167 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 21:45:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 21:45:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:45:53,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:53,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:45:53,178 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:45:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 21:45:53,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:53,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557621408] [2019-12-27 21:45:53,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:53,479 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:45:53,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557621408] [2019-12-27 21:45:53,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:53,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:45:53,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2002301904] [2019-12-27 21:45:53,484 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:53,490 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:53,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:45:53,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:53,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:53,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:53,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:53,530 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 21:45:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:53,804 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 21:45:53,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:53,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:45:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:53,911 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 21:45:53,911 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 21:45:53,920 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:45:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 21:45:54,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 21:45:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 21:45:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 21:45:54,388 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 21:45:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:54,388 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 21:45:54,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 21:45:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:45:54,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:54,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:54,392 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:45:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 21:45:54,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:54,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574387932] [2019-12-27 21:45:54,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:54,514 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:45:54,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574387932] [2019-12-27 21:45:54,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:54,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:54,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1421474199] [2019-12-27 21:45:54,516 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:54,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:54,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:45:54,519 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:54,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:54,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:45:54,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:45:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:45:54,522 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 21:45:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:54,913 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-27 21:45:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:45:54,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:45:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:55,002 INFO L225 Difference]: With dead ends: 11318 [2019-12-27 21:45:55,003 INFO L226 Difference]: Without dead ends: 11311 [2019-12-27 21:45:55,004 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:45:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-27 21:45:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-27 21:45:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-27 21:45:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-27 21:45:55,517 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-27 21:45:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:55,518 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-27 21:45:55,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:45:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-27 21:45:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:45:55,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:55,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:55,524 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:45:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:55,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 21:45:55,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:55,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41450109] [2019-12-27 21:45:55,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:55,615 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:45:55,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41450109] [2019-12-27 21:45:55,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:55,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:55,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357777037] [2019-12-27 21:45:55,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:55,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:55,620 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:45:55,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:55,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:55,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:45:55,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:45:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:45:55,622 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-27 21:45:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:55,943 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-27 21:45:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:45:55,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 21:45:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:55,997 INFO L225 Difference]: With dead ends: 14191 [2019-12-27 21:45:55,997 INFO L226 Difference]: Without dead ends: 14191 [2019-12-27 21:45:55,998 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:45:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-27 21:45:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-27 21:45:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-27 21:45:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-27 21:45:57,034 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-27 21:45:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:57,035 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-27 21:45:57,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:45:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-27 21:45:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:45:57,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:57,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:57,039 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:45:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:57,040 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-27 21:45:57,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:57,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772145007] [2019-12-27 21:45:57,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:57,114 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:45:57,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772145007] [2019-12-27 21:45:57,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:57,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:45:57,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [857442988] [2019-12-27 21:45:57,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:57,118 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:57,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:45:57,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:57,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:57,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:45:57,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:57,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:45:57,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:45:57,123 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 3 states. [2019-12-27 21:45:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:57,233 INFO L93 Difference]: Finished difference Result 10482 states and 32382 transitions. [2019-12-27 21:45:57,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:45:57,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:45:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:57,258 INFO L225 Difference]: With dead ends: 10482 [2019-12-27 21:45:57,258 INFO L226 Difference]: Without dead ends: 10482 [2019-12-27 21:45:57,259 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:45:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10482 states. [2019-12-27 21:45:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10482 to 10402. [2019-12-27 21:45:57,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10402 states. [2019-12-27 21:45:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10402 states to 10402 states and 32150 transitions. [2019-12-27 21:45:57,638 INFO L78 Accepts]: Start accepts. Automaton has 10402 states and 32150 transitions. Word has length 16 [2019-12-27 21:45:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:57,638 INFO L462 AbstractCegarLoop]: Abstraction has 10402 states and 32150 transitions. [2019-12-27 21:45:57,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:45:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10402 states and 32150 transitions. [2019-12-27 21:45:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:45:57,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:57,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:57,642 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:45:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1689443989, now seen corresponding path program 1 times [2019-12-27 21:45:57,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:57,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879637236] [2019-12-27 21:45:57,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:57,704 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:45:57,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879637236] [2019-12-27 21:45:57,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:57,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:57,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1233579753] [2019-12-27 21:45:57,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:57,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:57,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:45:57,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:57,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:57,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:45:57,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:45:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:45:57,710 INFO L87 Difference]: Start difference. First operand 10402 states and 32150 transitions. Second operand 4 states. [2019-12-27 21:45:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:57,742 INFO L93 Difference]: Finished difference Result 2018 states and 4994 transitions. [2019-12-27 21:45:57,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:45:57,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:45:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:57,747 INFO L225 Difference]: With dead ends: 2018 [2019-12-27 21:45:57,747 INFO L226 Difference]: Without dead ends: 1434 [2019-12-27 21:45:57,747 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:45:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-12-27 21:45:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2019-12-27 21:45:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-12-27 21:45:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 3141 transitions. [2019-12-27 21:45:57,773 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 3141 transitions. Word has length 16 [2019-12-27 21:45:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:57,773 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 3141 transitions. [2019-12-27 21:45:57,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:45:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 3141 transitions. [2019-12-27 21:45:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:45:57,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:57,776 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:45:57,776 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:45:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 21:45:57,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:57,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218060904] [2019-12-27 21:45:57,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:57,910 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:45:57,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218060904] [2019-12-27 21:45:57,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:57,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:45:57,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2045400962] [2019-12-27 21:45:57,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:57,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:57,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:45:57,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:57,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:45:57,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:45:57,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:45:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:45:57,924 INFO L87 Difference]: Start difference. First operand 1434 states and 3141 transitions. Second operand 6 states. [2019-12-27 21:45:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:58,310 INFO L93 Difference]: Finished difference Result 2226 states and 4691 transitions. [2019-12-27 21:45:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:45:58,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:45:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:58,318 INFO L225 Difference]: With dead ends: 2226 [2019-12-27 21:45:58,318 INFO L226 Difference]: Without dead ends: 2173 [2019-12-27 21:45:58,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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:45:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-12-27 21:45:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1404. [2019-12-27 21:45:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-12-27 21:45:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 3075 transitions. [2019-12-27 21:45:58,348 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 3075 transitions. Word has length 25 [2019-12-27 21:45:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:58,349 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 3075 transitions. [2019-12-27 21:45:58,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:45:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 3075 transitions. [2019-12-27 21:45:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:45:58,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:58,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:45:58,351 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:45:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:58,352 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-27 21:45:58,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:58,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561053637] [2019-12-27 21:45:58,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:58,437 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:45:58,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561053637] [2019-12-27 21:45:58,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:58,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:45:58,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1462730395] [2019-12-27 21:45:58,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:58,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:58,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 21:45:58,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:58,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:45:58,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:45:58,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:58,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:45:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:45:58,507 INFO L87 Difference]: Start difference. First operand 1404 states and 3075 transitions. Second operand 6 states. [2019-12-27 21:45:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:58,557 INFO L93 Difference]: Finished difference Result 739 states and 1600 transitions. [2019-12-27 21:45:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:45:58,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:45:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:58,558 INFO L225 Difference]: With dead ends: 739 [2019-12-27 21:45:58,558 INFO L226 Difference]: Without dead ends: 677 [2019-12-27 21:45:58,559 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:45:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-27 21:45:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2019-12-27 21:45:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-27 21:45:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1465 transitions. [2019-12-27 21:45:58,629 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1465 transitions. Word has length 27 [2019-12-27 21:45:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:58,629 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1465 transitions. [2019-12-27 21:45:58,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:45:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1465 transitions. [2019-12-27 21:45:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:45:58,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:58,636 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:45:58,636 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:45:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1271151221, now seen corresponding path program 1 times [2019-12-27 21:45:58,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:58,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092970664] [2019-12-27 21:45:58,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:58,745 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:45:58,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092970664] [2019-12-27 21:45:58,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:58,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:45:58,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [624396599] [2019-12-27 21:45:58,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:58,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:58,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 106 transitions. [2019-12-27 21:45:58,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:58,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:45:58,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:45:58,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:45:58,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:45:58,885 INFO L87 Difference]: Start difference. First operand 677 states and 1465 transitions. Second operand 7 states. [2019-12-27 21:45:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:59,174 INFO L93 Difference]: Finished difference Result 2064 states and 4333 transitions. [2019-12-27 21:45:59,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:45:59,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 21:45:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:59,177 INFO L225 Difference]: With dead ends: 2064 [2019-12-27 21:45:59,177 INFO L226 Difference]: Without dead ends: 1442 [2019-12-27 21:45:59,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:45:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-12-27 21:45:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 741. [2019-12-27 21:45:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-27 21:45:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1602 transitions. [2019-12-27 21:45:59,195 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1602 transitions. Word has length 52 [2019-12-27 21:45:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:59,198 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1602 transitions. [2019-12-27 21:45:59,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:45:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1602 transitions. [2019-12-27 21:45:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:45:59,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:59,200 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:45:59,201 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:45:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash -196823289, now seen corresponding path program 2 times [2019-12-27 21:45:59,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:59,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044680513] [2019-12-27 21:45:59,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:59,310 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:45:59,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044680513] [2019-12-27 21:45:59,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:59,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:45:59,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606851420] [2019-12-27 21:45:59,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:59,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:59,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 108 transitions. [2019-12-27 21:45:59,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:59,393 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:45:59,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:45:59,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:45:59,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:45:59,395 INFO L87 Difference]: Start difference. First operand 741 states and 1602 transitions. Second operand 4 states. [2019-12-27 21:45:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:45:59,417 INFO L93 Difference]: Finished difference Result 1196 states and 2609 transitions. [2019-12-27 21:45:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:45:59,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 21:45:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:45:59,420 INFO L225 Difference]: With dead ends: 1196 [2019-12-27 21:45:59,420 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 21:45:59,421 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:45:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 21:45:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-27 21:45:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-27 21:45:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1092 transitions. [2019-12-27 21:45:59,431 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1092 transitions. Word has length 52 [2019-12-27 21:45:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:45:59,432 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1092 transitions. [2019-12-27 21:45:59,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:45:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1092 transitions. [2019-12-27 21:45:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:45:59,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:45:59,435 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:45:59,435 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:45:59,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:45:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1967696263, now seen corresponding path program 3 times [2019-12-27 21:45:59,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:45:59,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639353730] [2019-12-27 21:45:59,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:45:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:45:59,592 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:45:59,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639353730] [2019-12-27 21:45:59,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:45:59,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:45:59,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [605527866] [2019-12-27 21:45:59,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:45:59,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:45:59,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 125 transitions. [2019-12-27 21:45:59,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:45:59,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:45:59,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:45:59,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:45:59,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:45:59,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:45:59,838 INFO L87 Difference]: Start difference. First operand 500 states and 1092 transitions. Second operand 9 states. [2019-12-27 21:46:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:00,091 INFO L93 Difference]: Finished difference Result 992 states and 2078 transitions. [2019-12-27 21:46:00,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:46:00,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 21:46:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:00,093 INFO L225 Difference]: With dead ends: 992 [2019-12-27 21:46:00,093 INFO L226 Difference]: Without dead ends: 701 [2019-12-27 21:46:00,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:46:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-27 21:46:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 532. [2019-12-27 21:46:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-27 21:46:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1152 transitions. [2019-12-27 21:46:00,103 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1152 transitions. Word has length 52 [2019-12-27 21:46:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:00,103 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1152 transitions. [2019-12-27 21:46:00,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:46:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1152 transitions. [2019-12-27 21:46:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:46:00,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:00,105 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:46:00,106 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:46:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 689321111, now seen corresponding path program 4 times [2019-12-27 21:46:00,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:00,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079386971] [2019-12-27 21:46:00,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:00,196 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:46:00,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079386971] [2019-12-27 21:46:00,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:00,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:46:00,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [419152839] [2019-12-27 21:46:00,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:00,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:00,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 127 transitions. [2019-12-27 21:46:00,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:00,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:46:00,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:46:00,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:00,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:46:00,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:46:00,322 INFO L87 Difference]: Start difference. First operand 532 states and 1152 transitions. Second operand 7 states. [2019-12-27 21:46:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:01,321 INFO L93 Difference]: Finished difference Result 1228 states and 2591 transitions. [2019-12-27 21:46:01,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:46:01,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 21:46:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:01,323 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 21:46:01,323 INFO L226 Difference]: Without dead ends: 1204 [2019-12-27 21:46:01,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:46:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-12-27 21:46:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 797. [2019-12-27 21:46:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-27 21:46:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1733 transitions. [2019-12-27 21:46:01,339 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1733 transitions. Word has length 52 [2019-12-27 21:46:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:01,340 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1733 transitions. [2019-12-27 21:46:01,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:46:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1733 transitions. [2019-12-27 21:46:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:46:01,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:01,342 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:46:01,343 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:46:01,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1511703527, now seen corresponding path program 5 times [2019-12-27 21:46:01,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:01,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008341595] [2019-12-27 21:46:01,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:46:01,401 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:46:01,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008341595] [2019-12-27 21:46:01,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:46:01,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:46:01,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300913748] [2019-12-27 21:46:01,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:46:01,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:46:01,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 102 transitions. [2019-12-27 21:46:01,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:46:01,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:46:01,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:46:01,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:46:01,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:46:01,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:46:01,465 INFO L87 Difference]: Start difference. First operand 797 states and 1733 transitions. Second operand 3 states. [2019-12-27 21:46:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:46:01,516 INFO L93 Difference]: Finished difference Result 991 states and 2134 transitions. [2019-12-27 21:46:01,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:46:01,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:46:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:46:01,517 INFO L225 Difference]: With dead ends: 991 [2019-12-27 21:46:01,518 INFO L226 Difference]: Without dead ends: 991 [2019-12-27 21:46:01,518 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:46:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-27 21:46:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 780. [2019-12-27 21:46:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 21:46:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1696 transitions. [2019-12-27 21:46:01,531 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1696 transitions. Word has length 52 [2019-12-27 21:46:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:46:01,531 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1696 transitions. [2019-12-27 21:46:01,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:46:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1696 transitions. [2019-12-27 21:46:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:46:01,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:46:01,534 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:46:01,534 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:46:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:46:01,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 21:46:01,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:46:01,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616494039] [2019-12-27 21:46:01,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:46:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:46:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:46:01,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:46:01,635 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:46:01,639 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_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1547~0.base_24| 4)) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1547~0.base_24|) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (= |v_ULTIMATE.start_main_~#t1547~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_24| 1) |v_#valid_49|) (= 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_24|) 0) (= v_~main$tmp_guard1~0_15 0) (= 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) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_24|) |v_ULTIMATE.start_main_~#t1547~0.offset_19| 0)) |v_#memory_int_17|))) 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, ULTIMATE.start_main_~#t1547~0.offset=|v_ULTIMATE.start_main_~#t1547~0.offset_19|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_25|, #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|, ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_19|, ~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, ULTIMATE.start_main_~#t1547~0.base=|v_ULTIMATE.start_main_~#t1547~0.base_24|, ~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|, ~y~0=v_~y~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~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, ULTIMATE.start_main_~#t1547~0.offset, ULTIMATE.start_main_~#t1548~0.base, #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, ULTIMATE.start_main_~#t1548~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1547~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #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:46:01,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1548~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1548~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13|) |v_ULTIMATE.start_main_~#t1548~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1548~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1548~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 21:46:01,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~x~0_In268564392 ~__unbuffered_p0_EAX~0_Out268564392) (= ~y$r_buff0_thd1~0_In268564392 ~y$r_buff1_thd1~0_Out268564392) (= ~y$r_buff0_thd0~0_In268564392 ~y$r_buff1_thd0~0_Out268564392) (= ~y$r_buff0_thd1~0_Out268564392 1) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In268564392)) (= ~y$r_buff1_thd2~0_Out268564392 ~y$r_buff0_thd2~0_In268564392)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In268564392, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In268564392, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In268564392, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In268564392, ~x~0=~x~0_In268564392} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out268564392, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out268564392, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out268564392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In268564392, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out268564392, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In268564392, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In268564392, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out268564392, ~x~0=~x~0_In268564392} 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:46:01,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In200915442 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In200915442 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out200915442| ~y$w_buff0_used~0_In200915442) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out200915442| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In200915442, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In200915442} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out200915442|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In200915442, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In200915442} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:46:01,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-584491279 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-584491279| ~y$w_buff0_used~0_In-584491279) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-584491279| |P1Thread1of1ForFork1_#t~ite20_Out-584491279|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-584491279| |P1Thread1of1ForFork1_#t~ite21_Out-584491279|) (= |P1Thread1of1ForFork1_#t~ite20_Out-584491279| ~y$w_buff0_used~0_In-584491279) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-584491279 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-584491279 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-584491279 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-584491279 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-584491279, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584491279, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-584491279|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-584491279, ~weak$$choice2~0=~weak$$choice2~0_In-584491279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584491279} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-584491279, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584491279, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-584491279|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-584491279, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-584491279|, ~weak$$choice2~0=~weak$$choice2~0_In-584491279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584491279} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:46:01,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out2126145645| |P1Thread1of1ForFork1_#t~ite23_Out2126145645|)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2126145645 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2126145645 256) 0)) (.cse5 (= (mod ~y$r_buff1_thd2~0_In2126145645 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In2126145645 256))) (.cse0 (= (mod ~weak$$choice2~0_In2126145645 256) 0))) (or (let ((.cse4 (not .cse6))) (and .cse0 .cse1 (not .cse2) (or (not .cse3) .cse4) (= |P1Thread1of1ForFork1_#t~ite22_Out2126145645| 0) (= |P1Thread1of1ForFork1_#t~ite22_Out2126145645| |P1Thread1of1ForFork1_#t~ite23_Out2126145645|) (or (not .cse5) .cse4))) (and (= |P1Thread1of1ForFork1_#t~ite22_In2126145645| |P1Thread1of1ForFork1_#t~ite22_Out2126145645|) (or (and .cse0 .cse1 (= ~y$w_buff1_used~0_In2126145645 |P1Thread1of1ForFork1_#t~ite23_Out2126145645|) (or (and .cse6 .cse3) .cse2 (and .cse5 .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite24_Out2126145645| ~y$w_buff1_used~0_In2126145645) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In2126145645| |P1Thread1of1ForFork1_#t~ite23_Out2126145645|)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2126145645, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2126145645, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2126145645, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In2126145645|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In2126145645|, ~weak$$choice2~0=~weak$$choice2~0_In2126145645, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126145645} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2126145645, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2126145645, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2126145645, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out2126145645|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out2126145645|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out2126145645|, ~weak$$choice2~0=~weak$$choice2~0_In2126145645, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2126145645} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 21:46:01,650 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:46:01,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1476021156 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1476021156 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1476021156 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1476021156 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1476021156| ~y$w_buff1_used~0_In-1476021156) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1476021156|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1476021156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1476021156, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1476021156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1476021156} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1476021156|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1476021156, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1476021156, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1476021156, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1476021156} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:46:01,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-112640620 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-112640620 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-112640620 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out-112640620 ~y$r_buff0_thd1~0_In-112640620) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-112640620, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-112640620} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-112640620, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-112640620|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-112640620} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:46:01,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1670683361 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1670683361 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1670683361| |P1Thread1of1ForFork1_#t~ite30_Out-1670683361|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-1670683361 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-1670683361 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1670683361 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In-1670683361| |P1Thread1of1ForFork1_#t~ite28_Out-1670683361|) (or (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-1670683361| ~y$r_buff1_thd2~0_In-1670683361) (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-1670683361| |P1Thread1of1ForFork1_#t~ite29_Out-1670683361|) (not .cse1) (= ~y$r_buff1_thd2~0_In-1670683361 |P1Thread1of1ForFork1_#t~ite30_Out-1670683361|)))) (let ((.cse6 (not .cse3))) (and (or .cse6 (not .cse2)) (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite29_Out-1670683361| |P1Thread1of1ForFork1_#t~ite28_Out-1670683361|) .cse0 .cse1 (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1670683361|) (not .cse5))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1670683361, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1670683361|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1670683361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1670683361, ~weak$$choice2~0=~weak$$choice2~0_In-1670683361, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1670683361|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1670683361} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1670683361, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1670683361|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1670683361|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1670683361, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1670683361, ~weak$$choice2~0=~weak$$choice2~0_In-1670683361, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1670683361|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1670683361} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:46:01,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In650760118 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In650760118 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In650760118 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In650760118 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out650760118|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In650760118 |P0Thread1of1ForFork0_#t~ite8_Out650760118|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In650760118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650760118, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In650760118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650760118} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In650760118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650760118, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out650760118|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In650760118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650760118} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:46:01,653 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:46:01,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1187791227 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1187791227 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out1187791227| ~y~0_In1187791227) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1187791227| ~y$w_buff1~0_In1187791227)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1187791227, ~y$w_buff1~0=~y$w_buff1~0_In1187791227, ~y~0=~y~0_In1187791227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1187791227} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1187791227, ~y$w_buff1~0=~y$w_buff1~0_In1187791227, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1187791227|, ~y~0=~y~0_In1187791227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1187791227} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:46:01,654 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:46:01,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1436668505 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1436668505 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1436668505| ~y$w_buff0_used~0_In1436668505) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1436668505| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1436668505, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1436668505} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1436668505, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1436668505, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1436668505|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:46:01,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-83716857 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-83716857 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-83716857 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-83716857 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-83716857| ~y$w_buff1_used~0_In-83716857)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-83716857| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-83716857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-83716857, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-83716857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83716857} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-83716857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-83716857, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-83716857, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-83716857|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-83716857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:46:01,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1758421054 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1758421054 256)))) (or (and (= ~y$r_buff0_thd2~0_In1758421054 |P1Thread1of1ForFork1_#t~ite36_Out1758421054|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1758421054|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1758421054, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1758421054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1758421054, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1758421054, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1758421054|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:46:01,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1688548985 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1688548985 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1688548985 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1688548985 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1688548985|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1688548985 |P1Thread1of1ForFork1_#t~ite37_Out1688548985|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1688548985, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1688548985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1688548985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1688548985} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1688548985, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1688548985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1688548985, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1688548985|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1688548985} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:46:01,656 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:46:01,657 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:46:01,657 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:46:01,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1119554111 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1119554111 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1119554111| ~y~0_In-1119554111) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1119554111| ~y$w_buff1~0_In-1119554111)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1119554111, ~y~0=~y~0_In-1119554111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1119554111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1119554111} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1119554111|, ~y$w_buff1~0=~y$w_buff1~0_In-1119554111, ~y~0=~y~0_In-1119554111, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1119554111, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1119554111} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:46:01,658 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:46:01,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In533832521 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In533832521 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out533832521| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In533832521 |ULTIMATE.start_main_#t~ite42_Out533832521|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In533832521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In533832521} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In533832521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In533832521, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out533832521|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:46:01,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1840788976 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1840788976 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1840788976 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1840788976 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1840788976| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1840788976| ~y$w_buff1_used~0_In-1840788976) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1840788976, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1840788976, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1840788976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1840788976} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1840788976, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1840788976, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1840788976|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1840788976, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1840788976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:46:01,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1189918376 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1189918376 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1189918376| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1189918376| ~y$r_buff0_thd0~0_In1189918376) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1189918376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1189918376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1189918376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1189918376, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1189918376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:46:01,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1894486775 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1894486775 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1894486775 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1894486775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1894486775|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out-1894486775| ~y$r_buff1_thd0~0_In-1894486775)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1894486775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1894486775, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1894486775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1894486775} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1894486775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1894486775, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1894486775, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1894486775|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1894486775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:46:01,661 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:46:01,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:46:01 BasicIcfg [2019-12-27 21:46:01,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:46:01,717 INFO L168 Benchmark]: Toolchain (without parser) took 14686.49 ms. Allocated memory was 140.0 MB in the beginning and 686.3 MB in the end (delta: 546.3 MB). Free memory was 102.5 MB in the beginning and 360.0 MB in the end (delta: -257.4 MB). Peak memory consumption was 288.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:01,718 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 21:46:01,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.39 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 158.4 MB in the end (delta: -56.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:01,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.06 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:01,720 INFO L168 Benchmark]: Boogie Preprocessor took 41.93 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:01,721 INFO L168 Benchmark]: RCFGBuilder took 752.68 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 109.0 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:01,721 INFO L168 Benchmark]: TraceAbstraction took 13081.89 ms. Allocated memory was 203.9 MB in the beginning and 686.3 MB in the end (delta: 482.3 MB). Free memory was 109.0 MB in the beginning and 360.0 MB in the end (delta: -250.9 MB). Peak memory consumption was 231.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:46:01,725 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.20 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.39 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 158.4 MB in the end (delta: -56.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.06 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.93 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 752.68 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 109.0 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13081.89 ms. Allocated memory was 203.9 MB in the beginning and 686.3 MB in the end (delta: 482.3 MB). Free memory was 109.0 MB in the beginning and 360.0 MB in the end (delta: -250.9 MB). Peak memory consumption was 231.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 147 ProgramPointsBefore, 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(&t1547, ((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(&t1548, ((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: 12.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1511 SDtfs, 1717 SDslu, 3378 SDs, 0 SdLazy, 1740 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 29 SyntacticMatches, 15 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 6656 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 41838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...