/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:07:00,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:07:00,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:07:00,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:07:00,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:07:00,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:07:00,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:07:00,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:07:00,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:07:00,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:07:00,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:07:00,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:07:00,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:07:00,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:07:00,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:07:00,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:07:00,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:07:00,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:07:00,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:07:00,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:07:00,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:07:00,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:07:00,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:07:00,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:07:00,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:07:00,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:07:00,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:07:00,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:07:00,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:07:00,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:07:00,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:07:00,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:07:00,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:07:00,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:07:00,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:07:00,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:07:00,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:07:00,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:07:00,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:07:00,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:07:00,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:07:00,832 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.epf [2019-12-18 23:07:00,864 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:07:00,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:07:00,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:07:00,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:07:00,867 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:07:00,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:07:00,867 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:07:00,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:07:00,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:07:00,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:07:00,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:07:00,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:07:00,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:07:00,868 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:07:00,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:07:00,870 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:07:00,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:07:00,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:07:00,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:07:00,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:07:00,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:07:00,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:07:00,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:07:00,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:07:00,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:07:00,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:07:00,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:07:00,872 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:07:00,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:07:00,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:07:01,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:07:01,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:07:01,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:07:01,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:07:01,160 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:07:01,161 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i [2019-12-18 23:07:01,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02991ef1/83da50e3a7eb4c7da6b7c8e9d9fdea42/FLAG4399fca92 [2019-12-18 23:07:01,856 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:07:01,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_rmo.oepc.i [2019-12-18 23:07:01,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02991ef1/83da50e3a7eb4c7da6b7c8e9d9fdea42/FLAG4399fca92 [2019-12-18 23:07:02,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02991ef1/83da50e3a7eb4c7da6b7c8e9d9fdea42 [2019-12-18 23:07:02,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:07:02,102 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:07:02,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:07:02,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:07:02,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:07:02,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:02,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02, skipping insertion in model container [2019-12-18 23:07:02,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:02,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:07:02,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:07:02,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:07:02,774 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:07:02,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:07:02,911 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:07:02,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02 WrapperNode [2019-12-18 23:07:02,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:07:02,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:07:02,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:07:02,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:07:02,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:02,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:02,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:07:02,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:07:02,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:07:02,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:07:02,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:02,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:02,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:02,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:03,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:03,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:03,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (1/1) ... [2019-12-18 23:07:03,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:07:03,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:07:03,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:07:03,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:07:03,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (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-18 23:07:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:07:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:07:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:07:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:07:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:07:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:07:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:07:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:07:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 23:07:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 23:07:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:07:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:07:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:07:03,088 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:07:03,792 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:07:03,793 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:07:03,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:07:03 BoogieIcfgContainer [2019-12-18 23:07:03,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:07:03,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:07:03,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:07:03,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:07:03,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:07:02" (1/3) ... [2019-12-18 23:07:03,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@941ee3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:07:03, skipping insertion in model container [2019-12-18 23:07:03,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:07:02" (2/3) ... [2019-12-18 23:07:03,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@941ee3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:07:03, skipping insertion in model container [2019-12-18 23:07:03,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:07:03" (3/3) ... [2019-12-18 23:07:03,803 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_rmo.oepc.i [2019-12-18 23:07:03,814 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:07:03,814 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:07:03,822 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:07:03,822 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:07:03,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,861 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,861 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,889 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,889 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,889 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,890 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,890 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,928 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,929 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,929 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:07:03,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:07:03,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:07:03,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:07:03,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:07:03,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:07:03,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:07:03,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:07:03,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:07:03,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:07:03,984 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-18 23:07:03,986 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 23:07:04,058 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 23:07:04,058 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:07:04,072 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 23:07:04,091 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 23:07:04,164 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 23:07:04,164 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:07:04,172 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 23:07:04,188 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 23:07:04,189 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:07:07,342 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 23:07:07,745 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 23:07:07,864 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 23:07:07,890 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48572 [2019-12-18 23:07:07,891 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 23:07:07,895 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-18 23:07:08,767 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14526 states. [2019-12-18 23:07:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 14526 states. [2019-12-18 23:07:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 23:07:08,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:08,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:07:08,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:08,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1566852802, now seen corresponding path program 1 times [2019-12-18 23:07:08,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:08,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713535233] [2019-12-18 23:07:08,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:09,033 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-18 23:07:09,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713535233] [2019-12-18 23:07:09,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:09,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:07:09,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384645048] [2019-12-18 23:07:09,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:07:09,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:07:09,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:09,064 INFO L87 Difference]: Start difference. First operand 14526 states. Second operand 3 states. [2019-12-18 23:07:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:09,446 INFO L93 Difference]: Finished difference Result 13996 states and 53893 transitions. [2019-12-18 23:07:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:07:09,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 23:07:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:09,648 INFO L225 Difference]: With dead ends: 13996 [2019-12-18 23:07:09,649 INFO L226 Difference]: Without dead ends: 13156 [2019-12-18 23:07:09,650 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-18 23:07:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13156 states. [2019-12-18 23:07:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13156 to 13156. [2019-12-18 23:07:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13156 states. [2019-12-18 23:07:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13156 states to 13156 states and 50585 transitions. [2019-12-18 23:07:10,408 INFO L78 Accepts]: Start accepts. Automaton has 13156 states and 50585 transitions. Word has length 7 [2019-12-18 23:07:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:10,409 INFO L462 AbstractCegarLoop]: Abstraction has 13156 states and 50585 transitions. [2019-12-18 23:07:10,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:07:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 13156 states and 50585 transitions. [2019-12-18 23:07:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:07:10,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:10,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:07:10,415 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1632341996, now seen corresponding path program 1 times [2019-12-18 23:07:10,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:10,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392937746] [2019-12-18 23:07:10,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:10,565 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-18 23:07:10,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392937746] [2019-12-18 23:07:10,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:10,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:07:10,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037208272] [2019-12-18 23:07:10,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:07:10,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:10,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:07:10,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:07:10,569 INFO L87 Difference]: Start difference. First operand 13156 states and 50585 transitions. Second operand 4 states. [2019-12-18 23:07:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:11,633 INFO L93 Difference]: Finished difference Result 19646 states and 72584 transitions. [2019-12-18 23:07:11,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:07:11,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 23:07:11,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:11,723 INFO L225 Difference]: With dead ends: 19646 [2019-12-18 23:07:11,723 INFO L226 Difference]: Without dead ends: 19616 [2019-12-18 23:07:11,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:07:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19616 states. [2019-12-18 23:07:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19616 to 17838. [2019-12-18 23:07:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17838 states. [2019-12-18 23:07:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 66884 transitions. [2019-12-18 23:07:12,491 INFO L78 Accepts]: Start accepts. Automaton has 17838 states and 66884 transitions. Word has length 13 [2019-12-18 23:07:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:12,492 INFO L462 AbstractCegarLoop]: Abstraction has 17838 states and 66884 transitions. [2019-12-18 23:07:12,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:07:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 17838 states and 66884 transitions. [2019-12-18 23:07:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 23:07:12,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:12,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:07:12,499 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1674715579, now seen corresponding path program 1 times [2019-12-18 23:07:12,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:12,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155888555] [2019-12-18 23:07:12,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:07:12,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155888555] [2019-12-18 23:07:12,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:12,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:07:12,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191635855] [2019-12-18 23:07:12,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:07:12,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:07:12,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:07:12,601 INFO L87 Difference]: Start difference. First operand 17838 states and 66884 transitions. Second operand 5 states. [2019-12-18 23:07:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:13,197 INFO L93 Difference]: Finished difference Result 24700 states and 90839 transitions. [2019-12-18 23:07:13,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:07:13,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 23:07:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:13,318 INFO L225 Difference]: With dead ends: 24700 [2019-12-18 23:07:13,318 INFO L226 Difference]: Without dead ends: 24662 [2019-12-18 23:07:13,319 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-18 23:07:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24662 states. [2019-12-18 23:07:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24662 to 21030. [2019-12-18 23:07:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21030 states. [2019-12-18 23:07:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 78424 transitions. [2019-12-18 23:07:14,171 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 78424 transitions. Word has length 16 [2019-12-18 23:07:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:14,172 INFO L462 AbstractCegarLoop]: Abstraction has 21030 states and 78424 transitions. [2019-12-18 23:07:14,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:07:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 78424 transitions. [2019-12-18 23:07:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:07:14,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:14,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:07:14,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:14,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:14,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1310988069, now seen corresponding path program 1 times [2019-12-18 23:07:14,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:14,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725129078] [2019-12-18 23:07:14,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:14,232 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-18 23:07:14,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725129078] [2019-12-18 23:07:14,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:14,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:07:14,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092954749] [2019-12-18 23:07:14,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:07:14,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:14,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:07:14,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:14,237 INFO L87 Difference]: Start difference. First operand 21030 states and 78424 transitions. Second operand 3 states. [2019-12-18 23:07:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:14,328 INFO L93 Difference]: Finished difference Result 20886 states and 77807 transitions. [2019-12-18 23:07:14,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:07:14,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 23:07:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:14,411 INFO L225 Difference]: With dead ends: 20886 [2019-12-18 23:07:14,411 INFO L226 Difference]: Without dead ends: 20886 [2019-12-18 23:07:14,412 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-18 23:07:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20886 states. [2019-12-18 23:07:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20886 to 20886. [2019-12-18 23:07:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-12-18 23:07:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 77807 transitions. [2019-12-18 23:07:16,239 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 77807 transitions. Word has length 18 [2019-12-18 23:07:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:16,239 INFO L462 AbstractCegarLoop]: Abstraction has 20886 states and 77807 transitions. [2019-12-18 23:07:16,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:07:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 77807 transitions. [2019-12-18 23:07:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:07:16,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:16,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:07:16,254 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash 718938577, now seen corresponding path program 1 times [2019-12-18 23:07:16,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:16,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248143432] [2019-12-18 23:07:16,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:16,333 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-18 23:07:16,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248143432] [2019-12-18 23:07:16,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:16,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:07:16,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188518563] [2019-12-18 23:07:16,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:07:16,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:07:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:07:16,336 INFO L87 Difference]: Start difference. First operand 20886 states and 77807 transitions. Second operand 5 states. [2019-12-18 23:07:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:16,408 INFO L93 Difference]: Finished difference Result 3511 states and 10634 transitions. [2019-12-18 23:07:16,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:07:16,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 23:07:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:16,415 INFO L225 Difference]: With dead ends: 3511 [2019-12-18 23:07:16,415 INFO L226 Difference]: Without dead ends: 2287 [2019-12-18 23:07:16,416 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-18 23:07:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2019-12-18 23:07:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2287. [2019-12-18 23:07:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-12-18 23:07:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 6105 transitions. [2019-12-18 23:07:16,457 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 6105 transitions. Word has length 19 [2019-12-18 23:07:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:16,457 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 6105 transitions. [2019-12-18 23:07:16,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:07:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 6105 transitions. [2019-12-18 23:07:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 23:07:16,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:16,463 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] [2019-12-18 23:07:16,463 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash -990981209, now seen corresponding path program 1 times [2019-12-18 23:07:16,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:16,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483963624] [2019-12-18 23:07:16,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:16,515 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-18 23:07:16,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483963624] [2019-12-18 23:07:16,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:16,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:07:16,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078208637] [2019-12-18 23:07:16,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:07:16,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:07:16,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:16,517 INFO L87 Difference]: Start difference. First operand 2287 states and 6105 transitions. Second operand 3 states. [2019-12-18 23:07:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:16,537 INFO L93 Difference]: Finished difference Result 3617 states and 9326 transitions. [2019-12-18 23:07:16,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:07:16,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 23:07:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:16,545 INFO L225 Difference]: With dead ends: 3617 [2019-12-18 23:07:16,545 INFO L226 Difference]: Without dead ends: 2309 [2019-12-18 23:07:16,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-12-18 23:07:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2277. [2019-12-18 23:07:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-12-18 23:07:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 6009 transitions. [2019-12-18 23:07:16,736 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 6009 transitions. Word has length 29 [2019-12-18 23:07:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:16,736 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 6009 transitions. [2019-12-18 23:07:16,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:07:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 6009 transitions. [2019-12-18 23:07:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 23:07:16,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:16,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:07:16,742 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -322199084, now seen corresponding path program 1 times [2019-12-18 23:07:16,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:16,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027927202] [2019-12-18 23:07:16,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:16,791 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-18 23:07:16,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027927202] [2019-12-18 23:07:16,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:16,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:07:16,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734723742] [2019-12-18 23:07:16,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:07:16,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:16,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:07:16,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:16,794 INFO L87 Difference]: Start difference. First operand 2277 states and 6009 transitions. Second operand 3 states. [2019-12-18 23:07:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:16,846 INFO L93 Difference]: Finished difference Result 3264 states and 8342 transitions. [2019-12-18 23:07:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:07:16,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 23:07:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:16,852 INFO L225 Difference]: With dead ends: 3264 [2019-12-18 23:07:16,852 INFO L226 Difference]: Without dead ends: 3264 [2019-12-18 23:07:16,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2019-12-18 23:07:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 2490. [2019-12-18 23:07:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2019-12-18 23:07:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 6432 transitions. [2019-12-18 23:07:16,901 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 6432 transitions. Word has length 29 [2019-12-18 23:07:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:16,901 INFO L462 AbstractCegarLoop]: Abstraction has 2490 states and 6432 transitions. [2019-12-18 23:07:16,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:07:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 6432 transitions. [2019-12-18 23:07:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 23:07:16,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:16,907 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] [2019-12-18 23:07:16,907 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1477101190, now seen corresponding path program 1 times [2019-12-18 23:07:16,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:16,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279263429] [2019-12-18 23:07:16,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:17,060 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-18 23:07:17,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279263429] [2019-12-18 23:07:17,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:17,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:07:17,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988690265] [2019-12-18 23:07:17,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:07:17,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:07:17,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:07:17,062 INFO L87 Difference]: Start difference. First operand 2490 states and 6432 transitions. Second operand 6 states. [2019-12-18 23:07:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:17,436 INFO L93 Difference]: Finished difference Result 3452 states and 8642 transitions. [2019-12-18 23:07:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 23:07:17,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 23:07:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:17,444 INFO L225 Difference]: With dead ends: 3452 [2019-12-18 23:07:17,445 INFO L226 Difference]: Without dead ends: 3448 [2019-12-18 23:07:17,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 23:07:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2019-12-18 23:07:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 2534. [2019-12-18 23:07:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-18 23:07:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 6521 transitions. [2019-12-18 23:07:17,494 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 6521 transitions. Word has length 29 [2019-12-18 23:07:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:17,495 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 6521 transitions. [2019-12-18 23:07:17,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:07:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 6521 transitions. [2019-12-18 23:07:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 23:07:17,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:17,502 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] [2019-12-18 23:07:17,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash 806369611, now seen corresponding path program 2 times [2019-12-18 23:07:17,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:17,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965201606] [2019-12-18 23:07:17,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:17,624 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-18 23:07:17,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965201606] [2019-12-18 23:07:17,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:17,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:07:17,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107815270] [2019-12-18 23:07:17,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:07:17,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:07:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:07:17,626 INFO L87 Difference]: Start difference. First operand 2534 states and 6521 transitions. Second operand 5 states. [2019-12-18 23:07:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:18,062 INFO L93 Difference]: Finished difference Result 3671 states and 9368 transitions. [2019-12-18 23:07:18,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:07:18,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 23:07:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:18,067 INFO L225 Difference]: With dead ends: 3671 [2019-12-18 23:07:18,068 INFO L226 Difference]: Without dead ends: 3671 [2019-12-18 23:07:18,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:07:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-12-18 23:07:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3183. [2019-12-18 23:07:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-18 23:07:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 8205 transitions. [2019-12-18 23:07:18,126 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 8205 transitions. Word has length 29 [2019-12-18 23:07:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:18,126 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 8205 transitions. [2019-12-18 23:07:18,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:07:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 8205 transitions. [2019-12-18 23:07:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 23:07:18,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:18,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:07:18,134 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1983062445, now seen corresponding path program 1 times [2019-12-18 23:07:18,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:18,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382277220] [2019-12-18 23:07:18,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:18,219 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-18 23:07:18,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382277220] [2019-12-18 23:07:18,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:18,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:07:18,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156415699] [2019-12-18 23:07:18,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:07:18,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:07:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:07:18,221 INFO L87 Difference]: Start difference. First operand 3183 states and 8205 transitions. Second operand 6 states. [2019-12-18 23:07:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:18,311 INFO L93 Difference]: Finished difference Result 2227 states and 5795 transitions. [2019-12-18 23:07:18,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:07:18,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-18 23:07:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:18,315 INFO L225 Difference]: With dead ends: 2227 [2019-12-18 23:07:18,315 INFO L226 Difference]: Without dead ends: 1951 [2019-12-18 23:07:18,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:07:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2019-12-18 23:07:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1747. [2019-12-18 23:07:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-12-18 23:07:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 4610 transitions. [2019-12-18 23:07:18,346 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 4610 transitions. Word has length 30 [2019-12-18 23:07:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:18,347 INFO L462 AbstractCegarLoop]: Abstraction has 1747 states and 4610 transitions. [2019-12-18 23:07:18,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:07:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 4610 transitions. [2019-12-18 23:07:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 23:07:18,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:18,353 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] [2019-12-18 23:07:18,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash 583125687, now seen corresponding path program 1 times [2019-12-18 23:07:18,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:18,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370823896] [2019-12-18 23:07:18,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:18,414 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-18 23:07:18,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370823896] [2019-12-18 23:07:18,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:18,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:07:18,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27477022] [2019-12-18 23:07:18,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:07:18,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:18,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:07:18,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:18,416 INFO L87 Difference]: Start difference. First operand 1747 states and 4610 transitions. Second operand 3 states. [2019-12-18 23:07:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:18,457 INFO L93 Difference]: Finished difference Result 2053 states and 5201 transitions. [2019-12-18 23:07:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:07:18,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 23:07:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:18,461 INFO L225 Difference]: With dead ends: 2053 [2019-12-18 23:07:18,461 INFO L226 Difference]: Without dead ends: 2053 [2019-12-18 23:07:18,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-18 23:07:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1769. [2019-12-18 23:07:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2019-12-18 23:07:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 4543 transitions. [2019-12-18 23:07:18,612 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 4543 transitions. Word has length 44 [2019-12-18 23:07:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:18,612 INFO L462 AbstractCegarLoop]: Abstraction has 1769 states and 4543 transitions. [2019-12-18 23:07:18,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:07:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 4543 transitions. [2019-12-18 23:07:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 23:07:18,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:18,617 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] [2019-12-18 23:07:18,618 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:18,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:18,618 INFO L82 PathProgramCache]: Analyzing trace with hash -652505403, now seen corresponding path program 1 times [2019-12-18 23:07:18,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:18,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075288130] [2019-12-18 23:07:18,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:18,691 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-18 23:07:18,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075288130] [2019-12-18 23:07:18,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:18,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:07:18,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718560301] [2019-12-18 23:07:18,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:07:18,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:18,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:07:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:07:18,693 INFO L87 Difference]: Start difference. First operand 1769 states and 4543 transitions. Second operand 7 states. [2019-12-18 23:07:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:18,935 INFO L93 Difference]: Finished difference Result 4558 states and 11512 transitions. [2019-12-18 23:07:18,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:07:18,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 23:07:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:18,939 INFO L225 Difference]: With dead ends: 4558 [2019-12-18 23:07:18,940 INFO L226 Difference]: Without dead ends: 2920 [2019-12-18 23:07:18,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:07:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2019-12-18 23:07:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1870. [2019-12-18 23:07:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2019-12-18 23:07:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 4768 transitions. [2019-12-18 23:07:18,982 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 4768 transitions. Word has length 44 [2019-12-18 23:07:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:18,982 INFO L462 AbstractCegarLoop]: Abstraction has 1870 states and 4768 transitions. [2019-12-18 23:07:18,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:07:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 4768 transitions. [2019-12-18 23:07:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 23:07:18,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:18,987 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] [2019-12-18 23:07:18,987 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:18,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 245120113, now seen corresponding path program 2 times [2019-12-18 23:07:18,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:18,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410508160] [2019-12-18 23:07:18,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:19,127 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-18 23:07:19,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410508160] [2019-12-18 23:07:19,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:19,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:07:19,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933979945] [2019-12-18 23:07:19,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:07:19,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:07:19,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:07:19,133 INFO L87 Difference]: Start difference. First operand 1870 states and 4768 transitions. Second operand 8 states. [2019-12-18 23:07:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:19,855 INFO L93 Difference]: Finished difference Result 2928 states and 7113 transitions. [2019-12-18 23:07:19,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:07:19,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-18 23:07:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:19,861 INFO L225 Difference]: With dead ends: 2928 [2019-12-18 23:07:19,861 INFO L226 Difference]: Without dead ends: 2928 [2019-12-18 23:07:19,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:07:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2019-12-18 23:07:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1612. [2019-12-18 23:07:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-12-18 23:07:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3977 transitions. [2019-12-18 23:07:19,888 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 3977 transitions. Word has length 44 [2019-12-18 23:07:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:19,888 INFO L462 AbstractCegarLoop]: Abstraction has 1612 states and 3977 transitions. [2019-12-18 23:07:19,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:07:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 3977 transitions. [2019-12-18 23:07:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 23:07:19,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:19,892 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] [2019-12-18 23:07:19,892 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash 32251683, now seen corresponding path program 3 times [2019-12-18 23:07:19,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:19,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725920719] [2019-12-18 23:07:19,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:07:19,955 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-18 23:07:19,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725920719] [2019-12-18 23:07:19,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:07:19,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:07:19,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925062756] [2019-12-18 23:07:19,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:07:19,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:07:19,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:07:19,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:07:19,957 INFO L87 Difference]: Start difference. First operand 1612 states and 3977 transitions. Second operand 3 states. [2019-12-18 23:07:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:07:19,971 INFO L93 Difference]: Finished difference Result 1610 states and 3972 transitions. [2019-12-18 23:07:19,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:07:19,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 23:07:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:07:19,974 INFO L225 Difference]: With dead ends: 1610 [2019-12-18 23:07:19,974 INFO L226 Difference]: Without dead ends: 1610 [2019-12-18 23:07:19,975 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-18 23:07:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-12-18 23:07:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1374. [2019-12-18 23:07:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-18 23:07:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3430 transitions. [2019-12-18 23:07:19,998 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 3430 transitions. Word has length 44 [2019-12-18 23:07:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:07:19,998 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 3430 transitions. [2019-12-18 23:07:19,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:07:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 3430 transitions. [2019-12-18 23:07:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 23:07:20,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:07:20,002 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] [2019-12-18 23:07:20,003 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:07:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:07:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2093039597, now seen corresponding path program 1 times [2019-12-18 23:07:20,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:07:20,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274625588] [2019-12-18 23:07:20,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:07:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:07:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:07:20,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:07:20,102 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:07:20,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~y~0_23 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_27|)) (= 0 v_~y$w_buff1~0_22) (= v_~main$tmp_guard0~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t2589~0.offset_21|) (= 0 v_~y$flush_delayed~0_14) (< 0 |v_#StackHeapBarrier_17|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2589~0.base_27| 1) |v_#valid_60|) (= v_~y$r_buff0_thd2~0_67 0) (= 0 v_~y$r_buff1_thd2~0_39) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff1_thd1~0_8 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2589~0.base_27|) |v_ULTIMATE.start_main_~#t2589~0.offset_21| 0)) |v_#memory_int_23|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2589~0.base_27| 4)) (= 0 v_~weak$$choice2~0_33) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0_used~0_94) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff1_used~0_55 0) (= v_~y$r_buff0_thd3~0_27 0) (= 0 v_~__unbuffered_cnt~0_18) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2589~0.base_27|) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff1_thd3~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2589~0.base=|v_ULTIMATE.start_main_~#t2589~0.base_27|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ~y$w_buff1~0=v_~y$w_buff1~0_22, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2589~0.offset=|v_ULTIMATE.start_main_~#t2589~0.offset_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_16|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y~0=v_~y~0_23, ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2591~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2589~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2589~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2591~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2590~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:07:20,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L814-1-->L816: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2590~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2590~0.base_10|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2590~0.offset_9| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2590~0.base_10| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2590~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2590~0.base_10|) |v_ULTIMATE.start_main_~#t2590~0.offset_9| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2590~0.offset=|v_ULTIMATE.start_main_~#t2590~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2590~0.base=|v_ULTIMATE.start_main_~#t2590~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2590~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2590~0.base] because there is no mapped edge [2019-12-18 23:07:20,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2591~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2591~0.base_11|) |v_ULTIMATE.start_main_~#t2591~0.offset_10| 2))) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2591~0.offset_10| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2591~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2591~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2591~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2591~0.base=|v_ULTIMATE.start_main_~#t2591~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2591~0.offset=|v_ULTIMATE.start_main_~#t2591~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2591~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2591~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 23:07:20,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0~0_14) (= v_~y$w_buff1_used~0_40 v_~y$w_buff0_used~0_67) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_13) (= 1 v_~y$w_buff0_used~0_66) (= 1 |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~y$w_buff1_used~0_40 256)) (= v_P2Thread1of1ForFork2_~arg.base_4 |v_P2Thread1of1ForFork2_#in~arg.base_4|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_4| v_P2Thread1of1ForFork2_~arg.offset_4) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_13, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_4, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_4, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_40} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:07:20,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] P0ENTRY-->P0EXIT: Formula: (and (= 2 v_~z~0_9) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_9, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 23:07:20,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-52595865 256) 0))) (or (and (= ~y$w_buff0~0_In-52595865 |P1Thread1of1ForFork1_#t~ite9_Out-52595865|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-52595865| |P1Thread1of1ForFork1_#t~ite8_Out-52595865|)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out-52595865| |P1Thread1of1ForFork1_#t~ite9_Out-52595865|) (= |P1Thread1of1ForFork1_#t~ite8_Out-52595865| ~y$w_buff0~0_In-52595865) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-52595865 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-52595865 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-52595865 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-52595865 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-52595865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-52595865, ~y$w_buff0~0=~y$w_buff0~0_In-52595865, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-52595865, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-52595865|, ~weak$$choice2~0=~weak$$choice2~0_In-52595865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-52595865} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-52595865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-52595865, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-52595865|, ~y$w_buff0~0=~y$w_buff0~0_In-52595865, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-52595865, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-52595865|, ~weak$$choice2~0=~weak$$choice2~0_In-52595865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-52595865} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 23:07:20,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-159935090 256)))) (or (and (= ~y$w_buff0_used~0_In-159935090 |P1Thread1of1ForFork1_#t~ite14_Out-159935090|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-159935090 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-159935090 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-159935090 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-159935090 256)))) (= |P1Thread1of1ForFork1_#t~ite14_Out-159935090| |P1Thread1of1ForFork1_#t~ite15_Out-159935090|)) (and (= ~y$w_buff0_used~0_In-159935090 |P1Thread1of1ForFork1_#t~ite15_Out-159935090|) (= |P1Thread1of1ForFork1_#t~ite14_In-159935090| |P1Thread1of1ForFork1_#t~ite14_Out-159935090|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-159935090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159935090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-159935090, ~weak$$choice2~0=~weak$$choice2~0_In-159935090, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-159935090|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159935090} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-159935090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-159935090, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-159935090, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-159935090|, ~weak$$choice2~0=~weak$$choice2~0_In-159935090, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-159935090|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-159935090} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 23:07:20,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd2~0_43 v_~y$r_buff0_thd2~0_42)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_10|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 23:07:20,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1214012457 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1214012457 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1214012457| ~y$w_buff0_used~0_In1214012457)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1214012457| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1214012457, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1214012457} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1214012457, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1214012457, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1214012457|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 23:07:20,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->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) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 23:07:20,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1031590977 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1031590977 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1031590977 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1031590977 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out1031590977|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1031590977 |P2Thread1of1ForFork2_#t~ite29_Out1031590977|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1031590977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1031590977, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1031590977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1031590977} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1031590977, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1031590977, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1031590977, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1031590977|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1031590977} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 23:07:20,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-325520211 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-325520211 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-325520211 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out-325520211 ~y$r_buff0_thd3~0_In-325520211) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-325520211, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-325520211} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-325520211, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-325520211|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-325520211} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 23:07:20,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1716672360 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1716672360 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1716672360 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1716672360 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out1716672360| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite31_Out1716672360| ~y$r_buff1_thd3~0_In1716672360) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1716672360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1716672360, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1716672360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716672360} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1716672360, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1716672360, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1716672360|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1716672360, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1716672360} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 23:07:20,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 23:07:20,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_72 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 23:07:20,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1138514106 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1138514106 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1138514106| ~y$w_buff1~0_In1138514106) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out1138514106| ~y~0_In1138514106) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1138514106, ~y~0=~y~0_In1138514106, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1138514106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1138514106} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1138514106, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1138514106|, ~y~0=~y~0_In1138514106, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1138514106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1138514106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 23:07:20,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~y~0=v_~y~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 23:07:20,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2033202978 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2033202978 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-2033202978|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2033202978 |ULTIMATE.start_main_#t~ite37_Out-2033202978|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033202978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033202978} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033202978, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033202978, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2033202978|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 23:07:20,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1225914822 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1225914822 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1225914822 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1225914822 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out1225914822| ~y$w_buff1_used~0_In1225914822)) (and (= |ULTIMATE.start_main_#t~ite38_Out1225914822| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1225914822, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1225914822, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1225914822, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1225914822} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1225914822, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1225914822, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1225914822|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1225914822, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1225914822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 23:07:20,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1669651784 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1669651784 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1669651784| ~y$r_buff0_thd0~0_In1669651784)) (and (= |ULTIMATE.start_main_#t~ite39_Out1669651784| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1669651784, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1669651784} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1669651784, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1669651784|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1669651784} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 23:07:20,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-928281804 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-928281804 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-928281804 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-928281804 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-928281804|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-928281804 |ULTIMATE.start_main_#t~ite40_Out-928281804|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-928281804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-928281804, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-928281804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928281804} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-928281804|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928281804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-928281804, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-928281804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928281804} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 23:07:20,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~z~0_11 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start_main_#t~ite40_13| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:07:20,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:07:20 BasicIcfg [2019-12-18 23:07:20,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:07:20,216 INFO L168 Benchmark]: Toolchain (without parser) took 18114.79 ms. Allocated memory was 139.5 MB in the beginning and 928.5 MB in the end (delta: 789.1 MB). Free memory was 101.8 MB in the beginning and 366.0 MB in the end (delta: -264.2 MB). Peak memory consumption was 524.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:07:20,219 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:07:20,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.77 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:07:20,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.69 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:07:20,221 INFO L168 Benchmark]: Boogie Preprocessor took 36.14 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:07:20,221 INFO L168 Benchmark]: RCFGBuilder took 779.09 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 108.7 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:07:20,223 INFO L168 Benchmark]: TraceAbstraction took 16418.74 ms. Allocated memory was 203.9 MB in the beginning and 928.5 MB in the end (delta: 724.6 MB). Free memory was 108.0 MB in the beginning and 366.0 MB in the end (delta: -257.9 MB). Peak memory consumption was 466.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:07:20,229 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.77 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.69 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.14 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.09 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 108.7 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16418.74 ms. Allocated memory was 203.9 MB in the beginning and 928.5 MB in the end (delta: 724.6 MB). Free memory was 108.0 MB in the beginning and 366.0 MB in the end (delta: -257.9 MB). Peak memory consumption was 466.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 151 ProgramPointsBefore, 74 ProgramPointsAfterwards, 176 TransitionsBefore, 83 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4568 VarBasedMoverChecksPositive, 135 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48572 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2589, ((void *)0), P0, ((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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t2590, ((void *)0), P1, ((void *)0)) 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t2591, ((void *)0), P2, ((void *)0)) 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 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=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L755] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L755] 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) [L756] 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)) [L757] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L757] 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)) [L758] 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)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L759] 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)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L761] 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)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 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 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1713 SDtfs, 1950 SDslu, 3159 SDs, 0 SdLazy, 1732 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21030occurred 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: 4.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 10708 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 43439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...