/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:55:55,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:55:55,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:55:55,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:55:55,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:55:55,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:55:55,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:55:55,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:55:55,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:55:55,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:55:55,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:55:55,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:55:55,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:55:55,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:55:55,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:55:55,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:55:55,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:55:55,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:55:55,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:55:55,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:55:55,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:55:55,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:55:55,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:55:55,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:55:55,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:55:55,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:55:55,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:55:55,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:55:55,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:55:55,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:55:55,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:55:55,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:55:55,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:55:55,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:55:55,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:55:55,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:55:55,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:55:55,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:55:55,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:55:55,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:55:55,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:55:55,836 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-SemanticLbe-MCR.epf [2019-12-27 16:55:55,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:55:55,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:55:55,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:55:55,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:55:55,880 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:55:55,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:55:55,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:55:55,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:55:55,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:55:55,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:55:55,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:55:55,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:55:55,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:55:55,883 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:55:55,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:55:55,883 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:55:55,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:55:55,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:55:55,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:55:55,884 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:55:55,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:55:55,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:55:55,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:55:55,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:55:55,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:55:55,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:55:55,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:55:55,886 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:55:55,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:55:55,887 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:55:55,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:55:56,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:55:56,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:55:56,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:55:56,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:55:56,242 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:55:56,243 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-27 16:55:56,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650cf5fd1/4280bf809f724843a1a3183b8b717039/FLAG04bfdc08e [2019-12-27 16:55:56,879 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:55:56,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.opt.i [2019-12-27 16:55:56,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650cf5fd1/4280bf809f724843a1a3183b8b717039/FLAG04bfdc08e [2019-12-27 16:55:57,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/650cf5fd1/4280bf809f724843a1a3183b8b717039 [2019-12-27 16:55:57,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:55:57,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:55:57,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:55:57,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:55:57,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:55:57,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:55:57" (1/1) ... [2019-12-27 16:55:57,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:57, skipping insertion in model container [2019-12-27 16:55:57,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:55:57" (1/1) ... [2019-12-27 16:55:57,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:55:57,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:55:57,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:55:57,877 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:55:57,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:55:58,028 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:55:58,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58 WrapperNode [2019-12-27 16:55:58,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:55:58,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:55:58,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:55:58,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:55:58,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:55:58,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:55:58,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:55:58,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:55:58,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... [2019-12-27 16:55:58,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:55:58,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:55:58,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:55:58,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:55:58,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:55:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:55:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:55:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:55:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:55:58,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:55:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:55:58,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:55:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:55:58,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:55:58,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:55:58,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:55:58,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:55:58,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:55:58,195 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:55:58,958 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:55:58,959 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:55:58,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:55:58 BoogieIcfgContainer [2019-12-27 16:55:58,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:55:58,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:55:58,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:55:58,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:55:58,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:55:57" (1/3) ... [2019-12-27 16:55:58,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f13e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:55:58, skipping insertion in model container [2019-12-27 16:55:58,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:55:58" (2/3) ... [2019-12-27 16:55:58,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f13e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:55:58, skipping insertion in model container [2019-12-27 16:55:58,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:55:58" (3/3) ... [2019-12-27 16:55:58,974 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt.i [2019-12-27 16:55:58,986 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:55:58,986 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:55:59,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:55:59,001 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:55:59,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,101 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,101 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,101 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,102 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,102 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,116 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,119 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,126 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,126 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,126 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,127 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,127 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,128 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:55:59,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:55:59,164 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:55:59,164 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:55:59,164 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:55:59,164 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:55:59,164 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:55:59,164 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:55:59,165 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:55:59,165 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:55:59,185 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-27 16:55:59,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-27 16:55:59,303 INFO L132 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-27 16:55:59,304 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:55:59,317 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. 0/138 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 16:55:59,335 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-27 16:55:59,379 INFO L132 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-27 16:55:59,380 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:55:59,385 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. 0/138 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 16:55:59,400 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 16:55:59,401 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:56:03,958 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 16:56:04,083 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:56:04,138 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-12-27 16:56:04,138 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 16:56:04,143 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-27 16:56:05,944 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-27 16:56:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-27 16:56:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:56:05,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:05,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:05,955 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-27 16:56:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-12-27 16:56:05,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:05,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526300285] [2019-12-27 16:56:05,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:06,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526300285] [2019-12-27 16:56:06,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:06,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:56:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914090767] [2019-12-27 16:56:06,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:06,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:06,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:56:06,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:06,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:06,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:06,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:06,241 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-27 16:56:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:06,517 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-27 16:56:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:06,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:56:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:06,669 INFO L225 Difference]: With dead ends: 13322 [2019-12-27 16:56:06,669 INFO L226 Difference]: Without dead ends: 12542 [2019-12-27 16:56:06,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-27 16:56:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-27 16:56:07,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-27 16:56:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-27 16:56:07,359 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-27 16:56:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:07,360 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-27 16:56:07,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-27 16:56:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:56:07,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:07,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:07,367 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-27 16:56:07,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:07,367 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-12-27 16:56:07,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:07,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768063809] [2019-12-27 16:56:07,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:07,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768063809] [2019-12-27 16:56:07,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:07,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:07,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1511761755] [2019-12-27 16:56:07,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:07,452 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:07,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:56:07,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:07,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:07,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:07,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:07,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:07,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:07,458 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 3 states. [2019-12-27 16:56:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:07,558 INFO L93 Difference]: Finished difference Result 7513 states and 25047 transitions. [2019-12-27 16:56:07,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:07,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:56:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:07,591 INFO L225 Difference]: With dead ends: 7513 [2019-12-27 16:56:07,591 INFO L226 Difference]: Without dead ends: 7513 [2019-12-27 16:56:07,594 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-27 16:56:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2019-12-27 16:56:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2019-12-27 16:56:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7513 states. [2019-12-27 16:56:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 25047 transitions. [2019-12-27 16:56:08,561 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 25047 transitions. Word has length 13 [2019-12-27 16:56:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:08,561 INFO L462 AbstractCegarLoop]: Abstraction has 7513 states and 25047 transitions. [2019-12-27 16:56:08,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 25047 transitions. [2019-12-27 16:56:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:56:08,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:08,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:08,564 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-27 16:56:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 361138653, now seen corresponding path program 1 times [2019-12-27 16:56:08,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:08,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178480889] [2019-12-27 16:56:08,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:08,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178480889] [2019-12-27 16:56:08,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:08,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:56:08,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618911669] [2019-12-27 16:56:08,622 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:08,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:08,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 16:56:08,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:08,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:56:08,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:56:08,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:08,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:56:08,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:56:08,684 INFO L87 Difference]: Start difference. First operand 7513 states and 25047 transitions. Second operand 6 states. [2019-12-27 16:56:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:08,752 INFO L93 Difference]: Finished difference Result 1752 states and 4700 transitions. [2019-12-27 16:56:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:56:08,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-27 16:56:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:08,758 INFO L225 Difference]: With dead ends: 1752 [2019-12-27 16:56:08,759 INFO L226 Difference]: Without dead ends: 1752 [2019-12-27 16:56:08,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:56:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-27 16:56:08,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-27 16:56:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-27 16:56:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4700 transitions. [2019-12-27 16:56:08,796 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4700 transitions. Word has length 14 [2019-12-27 16:56:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:08,797 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4700 transitions. [2019-12-27 16:56:08,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:56:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4700 transitions. [2019-12-27 16:56:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:56:08,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:08,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:08,798 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-27 16:56:08,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-12-27 16:56:08,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:08,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046133691] [2019-12-27 16:56:08,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:08,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046133691] [2019-12-27 16:56:08,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:08,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:08,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1736604544] [2019-12-27 16:56:08,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:08,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:08,927 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:56:08,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:08,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:56:08,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:56:08,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:56:08,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:56:08,954 INFO L87 Difference]: Start difference. First operand 1752 states and 4700 transitions. Second operand 5 states. [2019-12-27 16:56:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:09,146 INFO L93 Difference]: Finished difference Result 2319 states and 6117 transitions. [2019-12-27 16:56:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:56:09,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:56:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:09,153 INFO L225 Difference]: With dead ends: 2319 [2019-12-27 16:56:09,153 INFO L226 Difference]: Without dead ends: 2319 [2019-12-27 16:56:09,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:56:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-12-27 16:56:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2159. [2019-12-27 16:56:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-27 16:56:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5759 transitions. [2019-12-27 16:56:09,209 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5759 transitions. Word has length 16 [2019-12-27 16:56:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:09,210 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5759 transitions. [2019-12-27 16:56:09,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:56:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5759 transitions. [2019-12-27 16:56:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:56:09,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:09,214 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-27 16:56:09,215 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-27 16:56:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-12-27 16:56:09,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:09,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883743501] [2019-12-27 16:56:09,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:09,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883743501] [2019-12-27 16:56:09,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:09,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:56:09,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526106161] [2019-12-27 16:56:09,291 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:09,299 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:09,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 209 transitions. [2019-12-27 16:56:09,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:09,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:56:09,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:56:09,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:56:09,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:56:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:56:09,930 INFO L87 Difference]: Start difference. First operand 2159 states and 5759 transitions. Second operand 12 states. [2019-12-27 16:56:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:10,419 INFO L93 Difference]: Finished difference Result 1319 states and 3549 transitions. [2019-12-27 16:56:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:56:10,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-12-27 16:56:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:10,425 INFO L225 Difference]: With dead ends: 1319 [2019-12-27 16:56:10,425 INFO L226 Difference]: Without dead ends: 1298 [2019-12-27 16:56:10,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:56:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-12-27 16:56:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1224. [2019-12-27 16:56:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2019-12-27 16:56:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3352 transitions. [2019-12-27 16:56:10,453 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3352 transitions. Word has length 29 [2019-12-27 16:56:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:10,453 INFO L462 AbstractCegarLoop]: Abstraction has 1224 states and 3352 transitions. [2019-12-27 16:56:10,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:56:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3352 transitions. [2019-12-27 16:56:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:56:10,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:10,458 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-27 16:56:10,458 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-27 16:56:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1707006173, now seen corresponding path program 1 times [2019-12-27 16:56:10,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:10,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417081448] [2019-12-27 16:56:10,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:10,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417081448] [2019-12-27 16:56:10,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:10,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:10,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655664903] [2019-12-27 16:56:10,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:10,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:10,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 186 transitions. [2019-12-27 16:56:10,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:10,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:56:10,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:56:10,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:10,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:56:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:56:10,781 INFO L87 Difference]: Start difference. First operand 1224 states and 3352 transitions. Second operand 6 states. [2019-12-27 16:56:10,973 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-12-27 16:56:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:11,264 INFO L93 Difference]: Finished difference Result 3409 states and 9223 transitions. [2019-12-27 16:56:11,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:56:11,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-27 16:56:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:11,268 INFO L225 Difference]: With dead ends: 3409 [2019-12-27 16:56:11,268 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 16:56:11,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:56:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 16:56:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 732. [2019-12-27 16:56:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-12-27 16:56:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1625 transitions. [2019-12-27 16:56:11,288 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1625 transitions. Word has length 44 [2019-12-27 16:56:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:11,288 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 1625 transitions. [2019-12-27 16:56:11,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:56:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1625 transitions. [2019-12-27 16:56:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:56:11,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:11,291 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-27 16:56:11,291 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-27 16:56:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1883792513, now seen corresponding path program 2 times [2019-12-27 16:56:11,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:11,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513384272] [2019-12-27 16:56:11,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:11,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513384272] [2019-12-27 16:56:11,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:11,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:56:11,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704389751] [2019-12-27 16:56:11,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:11,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:11,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 151 transitions. [2019-12-27 16:56:11,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:11,590 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:56:11,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:56:11,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:56:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:56:11,592 INFO L87 Difference]: Start difference. First operand 732 states and 1625 transitions. Second operand 7 states. [2019-12-27 16:56:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:12,315 INFO L93 Difference]: Finished difference Result 2023 states and 4378 transitions. [2019-12-27 16:56:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:56:12,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 16:56:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:12,320 INFO L225 Difference]: With dead ends: 2023 [2019-12-27 16:56:12,320 INFO L226 Difference]: Without dead ends: 1417 [2019-12-27 16:56:12,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:56:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2019-12-27 16:56:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 802. [2019-12-27 16:56:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-27 16:56:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1780 transitions. [2019-12-27 16:56:12,344 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1780 transitions. Word has length 44 [2019-12-27 16:56:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:12,345 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1780 transitions. [2019-12-27 16:56:12,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:56:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1780 transitions. [2019-12-27 16:56:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:56:12,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:12,347 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-27 16:56:12,347 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-27 16:56:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 170447017, now seen corresponding path program 3 times [2019-12-27 16:56:12,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:12,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541407986] [2019-12-27 16:56:12,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:12,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541407986] [2019-12-27 16:56:12,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:12,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:56:12,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730343345] [2019-12-27 16:56:12,569 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:12,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:12,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 219 transitions. [2019-12-27 16:56:12,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:12,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 16:56:12,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:56:12,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:12,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:56:12,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:56:12,774 INFO L87 Difference]: Start difference. First operand 802 states and 1780 transitions. Second operand 12 states. [2019-12-27 16:56:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:17,565 INFO L93 Difference]: Finished difference Result 3330 states and 7160 transitions. [2019-12-27 16:56:17,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-27 16:56:17,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-12-27 16:56:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:17,572 INFO L225 Difference]: With dead ends: 3330 [2019-12-27 16:56:17,573 INFO L226 Difference]: Without dead ends: 3330 [2019-12-27 16:56:17,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1506 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=912, Invalid=3644, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 16:56:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2019-12-27 16:56:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 1437. [2019-12-27 16:56:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2019-12-27 16:56:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 3379 transitions. [2019-12-27 16:56:17,625 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 3379 transitions. Word has length 44 [2019-12-27 16:56:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:17,625 INFO L462 AbstractCegarLoop]: Abstraction has 1437 states and 3379 transitions. [2019-12-27 16:56:17,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:56:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 3379 transitions. [2019-12-27 16:56:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:56:17,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:17,629 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-27 16:56:17,629 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-27 16:56:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:17,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1420662497, now seen corresponding path program 4 times [2019-12-27 16:56:17,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:17,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081730076] [2019-12-27 16:56:17,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:17,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081730076] [2019-12-27 16:56:17,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:17,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:56:17,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1649806157] [2019-12-27 16:56:17,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:17,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:17,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 151 transitions. [2019-12-27 16:56:17,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:17,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:56:17,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:56:17,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:56:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:56:17,978 INFO L87 Difference]: Start difference. First operand 1437 states and 3379 transitions. Second operand 8 states. [2019-12-27 16:56:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:19,358 INFO L93 Difference]: Finished difference Result 3027 states and 6800 transitions. [2019-12-27 16:56:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:56:19,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-12-27 16:56:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:19,364 INFO L225 Difference]: With dead ends: 3027 [2019-12-27 16:56:19,364 INFO L226 Difference]: Without dead ends: 2996 [2019-12-27 16:56:19,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:56:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-12-27 16:56:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 1640. [2019-12-27 16:56:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2019-12-27 16:56:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 3892 transitions. [2019-12-27 16:56:19,406 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 3892 transitions. Word has length 44 [2019-12-27 16:56:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:19,406 INFO L462 AbstractCegarLoop]: Abstraction has 1640 states and 3892 transitions. [2019-12-27 16:56:19,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:56:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 3892 transitions. [2019-12-27 16:56:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 16:56:19,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:19,411 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-27 16:56:19,412 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-27 16:56:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -115488353, now seen corresponding path program 5 times [2019-12-27 16:56:19,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:19,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162469544] [2019-12-27 16:56:19,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:19,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162469544] [2019-12-27 16:56:19,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:19,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:19,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [934162857] [2019-12-27 16:56:19,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:19,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:19,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 143 transitions. [2019-12-27 16:56:19,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:19,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:19,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:19,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:19,551 INFO L87 Difference]: Start difference. First operand 1640 states and 3892 transitions. Second operand 3 states. [2019-12-27 16:56:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:19,570 INFO L93 Difference]: Finished difference Result 1638 states and 3887 transitions. [2019-12-27 16:56:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:19,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 16:56:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:19,574 INFO L225 Difference]: With dead ends: 1638 [2019-12-27 16:56:19,574 INFO L226 Difference]: Without dead ends: 1638 [2019-12-27 16:56:19,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-12-27 16:56:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1331. [2019-12-27 16:56:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-12-27 16:56:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 3160 transitions. [2019-12-27 16:56:19,607 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 3160 transitions. Word has length 44 [2019-12-27 16:56:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:19,607 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 3160 transitions. [2019-12-27 16:56:19,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 3160 transitions. [2019-12-27 16:56:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 16:56:19,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:19,612 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-27 16:56:19,612 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-27 16:56:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 1 times [2019-12-27 16:56:19,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:19,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083255419] [2019-12-27 16:56:19,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:56:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:56:19,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:56:19,741 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:56:19,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1016~0.base_32|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32| 1)) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32|)) (= v_~y$r_buff0_thd1~0_39 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1016~0.base_32| 4)) (= |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32|) |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_133) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_33|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_~#t1016~0.base=|v_ULTIMATE.start_main_~#t1016~0.base_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t1016~0.offset=|v_ULTIMATE.start_main_~#t1016~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~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_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~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_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} 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-27 16:56:19,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] 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-27 16:56:19,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] 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-27 16:56:19,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~y$r_buff1_thd0~0_Out1624607227 ~y$r_buff0_thd0~0_In1624607227) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1624607227)) (= ~z~0_Out1624607227 ~__unbuffered_p2_EAX~0_Out1624607227) (= ~y$r_buff0_thd2~0_In1624607227 ~y$r_buff1_thd2~0_Out1624607227) (= ~z~0_Out1624607227 1) (= ~y$r_buff0_thd1~0_In1624607227 ~y$r_buff1_thd1~0_Out1624607227) (= ~y$r_buff1_thd3~0_Out1624607227 ~y$r_buff0_thd3~0_In1624607227) (= ~y$r_buff0_thd3~0_Out1624607227 1) (= ~a~0_In1624607227 ~__unbuffered_p2_EBX~0_Out1624607227)) InVars {~a~0=~a~0_In1624607227, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1624607227, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1624607227, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1624607227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1624607227, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1624607227} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out1624607227, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In1624607227, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1624607227, ~a~0=~a~0_In1624607227, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1624607227, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out1624607227, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1624607227, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1624607227, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1624607227, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1624607227, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out1624607227, ~z~0=~z~0_Out1624607227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1624607227} 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-27 16:56:19,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} 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-27 16:56:19,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1847308205 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1847308205 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In1847308205 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In1847308205 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1847308205 256))))) (= ~y$w_buff0~0_In1847308205 |P1Thread1of1ForFork1_#t~ite8_Out1847308205|) (= |P1Thread1of1ForFork1_#t~ite8_Out1847308205| |P1Thread1of1ForFork1_#t~ite9_Out1847308205|)) (and (= ~y$w_buff0~0_In1847308205 |P1Thread1of1ForFork1_#t~ite9_Out1847308205|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In1847308205| |P1Thread1of1ForFork1_#t~ite8_Out1847308205|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1847308205, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1847308205, ~y$w_buff0~0=~y$w_buff0~0_In1847308205, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1847308205, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1847308205|, ~weak$$choice2~0=~weak$$choice2~0_In1847308205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1847308205} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1847308205, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1847308205, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1847308205|, ~y$w_buff0~0=~y$w_buff0~0_In1847308205, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1847308205, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1847308205|, ~weak$$choice2~0=~weak$$choice2~0_In1847308205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1847308205} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:56:19,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1496763807 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1496763807| ~y$w_buff1~0_In1496763807) (= |P1Thread1of1ForFork1_#t~ite11_In1496763807| |P1Thread1of1ForFork1_#t~ite11_Out1496763807|) (not .cse0)) (and (= ~y$w_buff1~0_In1496763807 |P1Thread1of1ForFork1_#t~ite11_Out1496763807|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1496763807 256)))) (or (= (mod ~y$w_buff0_used~0_In1496763807 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1496763807 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In1496763807 256) 0)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out1496763807| |P1Thread1of1ForFork1_#t~ite11_Out1496763807|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1496763807, ~y$w_buff1~0=~y$w_buff1~0_In1496763807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496763807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496763807, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In1496763807|, ~weak$$choice2~0=~weak$$choice2~0_In1496763807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496763807} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1496763807, ~y$w_buff1~0=~y$w_buff1~0_In1496763807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496763807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1496763807, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1496763807|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1496763807|, ~weak$$choice2~0=~weak$$choice2~0_In1496763807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496763807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 16:56:19,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1720615725 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In1720615725| |P1Thread1of1ForFork1_#t~ite14_Out1720615725|) (not .cse0) (= ~y$w_buff0_used~0_In1720615725 |P1Thread1of1ForFork1_#t~ite15_Out1720615725|)) (and (= ~y$w_buff0_used~0_In1720615725 |P1Thread1of1ForFork1_#t~ite14_Out1720615725|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1720615725 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1720615725 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In1720615725 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1720615725 256) 0))) (= |P1Thread1of1ForFork1_#t~ite14_Out1720615725| |P1Thread1of1ForFork1_#t~ite15_Out1720615725|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1720615725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1720615725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1720615725, ~weak$$choice2~0=~weak$$choice2~0_In1720615725, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1720615725|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1720615725} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1720615725, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1720615725, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1720615725, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1720615725|, ~weak$$choice2~0=~weak$$choice2~0_In1720615725, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1720615725|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1720615725} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 16:56:19,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_15|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_12|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 16:56:19,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_19|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 16:56:19,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1775284693 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1775284693 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1775284693 |P2Thread1of1ForFork2_#t~ite28_Out1775284693|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out1775284693|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1775284693, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1775284693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1775284693, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1775284693, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1775284693|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 16:56:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In82270965 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In82270965 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In82270965 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In82270965 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out82270965|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In82270965 |P2Thread1of1ForFork2_#t~ite29_Out82270965|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In82270965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In82270965, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In82270965, ~y$w_buff1_used~0=~y$w_buff1_used~0_In82270965} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In82270965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In82270965, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In82270965, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out82270965|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In82270965} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 16:56:19,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1726134840 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1726134840 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-1726134840 ~y$r_buff0_thd3~0_Out-1726134840)) (and (= ~y$r_buff0_thd3~0_Out-1726134840 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726134840, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1726134840} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1726134840, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1726134840|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1726134840} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:56:19,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1375562715 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1375562715 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1375562715 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1375562715 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-1375562715|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-1375562715 |P2Thread1of1ForFork2_#t~ite31_Out-1375562715|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1375562715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375562715, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1375562715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375562715} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1375562715, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375562715, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1375562715|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1375562715, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375562715} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:56:19,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_32| v_~y$r_buff1_thd3~0_47)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, 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-27 16:56:19,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:56:19,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-696627001 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-696627001 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-696627001| ~y$w_buff1~0_In-696627001) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out-696627001| ~y~0_In-696627001)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-696627001, ~y~0=~y~0_In-696627001, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-696627001, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696627001} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-696627001, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-696627001|, ~y~0=~y~0_In-696627001, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-696627001, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696627001} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 16:56:19,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 16:56:19,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-488423773 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-488423773 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-488423773| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-488423773 |ULTIMATE.start_main_#t~ite37_Out-488423773|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-488423773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-488423773} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-488423773, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-488423773, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-488423773|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:56:19,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In542041791 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In542041791 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In542041791 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In542041791 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In542041791 |ULTIMATE.start_main_#t~ite38_Out542041791|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out542041791| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In542041791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In542041791, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In542041791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In542041791} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In542041791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In542041791, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out542041791|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In542041791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In542041791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:56:19,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1138488694 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1138488694 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1138488694 |ULTIMATE.start_main_#t~ite39_Out1138488694|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out1138488694|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1138488694, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1138488694} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1138488694, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1138488694|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1138488694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:56:19,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In554655133 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In554655133 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In554655133 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In554655133 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out554655133| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out554655133| ~y$r_buff1_thd0~0_In554655133) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In554655133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In554655133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In554655133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In554655133} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out554655133|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In554655133, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In554655133, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In554655133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In554655133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:56:19,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= v_~__unbuffered_p2_EBX~0_41 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p1_EAX~0_44) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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-27 16:56:19,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:56:19 BasicIcfg [2019-12-27 16:56:19,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:56:19,892 INFO L168 Benchmark]: Toolchain (without parser) took 22728.01 ms. Allocated memory was 146.8 MB in the beginning and 726.7 MB in the end (delta: 579.9 MB). Free memory was 103.2 MB in the beginning and 571.9 MB in the end (delta: -468.7 MB). Peak memory consumption was 521.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:56:19,893 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:56:19,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.59 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 103.0 MB in the beginning and 157.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:56:19,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 205.5 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:56:19,895 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:56:19,896 INFO L168 Benchmark]: RCFGBuilder took 830.08 ms. Allocated memory is still 205.5 MB. Free memory was 153.0 MB in the beginning and 109.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:56:19,896 INFO L168 Benchmark]: TraceAbstraction took 20928.63 ms. Allocated memory was 205.5 MB in the beginning and 726.7 MB in the end (delta: 521.1 MB). Free memory was 109.0 MB in the beginning and 571.9 MB in the end (delta: -462.9 MB). Peak memory consumption was 468.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:56:19,901 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 863.59 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 103.0 MB in the beginning and 157.8 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.48 ms. Allocated memory is still 205.5 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 153.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.08 ms. Allocated memory is still 205.5 MB. Free memory was 153.0 MB in the beginning and 109.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20928.63 ms. Allocated memory was 205.5 MB in the beginning and 726.7 MB in the end (delta: 521.1 MB). Free memory was 109.0 MB in the beginning and 571.9 MB in the end (delta: -462.9 MB). Peak memory consumption was 468.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 22 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 158 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 41572 CheckedPairsTotal, 112 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 [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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __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=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] [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) [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: 20.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1447 SDtfs, 2531 SDslu, 3911 SDs, 0 SdLazy, 4262 SolverSat, 286 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.6s 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: 1.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 4984 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 38784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...