/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:30:00,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:30:00,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:30:00,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:30:00,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:30:00,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:30:00,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:30:00,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:30:00,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:30:00,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:30:00,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:30:00,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:30:00,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:30:00,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:30:00,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:30:00,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:30:00,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:30:00,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:30:00,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:30:00,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:30:00,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:30:00,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:30:00,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:30:00,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:30:00,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:30:00,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:30:00,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:30:00,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:30:00,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:30:00,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:30:00,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:30:00,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:30:00,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:30:00,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:30:00,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:30:00,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:30:00,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:30:00,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:30:00,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:30:00,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:30:00,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:30:00,208 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:30:00,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:30:00,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:30:00,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:30:00,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:30:00,224 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:30:00,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:30:00,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:30:00,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:30:00,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:30:00,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:30:00,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:30:00,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:30:00,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:30:00,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:30:00,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:30:00,226 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:30:00,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:30:00,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:30:00,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:30:00,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:30:00,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:30:00,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:30:00,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:30:00,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:30:00,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:30:00,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:30:00,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:30:00,228 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:30:00,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:30:00,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:30:00,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:30:00,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:30:00,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:30:00,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:30:00,510 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:30:00,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-27 06:30:00,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f7b399/ca93902b95054eed82140dd1a08bab2c/FLAG64372bd2b [2019-12-27 06:30:01,111 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:30:01,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_tso.opt.i [2019-12-27 06:30:01,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f7b399/ca93902b95054eed82140dd1a08bab2c/FLAG64372bd2b [2019-12-27 06:30:01,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f7b399/ca93902b95054eed82140dd1a08bab2c [2019-12-27 06:30:01,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:30:01,411 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:30:01,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:30:01,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:30:01,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:30:01,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:30:01" (1/1) ... [2019-12-27 06:30:01,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:01, skipping insertion in model container [2019-12-27 06:30:01,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:30:01" (1/1) ... [2019-12-27 06:30:01,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:30:01,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:30:02,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:30:02,109 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:30:02,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:30:02,276 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:30:02,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02 WrapperNode [2019-12-27 06:30:02,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:30:02,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:30:02,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:30:02,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:30:02,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:30:02,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:30:02,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:30:02,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:30:02,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... [2019-12-27 06:30:02,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:30:02,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:30:02,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:30:02,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:30:02,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:30:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:30:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:30:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:30:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:30:02,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:30:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:30:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:30:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:30:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:30:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:30:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:30:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:30:02,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:30:02,460 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 06:30:03,145 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:30:03,145 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:30:03,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:30:03 BoogieIcfgContainer [2019-12-27 06:30:03,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:30:03,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:30:03,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:30:03,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:30:03,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:30:01" (1/3) ... [2019-12-27 06:30:03,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518d374f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:30:03, skipping insertion in model container [2019-12-27 06:30:03,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:30:02" (2/3) ... [2019-12-27 06:30:03,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518d374f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:30:03, skipping insertion in model container [2019-12-27 06:30:03,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:30:03" (3/3) ... [2019-12-27 06:30:03,155 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt.i [2019-12-27 06:30:03,166 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:30:03,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:30:03,175 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:30:03,176 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:30:03,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,217 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,217 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,226 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,227 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,227 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,227 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,228 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,245 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,245 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,246 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:30:03,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:30:03,315 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:30:03,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:30:03,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:30:03,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:30:03,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:30:03,316 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:30:03,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:30:03,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:30:03,334 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-27 06:30:03,336 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 06:30:03,431 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 06:30:03,431 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:30:03,448 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:30:03,474 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-27 06:30:03,534 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-27 06:30:03,534 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:30:03,550 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:30:03,571 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:30:03,572 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:30:06,871 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 06:30:07,218 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:30:07,348 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:30:07,365 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-27 06:30:07,365 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 06:30:07,368 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-27 06:30:08,307 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-27 06:30:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-27 06:30:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:30:08,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:08,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:08,369 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 06:30:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-27 06:30:08,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:08,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408989757] [2019-12-27 06:30:08,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:08,630 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 06:30:08,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408989757] [2019-12-27 06:30:08,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:08,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:30:08,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415163565] [2019-12-27 06:30:08,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:08,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:08,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:08,657 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-27 06:30:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:09,029 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-27 06:30:09,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:09,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:30:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:09,205 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 06:30:09,206 INFO L226 Difference]: Without dead ends: 13870 [2019-12-27 06:30:09,210 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 06:30:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-27 06:30:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-27 06:30:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-27 06:30:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-27 06:30:09,965 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-27 06:30:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:09,966 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-27 06:30:09,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-27 06:30:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:30:09,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:09,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:09,972 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 06:30:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-27 06:30:09,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:09,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015843170] [2019-12-27 06:30:09,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:10,092 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 06:30:10,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015843170] [2019-12-27 06:30:10,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:10,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:10,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668403314] [2019-12-27 06:30:10,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:10,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:10,097 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-27 06:30:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:11,306 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-27 06:30:11,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:11,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:30:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:11,382 INFO L225 Difference]: With dead ends: 19034 [2019-12-27 06:30:11,383 INFO L226 Difference]: Without dead ends: 19034 [2019-12-27 06:30:11,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-27 06:30:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-27 06:30:12,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-27 06:30:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-27 06:30:12,099 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-27 06:30:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:12,100 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-27 06:30:12,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-27 06:30:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:30:12,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:12,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:12,104 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 06:30:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-27 06:30:12,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:12,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435946515] [2019-12-27 06:30:12,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:12,179 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 06:30:12,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435946515] [2019-12-27 06:30:12,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:12,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:12,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112691309] [2019-12-27 06:30:12,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:12,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:12,182 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 4 states. [2019-12-27 06:30:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:12,536 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-27 06:30:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:12,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:30:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:12,642 INFO L225 Difference]: With dead ends: 27022 [2019-12-27 06:30:12,643 INFO L226 Difference]: Without dead ends: 27008 [2019-12-27 06:30:12,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-27 06:30:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-27 06:30:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-27 06:30:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-27 06:30:14,893 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-27 06:30:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:14,894 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-27 06:30:14,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-27 06:30:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 06:30:14,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:14,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:14,905 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 06:30:14,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:14,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-27 06:30:14,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:14,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687375117] [2019-12-27 06:30:14,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:14,996 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 06:30:14,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687375117] [2019-12-27 06:30:14,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:14,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:14,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989532334] [2019-12-27 06:30:14,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:14,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:14,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:14,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:14,999 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-27 06:30:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:15,495 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-27 06:30:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:30:15,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 06:30:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:15,605 INFO L225 Difference]: With dead ends: 29780 [2019-12-27 06:30:15,605 INFO L226 Difference]: Without dead ends: 29766 [2019-12-27 06:30:15,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-27 06:30:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-27 06:30:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-27 06:30:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-27 06:30:16,567 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-27 06:30:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:16,567 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-27 06:30:16,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-27 06:30:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:16,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:16,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:16,600 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 06:30:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-27 06:30:16,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:16,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117411441] [2019-12-27 06:30:16,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:16,699 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 06:30:16,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117411441] [2019-12-27 06:30:16,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:16,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:16,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912517283] [2019-12-27 06:30:16,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:16,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:16,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:16,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:16,702 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 6 states. [2019-12-27 06:30:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:17,324 INFO L93 Difference]: Finished difference Result 32226 states and 113712 transitions. [2019-12-27 06:30:17,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:30:17,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:30:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:17,403 INFO L225 Difference]: With dead ends: 32226 [2019-12-27 06:30:17,403 INFO L226 Difference]: Without dead ends: 32194 [2019-12-27 06:30:17,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-27 06:30:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 27516. [2019-12-27 06:30:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27516 states. [2019-12-27 06:30:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27516 states to 27516 states and 97909 transitions. [2019-12-27 06:30:18,490 INFO L78 Accepts]: Start accepts. Automaton has 27516 states and 97909 transitions. Word has length 27 [2019-12-27 06:30:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:18,491 INFO L462 AbstractCegarLoop]: Abstraction has 27516 states and 97909 transitions. [2019-12-27 06:30:18,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 27516 states and 97909 transitions. [2019-12-27 06:30:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:18,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:18,540 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] [2019-12-27 06:30:18,540 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 06:30:18,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash -386322379, now seen corresponding path program 1 times [2019-12-27 06:30:18,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:18,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871211340] [2019-12-27 06:30:18,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:18,600 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 06:30:18,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871211340] [2019-12-27 06:30:18,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:18,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:18,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977332717] [2019-12-27 06:30:18,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:18,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:18,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:18,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:18,604 INFO L87 Difference]: Start difference. First operand 27516 states and 97909 transitions. Second operand 3 states. [2019-12-27 06:30:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:18,783 INFO L93 Difference]: Finished difference Result 34788 states and 124357 transitions. [2019-12-27 06:30:18,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:18,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:30:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:18,853 INFO L225 Difference]: With dead ends: 34788 [2019-12-27 06:30:18,853 INFO L226 Difference]: Without dead ends: 34788 [2019-12-27 06:30:18,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-27 06:30:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 30668. [2019-12-27 06:30:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 06:30:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 110245 transitions. [2019-12-27 06:30:20,815 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 110245 transitions. Word has length 33 [2019-12-27 06:30:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:20,815 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 110245 transitions. [2019-12-27 06:30:20,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 110245 transitions. [2019-12-27 06:30:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:20,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:20,850 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] [2019-12-27 06:30:20,851 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 06:30:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1183375097, now seen corresponding path program 1 times [2019-12-27 06:30:20,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:20,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838111306] [2019-12-27 06:30:20,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:20,918 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 06:30:20,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838111306] [2019-12-27 06:30:20,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:20,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:20,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861484170] [2019-12-27 06:30:20,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:20,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:20,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:20,924 INFO L87 Difference]: Start difference. First operand 30668 states and 110245 transitions. Second operand 3 states. [2019-12-27 06:30:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:21,347 INFO L93 Difference]: Finished difference Result 30668 states and 109909 transitions. [2019-12-27 06:30:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:21,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:30:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:21,405 INFO L225 Difference]: With dead ends: 30668 [2019-12-27 06:30:21,405 INFO L226 Difference]: Without dead ends: 30668 [2019-12-27 06:30:21,405 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 06:30:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-27 06:30:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 30668. [2019-12-27 06:30:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-27 06:30:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 109909 transitions. [2019-12-27 06:30:21,941 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 109909 transitions. Word has length 33 [2019-12-27 06:30:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:21,942 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 109909 transitions. [2019-12-27 06:30:21,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 109909 transitions. [2019-12-27 06:30:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:21,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:21,970 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] [2019-12-27 06:30:21,971 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 06:30:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1422326855, now seen corresponding path program 1 times [2019-12-27 06:30:21,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:21,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345978234] [2019-12-27 06:30:21,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:22,088 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 06:30:22,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345978234] [2019-12-27 06:30:22,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:22,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:22,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389220976] [2019-12-27 06:30:22,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:22,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:22,090 INFO L87 Difference]: Start difference. First operand 30668 states and 109909 transitions. Second operand 7 states. [2019-12-27 06:30:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:23,782 INFO L93 Difference]: Finished difference Result 47574 states and 166546 transitions. [2019-12-27 06:30:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:30:23,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:30:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:23,914 INFO L225 Difference]: With dead ends: 47574 [2019-12-27 06:30:23,914 INFO L226 Difference]: Without dead ends: 47534 [2019-12-27 06:30:23,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:30:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2019-12-27 06:30:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 31416. [2019-12-27 06:30:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31416 states. [2019-12-27 06:30:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31416 states to 31416 states and 112497 transitions. [2019-12-27 06:30:24,861 INFO L78 Accepts]: Start accepts. Automaton has 31416 states and 112497 transitions. Word has length 33 [2019-12-27 06:30:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:24,861 INFO L462 AbstractCegarLoop]: Abstraction has 31416 states and 112497 transitions. [2019-12-27 06:30:24,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31416 states and 112497 transitions. [2019-12-27 06:30:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:24,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:24,891 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] [2019-12-27 06:30:24,891 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 06:30:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash 147370621, now seen corresponding path program 1 times [2019-12-27 06:30:24,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:24,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840717275] [2019-12-27 06:30:24,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:24,975 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 06:30:24,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840717275] [2019-12-27 06:30:24,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:24,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:24,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180509165] [2019-12-27 06:30:24,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:24,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:24,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:24,978 INFO L87 Difference]: Start difference. First operand 31416 states and 112497 transitions. Second operand 7 states. [2019-12-27 06:30:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:25,751 INFO L93 Difference]: Finished difference Result 44276 states and 155683 transitions. [2019-12-27 06:30:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:30:25,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:30:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:25,833 INFO L225 Difference]: With dead ends: 44276 [2019-12-27 06:30:25,833 INFO L226 Difference]: Without dead ends: 44250 [2019-12-27 06:30:25,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:30:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44250 states. [2019-12-27 06:30:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44250 to 35296. [2019-12-27 06:30:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35296 states. [2019-12-27 06:30:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35296 states to 35296 states and 125497 transitions. [2019-12-27 06:30:26,869 INFO L78 Accepts]: Start accepts. Automaton has 35296 states and 125497 transitions. Word has length 33 [2019-12-27 06:30:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:26,869 INFO L462 AbstractCegarLoop]: Abstraction has 35296 states and 125497 transitions. [2019-12-27 06:30:26,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35296 states and 125497 transitions. [2019-12-27 06:30:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:26,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:26,894 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] [2019-12-27 06:30:26,894 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 06:30:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:26,894 INFO L82 PathProgramCache]: Analyzing trace with hash 528874148, now seen corresponding path program 1 times [2019-12-27 06:30:26,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:26,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020616678] [2019-12-27 06:30:26,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:26,960 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 06:30:26,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020616678] [2019-12-27 06:30:26,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:26,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:26,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497386439] [2019-12-27 06:30:26,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:26,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:26,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:26,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:26,962 INFO L87 Difference]: Start difference. First operand 35296 states and 125497 transitions. Second operand 4 states. [2019-12-27 06:30:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:27,045 INFO L93 Difference]: Finished difference Result 20235 states and 61968 transitions. [2019-12-27 06:30:27,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:27,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 06:30:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:27,071 INFO L225 Difference]: With dead ends: 20235 [2019-12-27 06:30:27,071 INFO L226 Difference]: Without dead ends: 19705 [2019-12-27 06:30:27,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2019-12-27 06:30:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 19705. [2019-12-27 06:30:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-27 06:30:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-27 06:30:27,628 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 33 [2019-12-27 06:30:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:27,629 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-27 06:30:27,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-27 06:30:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:30:27,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:27,640 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] [2019-12-27 06:30:27,640 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 06:30:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:27,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-27 06:30:27,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:27,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885520171] [2019-12-27 06:30:27,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:27,699 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 06:30:27,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885520171] [2019-12-27 06:30:27,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:27,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:27,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193982506] [2019-12-27 06:30:27,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:27,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:27,702 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 5 states. [2019-12-27 06:30:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:27,748 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-27 06:30:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:27,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 06:30:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:27,753 INFO L225 Difference]: With dead ends: 2732 [2019-12-27 06:30:27,753 INFO L226 Difference]: Without dead ends: 2423 [2019-12-27 06:30:27,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-27 06:30:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-27 06:30:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-27 06:30:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-27 06:30:27,792 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-27 06:30:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:27,792 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-27 06:30:27,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-27 06:30:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 06:30:27,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:27,795 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 06:30:27,796 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-27 06:30:27,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:27,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740601382] [2019-12-27 06:30:27,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:27,946 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 06:30:27,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740601382] [2019-12-27 06:30:27,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:27,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:27,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952419787] [2019-12-27 06:30:27,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:27,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:27,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:27,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:27,948 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 6 states. [2019-12-27 06:30:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:28,006 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-27 06:30:28,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:30:28,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-27 06:30:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:28,008 INFO L225 Difference]: With dead ends: 706 [2019-12-27 06:30:28,008 INFO L226 Difference]: Without dead ends: 660 [2019-12-27 06:30:28,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-27 06:30:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-27 06:30:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:30:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-27 06:30:28,016 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-27 06:30:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:28,017 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-27 06:30:28,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-27 06:30:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:30:28,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:28,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:28,019 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-27 06:30:28,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:28,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571256960] [2019-12-27 06:30:28,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:28,107 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 06:30:28,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571256960] [2019-12-27 06:30:28,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:28,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:28,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125623473] [2019-12-27 06:30:28,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:28,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:28,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:28,111 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-27 06:30:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:28,296 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-27 06:30:28,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:30:28,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 06:30:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:28,298 INFO L225 Difference]: With dead ends: 875 [2019-12-27 06:30:28,298 INFO L226 Difference]: Without dead ends: 875 [2019-12-27 06:30:28,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-27 06:30:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-27 06:30:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 06:30:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-27 06:30:28,305 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-27 06:30:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:28,306 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-27 06:30:28,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-27 06:30:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:30:28,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:28,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:28,307 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-27 06:30:28,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:28,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756048973] [2019-12-27 06:30:28,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:28,388 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 06:30:28,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756048973] [2019-12-27 06:30:28,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:28,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:28,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775868793] [2019-12-27 06:30:28,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:28,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:28,390 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 3 states. [2019-12-27 06:30:28,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:28,405 INFO L93 Difference]: Finished difference Result 640 states and 1437 transitions. [2019-12-27 06:30:28,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:28,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:30:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:28,406 INFO L225 Difference]: With dead ends: 640 [2019-12-27 06:30:28,406 INFO L226 Difference]: Without dead ends: 640 [2019-12-27 06:30:28,407 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 06:30:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-27 06:30:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 604. [2019-12-27 06:30:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:30:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-27 06:30:28,415 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-27 06:30:28,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:28,416 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-27 06:30:28,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-27 06:30:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:28,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:28,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:28,418 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-27 06:30:28,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:28,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096369029] [2019-12-27 06:30:28,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:28,560 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 06:30:28,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096369029] [2019-12-27 06:30:28,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:28,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:28,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053662369] [2019-12-27 06:30:28,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:28,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:28,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:28,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:28,563 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 7 states. [2019-12-27 06:30:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:28,694 INFO L93 Difference]: Finished difference Result 956 states and 2008 transitions. [2019-12-27 06:30:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:30:28,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 06:30:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:28,696 INFO L225 Difference]: With dead ends: 956 [2019-12-27 06:30:28,696 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 06:30:28,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:30:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 06:30:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 542. [2019-12-27 06:30:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-27 06:30:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-27 06:30:28,705 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-27 06:30:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:28,705 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-27 06:30:28,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-27 06:30:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:28,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:28,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:28,707 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:28,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-27 06:30:28,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:28,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222224639] [2019-12-27 06:30:28,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:29,014 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 06:30:29,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222224639] [2019-12-27 06:30:29,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:29,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:30:29,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274242462] [2019-12-27 06:30:29,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:30:29,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:30:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:30:29,016 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 13 states. [2019-12-27 06:30:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:29,588 INFO L93 Difference]: Finished difference Result 794 states and 1707 transitions. [2019-12-27 06:30:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:30:29,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 06:30:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:29,589 INFO L225 Difference]: With dead ends: 794 [2019-12-27 06:30:29,589 INFO L226 Difference]: Without dead ends: 764 [2019-12-27 06:30:29,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:30:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-27 06:30:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 746. [2019-12-27 06:30:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-27 06:30:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1625 transitions. [2019-12-27 06:30:29,601 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1625 transitions. Word has length 57 [2019-12-27 06:30:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:29,604 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1625 transitions. [2019-12-27 06:30:29,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:30:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1625 transitions. [2019-12-27 06:30:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:30:29,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:29,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:29,609 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:30:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 3 times [2019-12-27 06:30:29,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:29,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074589049] [2019-12-27 06:30:29,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:30:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:30:29,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:30:29,759 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:30:29,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0) (= v_~a~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27| 1) |v_#valid_54|) (= v_~z~0_11 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1126~0.base_27| 4) |v_#length_19|) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1126~0.base_27|) |v_ULTIMATE.start_main_~#t1126~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1126~0.base_27|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1126~0.base_27|) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_~#t1126~0.offset=|v_ULTIMATE.start_main_~#t1126~0.offset_21|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_21|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1126~0.base=|v_ULTIMATE.start_main_~#t1126~0.base_27|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_16|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1127~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1127~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1126~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1128~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_~#t1126~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1128~0.offset, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:30:29,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1127~0.base_9| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1127~0.base_9|) (= |v_ULTIMATE.start_main_~#t1127~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1127~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1127~0.base_9|) |v_ULTIMATE.start_main_~#t1127~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1127~0.base=|v_ULTIMATE.start_main_~#t1127~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1127~0.offset=|v_ULTIMATE.start_main_~#t1127~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1127~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1127~0.offset] because there is no mapped edge [2019-12-27 06:30:29,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1128~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1128~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1128~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1128~0.base_10|) |v_ULTIMATE.start_main_~#t1128~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1128~0.base_10| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1128~0.base_10| 1) |v_#valid_29|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1128~0.base=|v_ULTIMATE.start_main_~#t1128~0.base_10|, ULTIMATE.start_main_~#t1128~0.offset=|v_ULTIMATE.start_main_~#t1128~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1128~0.base, ULTIMATE.start_main_~#t1128~0.offset] because there is no mapped edge [2019-12-27 06:30:29,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (= ~y$r_buff0_thd1~0_In-1032094316 ~y$r_buff1_thd1~0_Out-1032094316) (= ~z~0_Out-1032094316 1) (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1032094316 0)) (= ~__unbuffered_p2_EBX~0_Out-1032094316 ~a~0_In-1032094316) (= ~y$r_buff1_thd2~0_Out-1032094316 ~y$r_buff0_thd2~0_In-1032094316) (= ~y$r_buff1_thd3~0_Out-1032094316 ~y$r_buff0_thd3~0_In-1032094316) (= ~y$r_buff1_thd0~0_Out-1032094316 ~y$r_buff0_thd0~0_In-1032094316) (= ~z~0_Out-1032094316 ~__unbuffered_p2_EAX~0_Out-1032094316) (= 1 ~y$r_buff0_thd3~0_Out-1032094316)) InVars {~a~0=~a~0_In-1032094316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1032094316, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032094316, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1032094316, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1032094316, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1032094316} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-1032094316, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-1032094316, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1032094316, ~a~0=~a~0_In-1032094316, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1032094316, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1032094316, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1032094316, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1032094316, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1032094316, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1032094316, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-1032094316, ~z~0=~z~0_Out-1032094316, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1032094316} 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 06:30:29,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 06:30:29,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite4_Out-1682812259| |P1Thread1of1ForFork0_#t~ite3_Out-1682812259|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1682812259 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1682812259 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In-1682812259 |P1Thread1of1ForFork0_#t~ite3_Out-1682812259|)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite3_Out-1682812259| ~y$w_buff1~0_In-1682812259) (not .cse1) (not .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682812259, ~y$w_buff1~0=~y$w_buff1~0_In-1682812259, ~y~0=~y~0_In-1682812259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682812259} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1682812259, ~y$w_buff1~0=~y$w_buff1~0_In-1682812259, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-1682812259|, ~y~0=~y~0_In-1682812259, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-1682812259|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1682812259} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:30:29,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1400273227 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1400273227 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out1400273227|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1400273227 |P2Thread1of1ForFork1_#t~ite11_Out1400273227|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1400273227, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1400273227} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1400273227, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1400273227|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1400273227} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:30:29,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2039518954 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2039518954 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2039518954 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-2039518954 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-2039518954 |P2Thread1of1ForFork1_#t~ite12_Out-2039518954|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out-2039518954|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2039518954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039518954, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2039518954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039518954} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2039518954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039518954, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2039518954, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-2039518954|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2039518954} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:30:29,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1827756332 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1827756332 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out1827756332 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_Out1827756332 ~y$r_buff0_thd3~0_In1827756332) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1827756332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1827756332} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1827756332|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1827756332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1827756332} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 06:30:29,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In1149405393 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1149405393 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1149405393 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1149405393 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out1149405393|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite14_Out1149405393| ~y$r_buff1_thd3~0_In1149405393) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1149405393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1149405393, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1149405393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1149405393} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1149405393|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1149405393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1149405393, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1149405393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1149405393} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:30:29,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 06:30:29,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1678065001 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1678065001 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out1678065001|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1678065001 |P1Thread1of1ForFork0_#t~ite5_Out1678065001|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1678065001, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1678065001} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1678065001, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1678065001, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1678065001|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:30:29,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In386230949 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In386230949 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In386230949 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In386230949 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out386230949| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite6_Out386230949| ~y$w_buff1_used~0_In386230949)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In386230949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386230949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In386230949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386230949} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In386230949, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386230949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In386230949, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out386230949|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386230949} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:30:29,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-84172787 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-84172787 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-84172787| ~y$r_buff0_thd2~0_In-84172787)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out-84172787| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-84172787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-84172787} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-84172787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-84172787, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-84172787|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:30:29,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In461462491 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In461462491 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In461462491 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In461462491 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite8_Out461462491|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In461462491 |P1Thread1of1ForFork0_#t~ite8_Out461462491|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461462491, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461462491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461462491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461462491} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In461462491, ~y$w_buff0_used~0=~y$w_buff0_used~0_In461462491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In461462491, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out461462491|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In461462491} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:30:29,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 06:30:29,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:30:29,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1365166295 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1365166295 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1365166295| |ULTIMATE.start_main_#t~ite19_Out1365166295|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out1365166295| ~y~0_In1365166295) (or .cse0 .cse1) .cse2) (and (= ~y$w_buff1~0_In1365166295 |ULTIMATE.start_main_#t~ite18_Out1365166295|) (not .cse0) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1365166295, ~y~0=~y~0_In1365166295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1365166295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365166295} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1365166295, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1365166295|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1365166295|, ~y~0=~y~0_In1365166295, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1365166295, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1365166295} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:30:29,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1867879563 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1867879563 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out1867879563|)) (and (= ~y$w_buff0_used~0_In1867879563 |ULTIMATE.start_main_#t~ite20_Out1867879563|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1867879563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1867879563} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1867879563, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1867879563, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1867879563|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:30:29,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1034112489 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1034112489 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1034112489 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1034112489 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1034112489 |ULTIMATE.start_main_#t~ite21_Out-1034112489|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-1034112489|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034112489, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1034112489, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1034112489, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034112489} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1034112489, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1034112489, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1034112489|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1034112489, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1034112489} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:30:29,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In537712156 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In537712156 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out537712156| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out537712156| ~y$r_buff0_thd0~0_In537712156)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In537712156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In537712156} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In537712156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In537712156, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out537712156|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:30:29,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In338560648 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In338560648 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In338560648 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In338560648 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out338560648| 0)) (and (= |ULTIMATE.start_main_#t~ite23_Out338560648| ~y$r_buff1_thd0~0_In338560648) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In338560648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In338560648, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In338560648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In338560648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In338560648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In338560648, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In338560648, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out338560648|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In338560648} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:30:29,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In55458481 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out55458481| ~y$w_buff0~0_In55458481) (= |ULTIMATE.start_main_#t~ite29_Out55458481| |ULTIMATE.start_main_#t~ite30_Out55458481|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In55458481 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In55458481 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In55458481 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In55458481 256)) .cse0))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out55458481| ~y$w_buff0~0_In55458481) (= |ULTIMATE.start_main_#t~ite29_In55458481| |ULTIMATE.start_main_#t~ite29_Out55458481|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In55458481, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In55458481|, ~y$w_buff0~0=~y$w_buff0~0_In55458481, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In55458481, ~weak$$choice2~0=~weak$$choice2~0_In55458481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In55458481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In55458481} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out55458481|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In55458481, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out55458481|, ~y$w_buff0~0=~y$w_buff0~0_In55458481, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In55458481, ~weak$$choice2~0=~weak$$choice2~0_In55458481, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In55458481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In55458481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:30:29,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In728872103 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out728872103| |ULTIMATE.start_main_#t~ite35_Out728872103|) (= |ULTIMATE.start_main_#t~ite35_Out728872103| ~y$w_buff0_used~0_In728872103) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In728872103 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In728872103 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In728872103 256)) (and (= 0 (mod ~y$w_buff1_used~0_In728872103 256)) .cse0))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out728872103| ~y$w_buff0_used~0_In728872103) (= |ULTIMATE.start_main_#t~ite35_In728872103| |ULTIMATE.start_main_#t~ite35_Out728872103|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In728872103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In728872103, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In728872103|, ~weak$$choice2~0=~weak$$choice2~0_In728872103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In728872103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In728872103} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In728872103, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In728872103, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out728872103|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out728872103|, ~weak$$choice2~0=~weak$$choice2~0_In728872103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In728872103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In728872103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:30:29,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In73141477 256)))) (or (and (= ~y$w_buff1_used~0_In73141477 |ULTIMATE.start_main_#t~ite38_Out73141477|) (= |ULTIMATE.start_main_#t~ite39_Out73141477| |ULTIMATE.start_main_#t~ite38_Out73141477|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In73141477 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In73141477 256) 0)) (and (= 0 (mod ~y$r_buff1_thd0~0_In73141477 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In73141477 256)))) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In73141477| |ULTIMATE.start_main_#t~ite38_Out73141477|) (= ~y$w_buff1_used~0_In73141477 |ULTIMATE.start_main_#t~ite39_Out73141477|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In73141477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In73141477, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In73141477|, ~weak$$choice2~0=~weak$$choice2~0_In73141477, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In73141477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In73141477} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In73141477, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out73141477|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In73141477, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out73141477|, ~weak$$choice2~0=~weak$$choice2~0_In73141477, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In73141477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In73141477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:30:29,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:30:29,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse5 (= (mod ~y$w_buff1_used~0_In545008567 256) 0)) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In545008567 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In545008567 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In545008567 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite45_Out545008567| |ULTIMATE.start_main_#t~ite44_Out545008567|)) (.cse0 (= (mod ~weak$$choice2~0_In545008567 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 .cse1 (= 0 |ULTIMATE.start_main_#t~ite43_Out545008567|) (or (not .cse2) .cse3) (not .cse4) (= |ULTIMATE.start_main_#t~ite44_Out545008567| |ULTIMATE.start_main_#t~ite43_Out545008567|) (or (not .cse5) .cse3))) (and (or (and (or (and .cse6 .cse5) .cse4 (and .cse6 .cse2)) .cse0 .cse1 (= ~y$r_buff1_thd0~0_In545008567 |ULTIMATE.start_main_#t~ite44_Out545008567|)) (and (not .cse0) (= ~y$r_buff1_thd0~0_In545008567 |ULTIMATE.start_main_#t~ite45_Out545008567|) (= |ULTIMATE.start_main_#t~ite44_In545008567| |ULTIMATE.start_main_#t~ite44_Out545008567|))) (= |ULTIMATE.start_main_#t~ite43_In545008567| |ULTIMATE.start_main_#t~ite43_Out545008567|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In545008567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545008567, ~weak$$choice2~0=~weak$$choice2~0_In545008567, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In545008567|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545008567, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545008567, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In545008567|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In545008567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In545008567, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out545008567|, ~weak$$choice2~0=~weak$$choice2~0_In545008567, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In545008567, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out545008567|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out545008567|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545008567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:30:29,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:30:29,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:30:29,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:30:29 BasicIcfg [2019-12-27 06:30:29,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:30:29,909 INFO L168 Benchmark]: Toolchain (without parser) took 28498.01 ms. Allocated memory was 145.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 101.3 MB in the beginning and 432.3 MB in the end (delta: -331.0 MB). Peak memory consumption was 863.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:29,910 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:30:29,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:29,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.64 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:29,911 INFO L168 Benchmark]: Boogie Preprocessor took 42.71 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:29,912 INFO L168 Benchmark]: RCFGBuilder took 755.48 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 104.3 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:29,913 INFO L168 Benchmark]: TraceAbstraction took 26759.37 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 103.6 MB in the beginning and 432.3 MB in the end (delta: -328.7 MB). Peak memory consumption was 808.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:30:29,916 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 864.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 156.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.64 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 153.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.71 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 755.48 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 104.3 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26759.37 ms. Allocated memory was 202.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 103.6 MB in the beginning and 432.3 MB in the end (delta: -328.7 MB). Peak memory consumption was 808.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1126, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L814] FCALL, FORK 0 pthread_create(&t1127, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L816] FCALL, FORK 0 pthread_create(&t1128, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=0, weak$$choice2=0, x=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=0, weak$$choice2=0, x=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 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) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1898 SDtfs, 2040 SDslu, 4134 SDs, 0 SdLazy, 2451 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35296occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 47357 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 90225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...