/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/mix038_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:18:05,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:18:05,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:18:05,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:18:05,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:18:05,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:18:05,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:18:05,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:18:05,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:18:05,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:18:05,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:18:05,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:18:05,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:18:05,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:18:05,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:18:05,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:18:05,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:18:05,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:18:05,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:18:05,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:18:05,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:18:05,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:18:05,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:18:05,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:18:05,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:18:05,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:18:05,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:18:05,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:18:05,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:18:05,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:18:05,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:18:05,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:18:05,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:18:05,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:18:05,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:18:05,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:18:05,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:18:05,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:18:05,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:18:05,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:18:05,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:18:05,884 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 21:18:05,917 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:18:05,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:18:05,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:18:05,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:18:05,921 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:18:05,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:18:05,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:18:05,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:18:05,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:18:05,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:18:05,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:18:05,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:18:05,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:18:05,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:18:05,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:18:05,925 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:18:05,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:18:05,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:18:05,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:18:05,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:18:05,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:18:05,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:18:05,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:18:05,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:18:05,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:18:05,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:18:05,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:18:05,928 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:18:05,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:18:05,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:18:06,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:18:06,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:18:06,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:18:06,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:18:06,228 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:18:06,229 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.opt.i [2019-12-18 21:18:06,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7394b0832/9c1a3b1f80064636b2dbce9c99076c4a/FLAG64c344208 [2019-12-18 21:18:06,877 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:18:06,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.opt.i [2019-12-18 21:18:06,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7394b0832/9c1a3b1f80064636b2dbce9c99076c4a/FLAG64c344208 [2019-12-18 21:18:07,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7394b0832/9c1a3b1f80064636b2dbce9c99076c4a [2019-12-18 21:18:07,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:18:07,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:18:07,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:18:07,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:18:07,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:18:07,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:07,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3899c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07, skipping insertion in model container [2019-12-18 21:18:07,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:07,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:18:07,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:18:07,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:18:07,758 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:18:07,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:18:07,921 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:18:07,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07 WrapperNode [2019-12-18 21:18:07,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:18:07,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:18:07,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:18:07,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:18:07,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:07,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:07,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:18:07,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:18:07,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:18:07,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:18:08,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:08,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:08,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:08,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:08,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:08,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:08,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (1/1) ... [2019-12-18 21:18:08,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:18:08,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:18:08,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:18:08,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:18:08,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (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 21:18:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:18:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:18:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:18:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:18:08,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:18:08,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:18:08,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:18:08,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:18:08,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:18:08,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:18:08,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:18:08,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:18:08,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:18:08,124 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 21:18:08,817 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:18:08,817 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:18:08,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:18:08 BoogieIcfgContainer [2019-12-18 21:18:08,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:18:08,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:18:08,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:18:08,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:18:08,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:18:07" (1/3) ... [2019-12-18 21:18:08,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469b7b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:18:08, skipping insertion in model container [2019-12-18 21:18:08,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:18:07" (2/3) ... [2019-12-18 21:18:08,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469b7b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:18:08, skipping insertion in model container [2019-12-18 21:18:08,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:18:08" (3/3) ... [2019-12-18 21:18:08,829 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt.i [2019-12-18 21:18:08,839 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:18:08,839 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:18:08,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:18:08,848 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:18:08,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,889 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,889 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,914 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,915 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,955 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,957 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:18:08,975 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:18:08,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:18:08,992 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:18:08,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:18:08,993 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:18:08,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:18:08,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:18:08,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:18:08,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:18:09,011 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-18 21:18:09,013 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-18 21:18:09,097 INFO L126 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-18 21:18:09,098 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:18:09,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:18:09,139 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-18 21:18:09,215 INFO L126 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-18 21:18:09,215 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:18:09,221 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:18:09,237 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 21:18:09,239 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:18:11,484 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-18 21:18:12,919 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 21:18:13,060 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:18:13,104 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42021 [2019-12-18 21:18:13,105 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:18:13,109 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-18 21:18:13,926 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-18 21:18:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-18 21:18:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:18:13,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:13,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:13,936 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 21:18:13,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash 615279903, now seen corresponding path program 1 times [2019-12-18 21:18:13,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:13,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225563921] [2019-12-18 21:18:13,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:14,267 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 21:18:14,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225563921] [2019-12-18 21:18:14,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:14,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:18:14,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232242652] [2019-12-18 21:18:14,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:14,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:14,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:14,292 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-18 21:18:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:14,659 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-18 21:18:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:14,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:18:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:14,825 INFO L225 Difference]: With dead ends: 13322 [2019-12-18 21:18:14,825 INFO L226 Difference]: Without dead ends: 12542 [2019-12-18 21:18:14,826 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 21:18:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-18 21:18:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-18 21:18:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-18 21:18:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-18 21:18:15,588 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-18 21:18:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:15,589 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-18 21:18:15,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-18 21:18:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:18:15,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:15,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:15,601 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 21:18:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash -391053263, now seen corresponding path program 1 times [2019-12-18 21:18:15,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:15,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534230554] [2019-12-18 21:18:15,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:15,673 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 21:18:15,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534230554] [2019-12-18 21:18:15,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:15,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:15,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248180045] [2019-12-18 21:18:15,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:15,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:15,678 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 3 states. [2019-12-18 21:18:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:15,784 INFO L93 Difference]: Finished difference Result 7513 states and 25047 transitions. [2019-12-18 21:18:15,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:15,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:18:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:15,814 INFO L225 Difference]: With dead ends: 7513 [2019-12-18 21:18:15,814 INFO L226 Difference]: Without dead ends: 7513 [2019-12-18 21:18:15,815 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 21:18:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2019-12-18 21:18:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2019-12-18 21:18:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7513 states. [2019-12-18 21:18:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 25047 transitions. [2019-12-18 21:18:16,819 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 25047 transitions. Word has length 13 [2019-12-18 21:18:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:16,819 INFO L462 AbstractCegarLoop]: Abstraction has 7513 states and 25047 transitions. [2019-12-18 21:18:16,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 25047 transitions. [2019-12-18 21:18:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:18:16,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:16,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:16,821 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 21:18:16,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1810905474, now seen corresponding path program 1 times [2019-12-18 21:18:16,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:16,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289225479] [2019-12-18 21:18:16,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:16,923 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 21:18:16,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289225479] [2019-12-18 21:18:16,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:16,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:18:16,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742625128] [2019-12-18 21:18:16,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:18:16,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:18:16,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:16,926 INFO L87 Difference]: Start difference. First operand 7513 states and 25047 transitions. Second operand 4 states. [2019-12-18 21:18:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:16,962 INFO L93 Difference]: Finished difference Result 1752 states and 4700 transitions. [2019-12-18 21:18:16,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:18:16,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:18:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:16,968 INFO L225 Difference]: With dead ends: 1752 [2019-12-18 21:18:16,968 INFO L226 Difference]: Without dead ends: 1752 [2019-12-18 21:18:16,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-18 21:18:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-18 21:18:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-18 21:18:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4700 transitions. [2019-12-18 21:18:17,013 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4700 transitions. Word has length 14 [2019-12-18 21:18:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:17,013 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4700 transitions. [2019-12-18 21:18:17,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4700 transitions. [2019-12-18 21:18:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:18:17,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:17,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:18:17,015 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 21:18:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1355676511, now seen corresponding path program 1 times [2019-12-18 21:18:17,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:17,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457843344] [2019-12-18 21:18:17,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:17,084 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 21:18:17,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457843344] [2019-12-18 21:18:17,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:17,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:17,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586133403] [2019-12-18 21:18:17,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:18:17,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:17,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:18:17,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:18:17,086 INFO L87 Difference]: Start difference. First operand 1752 states and 4700 transitions. Second operand 4 states. [2019-12-18 21:18:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:17,273 INFO L93 Difference]: Finished difference Result 2319 states and 6117 transitions. [2019-12-18 21:18:17,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:18:17,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:18:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:17,281 INFO L225 Difference]: With dead ends: 2319 [2019-12-18 21:18:17,282 INFO L226 Difference]: Without dead ends: 2319 [2019-12-18 21:18:17,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-12-18 21:18:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2159. [2019-12-18 21:18:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-18 21:18:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5759 transitions. [2019-12-18 21:18:17,350 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5759 transitions. Word has length 16 [2019-12-18 21:18:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:17,351 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5759 transitions. [2019-12-18 21:18:17,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:18:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5759 transitions. [2019-12-18 21:18:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:18:17,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:17,355 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 21:18:17,356 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 21:18:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1253128974, now seen corresponding path program 1 times [2019-12-18 21:18:17,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:17,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386814618] [2019-12-18 21:18:17,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:17,455 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 21:18:17,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386814618] [2019-12-18 21:18:17,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:17,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:18:17,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200794229] [2019-12-18 21:18:17,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:18:17,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:18:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:17,458 INFO L87 Difference]: Start difference. First operand 2159 states and 5759 transitions. Second operand 5 states. [2019-12-18 21:18:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:17,501 INFO L93 Difference]: Finished difference Result 1278 states and 3496 transitions. [2019-12-18 21:18:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:18:17,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 21:18:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:17,508 INFO L225 Difference]: With dead ends: 1278 [2019-12-18 21:18:17,508 INFO L226 Difference]: Without dead ends: 1278 [2019-12-18 21:18:17,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:18:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-18 21:18:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1218. [2019-12-18 21:18:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-18 21:18:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 3346 transitions. [2019-12-18 21:18:17,618 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 3346 transitions. Word has length 29 [2019-12-18 21:18:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:17,618 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 3346 transitions. [2019-12-18 21:18:17,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:18:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 3346 transitions. [2019-12-18 21:18:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:18:17,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:17,623 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 21:18:17,623 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 21:18:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1013252767, now seen corresponding path program 1 times [2019-12-18 21:18:17,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:17,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320866795] [2019-12-18 21:18:17,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:17,744 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 21:18:17,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320866795] [2019-12-18 21:18:17,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:17,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:18:17,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926326761] [2019-12-18 21:18:17,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:18:17,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:18:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:18:17,746 INFO L87 Difference]: Start difference. First operand 1218 states and 3346 transitions. Second operand 6 states. [2019-12-18 21:18:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:17,978 INFO L93 Difference]: Finished difference Result 3114 states and 8422 transitions. [2019-12-18 21:18:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:18:17,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-18 21:18:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:17,988 INFO L225 Difference]: With dead ends: 3114 [2019-12-18 21:18:17,988 INFO L226 Difference]: Without dead ends: 2096 [2019-12-18 21:18:17,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:18:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-12-18 21:18:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1332. [2019-12-18 21:18:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-12-18 21:18:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 3659 transitions. [2019-12-18 21:18:18,032 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 3659 transitions. Word has length 44 [2019-12-18 21:18:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:18,032 INFO L462 AbstractCegarLoop]: Abstraction has 1332 states and 3659 transitions. [2019-12-18 21:18:18,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:18:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 3659 transitions. [2019-12-18 21:18:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:18:18,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:18,037 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 21:18:18,037 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 21:18:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1227474999, now seen corresponding path program 2 times [2019-12-18 21:18:18,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:18,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407781097] [2019-12-18 21:18:18,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:18,098 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 21:18:18,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407781097] [2019-12-18 21:18:18,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:18,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:18,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323276287] [2019-12-18 21:18:18,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:18,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:18,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:18,100 INFO L87 Difference]: Start difference. First operand 1332 states and 3659 transitions. Second operand 3 states. [2019-12-18 21:18:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:18,116 INFO L93 Difference]: Finished difference Result 1991 states and 5148 transitions. [2019-12-18 21:18:18,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:18,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:18:18,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:18,119 INFO L225 Difference]: With dead ends: 1991 [2019-12-18 21:18:18,119 INFO L226 Difference]: Without dead ends: 699 [2019-12-18 21:18:18,119 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 21:18:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-12-18 21:18:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2019-12-18 21:18:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-12-18 21:18:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1564 transitions. [2019-12-18 21:18:18,135 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1564 transitions. Word has length 44 [2019-12-18 21:18:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:18,135 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1564 transitions. [2019-12-18 21:18:18,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1564 transitions. [2019-12-18 21:18:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:18:18,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:18,137 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 21:18:18,138 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 21:18:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 182422381, now seen corresponding path program 3 times [2019-12-18 21:18:18,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:18,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711549222] [2019-12-18 21:18:18,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:18,350 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 21:18:18,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711549222] [2019-12-18 21:18:18,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:18,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:18:18,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945964232] [2019-12-18 21:18:18,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:18,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:18,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:18,352 INFO L87 Difference]: Start difference. First operand 699 states and 1564 transitions. Second operand 9 states. [2019-12-18 21:18:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:19,613 INFO L93 Difference]: Finished difference Result 1586 states and 3398 transitions. [2019-12-18 21:18:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:18:19,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-18 21:18:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:19,619 INFO L225 Difference]: With dead ends: 1586 [2019-12-18 21:18:19,620 INFO L226 Difference]: Without dead ends: 1586 [2019-12-18 21:18:19,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:18:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-12-18 21:18:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 889. [2019-12-18 21:18:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-18 21:18:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1963 transitions. [2019-12-18 21:18:19,648 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1963 transitions. Word has length 44 [2019-12-18 21:18:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:19,648 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1963 transitions. [2019-12-18 21:18:19,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:18:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1963 transitions. [2019-12-18 21:18:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:18:19,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:19,651 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 21:18:19,651 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 21:18:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:19,652 INFO L82 PathProgramCache]: Analyzing trace with hash 106963507, now seen corresponding path program 4 times [2019-12-18 21:18:19,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:19,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717078412] [2019-12-18 21:18:19,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:19,788 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 21:18:19,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717078412] [2019-12-18 21:18:19,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:19,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:18:19,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583480989] [2019-12-18 21:18:19,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:18:19,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:18:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:18:19,791 INFO L87 Difference]: Start difference. First operand 889 states and 1963 transitions. Second operand 9 states. [2019-12-18 21:18:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:21,065 INFO L93 Difference]: Finished difference Result 4489 states and 9977 transitions. [2019-12-18 21:18:21,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 21:18:21,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-18 21:18:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:21,074 INFO L225 Difference]: With dead ends: 4489 [2019-12-18 21:18:21,075 INFO L226 Difference]: Without dead ends: 3413 [2019-12-18 21:18:21,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 21:18:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2019-12-18 21:18:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 1255. [2019-12-18 21:18:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2019-12-18 21:18:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2870 transitions. [2019-12-18 21:18:21,224 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2870 transitions. Word has length 44 [2019-12-18 21:18:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:21,224 INFO L462 AbstractCegarLoop]: Abstraction has 1255 states and 2870 transitions. [2019-12-18 21:18:21,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:18:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2870 transitions. [2019-12-18 21:18:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:18:21,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:21,228 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 21:18:21,229 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 21:18:21,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1897110467, now seen corresponding path program 5 times [2019-12-18 21:18:21,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:21,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795315215] [2019-12-18 21:18:21,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:21,397 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 21:18:21,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795315215] [2019-12-18 21:18:21,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:21,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:18:21,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584531610] [2019-12-18 21:18:21,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:18:21,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:21,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:18:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:18:21,399 INFO L87 Difference]: Start difference. First operand 1255 states and 2870 transitions. Second operand 7 states. [2019-12-18 21:18:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:22,329 INFO L93 Difference]: Finished difference Result 2524 states and 5552 transitions. [2019-12-18 21:18:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:18:22,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 21:18:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:22,338 INFO L225 Difference]: With dead ends: 2524 [2019-12-18 21:18:22,339 INFO L226 Difference]: Without dead ends: 2516 [2019-12-18 21:18:22,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:18:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-12-18 21:18:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 1296. [2019-12-18 21:18:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2019-12-18 21:18:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 2986 transitions. [2019-12-18 21:18:22,374 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 2986 transitions. Word has length 44 [2019-12-18 21:18:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:22,375 INFO L462 AbstractCegarLoop]: Abstraction has 1296 states and 2986 transitions. [2019-12-18 21:18:22,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:18:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 2986 transitions. [2019-12-18 21:18:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:18:22,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:22,379 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 21:18:22,379 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 21:18:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:22,379 INFO L82 PathProgramCache]: Analyzing trace with hash -244228541, now seen corresponding path program 6 times [2019-12-18 21:18:22,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:22,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828686912] [2019-12-18 21:18:22,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:18:22,440 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 21:18:22,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828686912] [2019-12-18 21:18:22,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:18:22,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:18:22,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681448262] [2019-12-18 21:18:22,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:18:22,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:18:22,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:18:22,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:18:22,442 INFO L87 Difference]: Start difference. First operand 1296 states and 2986 transitions. Second operand 3 states. [2019-12-18 21:18:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:18:22,459 INFO L93 Difference]: Finished difference Result 1294 states and 2981 transitions. [2019-12-18 21:18:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:18:22,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:18:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:18:22,464 INFO L225 Difference]: With dead ends: 1294 [2019-12-18 21:18:22,464 INFO L226 Difference]: Without dead ends: 1294 [2019-12-18 21:18:22,464 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 21:18:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-12-18 21:18:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1173. [2019-12-18 21:18:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-12-18 21:18:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 2751 transitions. [2019-12-18 21:18:22,488 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 2751 transitions. Word has length 44 [2019-12-18 21:18:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:18:22,488 INFO L462 AbstractCegarLoop]: Abstraction has 1173 states and 2751 transitions. [2019-12-18 21:18:22,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:18:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 2751 transitions. [2019-12-18 21:18:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:18:22,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:18:22,492 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 21:18:22,492 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 21:18:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:18:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash 730797803, now seen corresponding path program 1 times [2019-12-18 21:18:22,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:18:22,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101479666] [2019-12-18 21:18:22,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:18:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:18:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:18:22,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:18:22,596 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:18:22,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1016~0.base_25| 4) |v_#length_23|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1016~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1016~0.base_25|) |v_ULTIMATE.start_main_~#t1016~0.offset_19| 0)) |v_#memory_int_19|) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_25| 1)) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_9) (= v_~z~0_10 0) (= v_~y$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd2~0_67 0) (= 0 v_~y$w_buff0~0_23) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$w_buff1_used~0_57 0) (= v_~x~0_17 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= v_~y~0_20 0) (= v_~y$r_buff0_thd0~0_20 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1016~0.base_25|) (= 0 v_~y$w_buff0_used~0_91) (= (select .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_25|) 0) (= v_~main$tmp_guard1~0_15 0) (= |v_ULTIMATE.start_main_~#t1016~0.offset_19| 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= 0 v_~y$w_buff1~0_20) (= v_~y$r_buff0_thd3~0_27 0) (= 0 v_~y$r_buff1_thd2~0_43) (= 0 v_~y$flush_delayed~0_11))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_14|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ULTIMATE.start_main_~#t1016~0.base=|v_ULTIMATE.start_main_~#t1016~0.base_25|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ULTIMATE.start_main_~#t1016~0.offset=|v_ULTIMATE.start_main_~#t1016~0.offset_19|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~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_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_17, ~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_91, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$w_buff0~0=v_~y$w_buff0~0_23, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y~0=v_~y~0_20, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ULTIMATE.start_main_~#t1018~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1017~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1016~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1016~0.offset, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1017~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:18:22,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t1017~0.offset_9| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11| 1) |v_#valid_32|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11|) |v_ULTIMATE.start_main_~#t1017~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t1017~0.base_11| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1017~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1017~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_11|, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1017~0.base, ULTIMATE.start_main_~#t1017~0.offset] because there is no mapped edge [2019-12-18 21:18:22,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1018~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1018~0.base_10|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1018~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10|) |v_ULTIMATE.start_main_~#t1018~0.offset_8| 2)) |v_#memory_int_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1018~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_8|, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1018~0.offset, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 21:18:22,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L4-->L797: Formula: (and (= ~y$r_buff0_thd3~0_Out-2009227553 1) (= ~y$r_buff1_thd0~0_Out-2009227553 ~y$r_buff0_thd0~0_In-2009227553) (= ~y$r_buff0_thd1~0_In-2009227553 ~y$r_buff1_thd1~0_Out-2009227553) (not (= P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-2009227553 0)) (= ~z~0_Out-2009227553 1) (= ~y$r_buff1_thd2~0_Out-2009227553 ~y$r_buff0_thd2~0_In-2009227553) (= ~a~0_In-2009227553 ~__unbuffered_p2_EBX~0_Out-2009227553) (= ~z~0_Out-2009227553 ~__unbuffered_p2_EAX~0_Out-2009227553) (= ~y$r_buff0_thd3~0_In-2009227553 ~y$r_buff1_thd3~0_Out-2009227553)) InVars {~a~0=~a~0_In-2009227553, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2009227553, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2009227553, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2009227553, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2009227553, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-2009227553} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-2009227553, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In-2009227553, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2009227553, ~a~0=~a~0_In-2009227553, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2009227553, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-2009227553, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2009227553, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2009227553, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2009227553, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2009227553, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-2009227553, ~z~0=~z~0_Out-2009227553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2009227553} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:18:22,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x~0_8) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_8, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:18:22,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2127355927 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite8_In2127355927| |P1Thread1of1ForFork1_#t~ite8_Out2127355927|) (not .cse0) (= ~y$w_buff0~0_In2127355927 |P1Thread1of1ForFork1_#t~ite9_Out2127355927|)) (and (= |P1Thread1of1ForFork1_#t~ite8_Out2127355927| |P1Thread1of1ForFork1_#t~ite9_Out2127355927|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2127355927 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In2127355927 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In2127355927 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In2127355927 256)) .cse1))) .cse0 (= ~y$w_buff0~0_In2127355927 |P1Thread1of1ForFork1_#t~ite8_Out2127355927|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2127355927, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127355927, ~y$w_buff0~0=~y$w_buff0~0_In2127355927, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2127355927, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In2127355927|, ~weak$$choice2~0=~weak$$choice2~0_In2127355927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127355927} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2127355927, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127355927, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2127355927|, ~y$w_buff0~0=~y$w_buff0~0_In2127355927, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2127355927, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out2127355927|, ~weak$$choice2~0=~weak$$choice2~0_In2127355927, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127355927} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:18:22,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L757-->L757-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-377314457 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_In-377314457| |P1Thread1of1ForFork1_#t~ite11_Out-377314457|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite12_Out-377314457| ~y$w_buff1~0_In-377314457)) (and (= ~y$w_buff1~0_In-377314457 |P1Thread1of1ForFork1_#t~ite11_Out-377314457|) (= |P1Thread1of1ForFork1_#t~ite12_Out-377314457| |P1Thread1of1ForFork1_#t~ite11_Out-377314457|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-377314457 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-377314457 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-377314457 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-377314457 256)) .cse1))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-377314457, ~y$w_buff1~0=~y$w_buff1~0_In-377314457, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-377314457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-377314457, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-377314457|, ~weak$$choice2~0=~weak$$choice2~0_In-377314457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-377314457} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-377314457, ~y$w_buff1~0=~y$w_buff1~0_In-377314457, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-377314457, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-377314457, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-377314457|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-377314457|, ~weak$$choice2~0=~weak$$choice2~0_In-377314457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-377314457} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:18:22,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1988767915 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out1988767915| ~y$w_buff0_used~0_In1988767915) (= |P1Thread1of1ForFork1_#t~ite14_In1988767915| |P1Thread1of1ForFork1_#t~ite14_Out1988767915|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1988767915 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1988767915 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1988767915 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1988767915 256)) .cse1))) .cse0 (= ~y$w_buff0_used~0_In1988767915 |P1Thread1of1ForFork1_#t~ite14_Out1988767915|) (= |P1Thread1of1ForFork1_#t~ite15_Out1988767915| |P1Thread1of1ForFork1_#t~ite14_Out1988767915|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1988767915, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1988767915, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1988767915, ~weak$$choice2~0=~weak$$choice2~0_In1988767915, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1988767915|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1988767915} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1988767915, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1988767915, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1988767915, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1988767915|, ~weak$$choice2~0=~weak$$choice2~0_In1988767915, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1988767915|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1988767915} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:18:22,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (= v_~y$r_buff0_thd2~0_52 v_~y$r_buff0_thd2~0_51) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_9|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} 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 21:18:22,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y~0_16 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~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 21:18:22,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In979819610 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In979819610 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In979819610 |P2Thread1of1ForFork2_#t~ite28_Out979819610|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out979819610|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In979819610, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In979819610} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In979819610, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In979819610, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out979819610|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 21:18:22,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In196257478 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In196257478 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In196257478 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In196257478 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out196257478| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite29_Out196257478| ~y$w_buff1_used~0_In196257478) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In196257478, ~y$w_buff0_used~0=~y$w_buff0_used~0_In196257478, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In196257478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In196257478} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In196257478, ~y$w_buff0_used~0=~y$w_buff0_used~0_In196257478, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In196257478, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out196257478|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In196257478} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 21:18:22,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In582878366 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In582878366 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out582878366)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In582878366 ~y$r_buff0_thd3~0_Out582878366)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In582878366, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In582878366} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In582878366, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out582878366|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out582878366} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:18:22,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In570862028 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In570862028 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In570862028 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In570862028 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out570862028|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In570862028 |P2Thread1of1ForFork2_#t~ite31_Out570862028|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In570862028, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570862028, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In570862028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570862028} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In570862028, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570862028, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out570862028|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In570862028, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570862028} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 21:18:22,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L801-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_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} 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_16, 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 21:18:22,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:18:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1963785696 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1963785696 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1963785696| ~y$w_buff1~0_In1963785696)) (and (= |ULTIMATE.start_main_#t~ite35_Out1963785696| ~y~0_In1963785696) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1963785696, ~y~0=~y~0_In1963785696, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1963785696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1963785696} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1963785696, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1963785696|, ~y~0=~y~0_In1963785696, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1963785696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1963785696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 21:18:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 21:18:22,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1675604045 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1675604045 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1675604045 |ULTIMATE.start_main_#t~ite37_Out-1675604045|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1675604045|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1675604045, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1675604045} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1675604045, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1675604045, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1675604045|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:18:22,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In213919546 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In213919546 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In213919546 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In213919546 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out213919546|)) (and (= ~y$w_buff1_used~0_In213919546 |ULTIMATE.start_main_#t~ite38_Out213919546|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In213919546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In213919546, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In213919546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In213919546} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In213919546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In213919546, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out213919546|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In213919546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In213919546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:18:22,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1268772698 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1268772698 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1268772698| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1268772698| ~y$r_buff0_thd0~0_In-1268772698)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1268772698, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1268772698} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1268772698, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1268772698|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1268772698} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:18:22,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2098409161 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-2098409161 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-2098409161 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2098409161 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-2098409161|)) (and (= ~y$r_buff1_thd0~0_In-2098409161 |ULTIMATE.start_main_#t~ite40_Out-2098409161|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098409161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2098409161, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2098409161, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2098409161} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2098409161|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2098409161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2098409161, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2098409161, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2098409161} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:18:22,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_~x~0_13 2) (= 0 v_~__unbuffered_p1_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite40_15| v_~y$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p2_EAX~0_11)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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 21:18:22,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:18:22 BasicIcfg [2019-12-18 21:18:22,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:18:22,727 INFO L168 Benchmark]: Toolchain (without parser) took 15580.79 ms. Allocated memory was 146.3 MB in the beginning and 565.7 MB in the end (delta: 419.4 MB). Free memory was 103.1 MB in the beginning and 196.8 MB in the end (delta: -93.8 MB). Peak memory consumption was 325.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:18:22,732 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:18:22,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.16 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 157.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:18:22,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:18:22,734 INFO L168 Benchmark]: Boogie Preprocessor took 39.24 ms. Allocated memory is still 203.4 MB. Free memory was 155.3 MB in the beginning and 153.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:18:22,738 INFO L168 Benchmark]: RCFGBuilder took 787.85 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 109.8 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:18:22,739 INFO L168 Benchmark]: TraceAbstraction took 13904.69 ms. Allocated memory was 203.4 MB in the beginning and 565.7 MB in the end (delta: 362.3 MB). Free memory was 109.1 MB in the beginning and 196.8 MB in the end (delta: -87.7 MB). Peak memory consumption was 274.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:18:22,746 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.44 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.16 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 157.9 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.4 MB. Free memory was 157.9 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.24 ms. Allocated memory is still 203.4 MB. Free memory was 155.3 MB in the beginning and 153.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.85 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 109.8 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13904.69 ms. Allocated memory was 203.4 MB in the beginning and 565.7 MB in the end (delta: 362.3 MB). Free memory was 109.1 MB in the beginning and 196.8 MB in the end (delta: -87.7 MB). Peak memory consumption was 274.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 22 ChoiceCompositions, 4847 VarBasedMoverChecksPositive, 127 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42021 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1016, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L822] FCALL, FORK 0 pthread_create(&t1017, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L824] FCALL, FORK 0 pthread_create(&t1018, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L748] 2 x = 2 [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, 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=1] [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) [L797] 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 [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)=1, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, 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=1] [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] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, 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=1] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, 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=1] [L797] 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) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, y=1, 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=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 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, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1488 SDtfs, 2285 SDslu, 3286 SDs, 0 SdLazy, 2134 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 5180 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 45750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...