/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/rfi004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:08:19,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:08:19,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:08:19,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:08:19,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:08:19,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:08:19,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:08:19,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:08:19,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:08:19,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:08:19,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:08:19,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:08:19,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:08:19,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:08:19,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:08:19,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:08:19,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:08:19,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:08:19,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:08:19,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:08:19,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:08:19,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:08:19,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:08:19,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:08:19,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:08:19,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:08:19,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:08:19,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:08:19,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:08:19,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:08:19,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:08:19,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:08:19,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:08:19,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:08:19,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:08:19,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:08:19,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:08:19,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:08:19,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:08:19,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:08:19,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:08:19,220 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 07:08:19,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:08:19,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:08:19,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:08:19,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:08:19,236 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:08:19,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:08:19,237 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:08:19,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:08:19,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:08:19,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:08:19,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:08:19,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:08:19,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:08:19,238 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:08:19,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:08:19,239 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:08:19,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:08:19,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:08:19,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:08:19,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:08:19,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:08:19,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:08:19,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:08:19,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:08:19,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:08:19,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:08:19,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:08:19,241 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:08:19,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:08:19,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:08:19,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:08:19,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:08:19,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:08:19,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:08:19,553 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:08:19,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-27 07:08:19,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/269bcbaba/3f88aeca81624c1bb75eb7bb424a91d0/FLAG49da9201d [2019-12-27 07:08:20,243 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:08:20,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_pso.oepc.i [2019-12-27 07:08:20,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/269bcbaba/3f88aeca81624c1bb75eb7bb424a91d0/FLAG49da9201d [2019-12-27 07:08:20,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/269bcbaba/3f88aeca81624c1bb75eb7bb424a91d0 [2019-12-27 07:08:20,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:08:20,515 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:08:20,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:20,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:08:20,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:08:20,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183e0aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:20, skipping insertion in model container [2019-12-27 07:08:20,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:08:20" (1/1) ... [2019-12-27 07:08:20,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:08:20,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:08:21,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:21,127 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:08:21,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:08:21,286 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:08:21,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21 WrapperNode [2019-12-27 07:08:21,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:08:21,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:21,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:08:21,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:08:21,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:08:21,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:08:21,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:08:21,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:08:21,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (1/1) ... [2019-12-27 07:08:21,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:08:21,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:08:21,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:08:21,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:08:21,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (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 07:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:08:21,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:08:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:08:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:08:21,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:08:21,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:08:21,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:08:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:08:21,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:08:21,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:08:21,474 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 07:08:22,152 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:08:22,152 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:08:22,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:22 BoogieIcfgContainer [2019-12-27 07:08:22,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:08:22,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:08:22,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:08:22,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:08:22,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:08:20" (1/3) ... [2019-12-27 07:08:22,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ddf7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:22, skipping insertion in model container [2019-12-27 07:08:22,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:08:21" (2/3) ... [2019-12-27 07:08:22,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ddf7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:08:22, skipping insertion in model container [2019-12-27 07:08:22,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:08:22" (3/3) ... [2019-12-27 07:08:22,165 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i [2019-12-27 07:08:22,177 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:08:22,178 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:08:22,191 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:08:22,192 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:08:22,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,296 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,296 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,329 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,329 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:08:22,352 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:08:22,378 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:08:22,378 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:08:22,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:08:22,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:08:22,379 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:08:22,379 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:08:22,379 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:08:22,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:08:22,412 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 07:08:22,415 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:22,497 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:22,497 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:22,510 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:22,527 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 07:08:22,569 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 07:08:22,569 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:08:22,574 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 07:08:22,587 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 07:08:22,588 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:08:25,390 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:08:25,500 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:08:25,548 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-27 07:08:25,548 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 07:08:25,551 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-27 07:08:25,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-27 07:08:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-27 07:08:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:08:25,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:25,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:08:25,969 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-27 07:08:25,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:25,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433187349] [2019-12-27 07:08:25,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:26,231 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 07:08:26,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433187349] [2019-12-27 07:08:26,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:26,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:26,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329382264] [2019-12-27 07:08:26,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:26,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:26,254 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-27 07:08:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:26,572 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-27 07:08:26,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:26,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:08:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:26,656 INFO L225 Difference]: With dead ends: 6863 [2019-12-27 07:08:26,656 INFO L226 Difference]: Without dead ends: 6460 [2019-12-27 07:08:26,657 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 07:08:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-27 07:08:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-27 07:08:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-27 07:08:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-27 07:08:27,032 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-27 07:08:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:27,033 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-27 07:08:27,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-27 07:08:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:08:27,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:27,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:27,038 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-27 07:08:27,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:27,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332431528] [2019-12-27 07:08:27,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:27,165 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 07:08:27,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332431528] [2019-12-27 07:08:27,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:27,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:27,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047318622] [2019-12-27 07:08:27,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:27,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:27,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:27,168 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-27 07:08:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:27,686 INFO L93 Difference]: Finished difference Result 9760 states and 31457 transitions. [2019-12-27 07:08:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:27,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:08:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:27,756 INFO L225 Difference]: With dead ends: 9760 [2019-12-27 07:08:27,756 INFO L226 Difference]: Without dead ends: 9746 [2019-12-27 07:08:27,757 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 07:08:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9746 states. [2019-12-27 07:08:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9746 to 8836. [2019-12-27 07:08:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-12-27 07:08:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 28954 transitions. [2019-12-27 07:08:28,084 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 28954 transitions. Word has length 11 [2019-12-27 07:08:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:28,084 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 28954 transitions. [2019-12-27 07:08:28,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 28954 transitions. [2019-12-27 07:08:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:28,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:28,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:28,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:28,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-27 07:08:28,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:28,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845133872] [2019-12-27 07:08:28,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:28,152 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 07:08:28,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845133872] [2019-12-27 07:08:28,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:28,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:28,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606458709] [2019-12-27 07:08:28,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:28,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:28,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:28,155 INFO L87 Difference]: Start difference. First operand 8836 states and 28954 transitions. Second operand 3 states. [2019-12-27 07:08:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:28,374 INFO L93 Difference]: Finished difference Result 12018 states and 39361 transitions. [2019-12-27 07:08:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:28,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:08:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:28,416 INFO L225 Difference]: With dead ends: 12018 [2019-12-27 07:08:28,416 INFO L226 Difference]: Without dead ends: 12018 [2019-12-27 07:08:28,416 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 07:08:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12018 states. [2019-12-27 07:08:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 11066. [2019-12-27 07:08:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11066 states. [2019-12-27 07:08:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 36521 transitions. [2019-12-27 07:08:29,319 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 36521 transitions. Word has length 14 [2019-12-27 07:08:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:29,321 INFO L462 AbstractCegarLoop]: Abstraction has 11066 states and 36521 transitions. [2019-12-27 07:08:29,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 36521 transitions. [2019-12-27 07:08:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:29,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:29,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:29,324 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-27 07:08:29,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:29,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360372788] [2019-12-27 07:08:29,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:29,426 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 07:08:29,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360372788] [2019-12-27 07:08:29,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:29,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:29,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30381351] [2019-12-27 07:08:29,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:29,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:29,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:29,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:29,428 INFO L87 Difference]: Start difference. First operand 11066 states and 36521 transitions. Second operand 4 states. [2019-12-27 07:08:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:29,657 INFO L93 Difference]: Finished difference Result 13296 states and 42892 transitions. [2019-12-27 07:08:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:29,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:29,808 INFO L225 Difference]: With dead ends: 13296 [2019-12-27 07:08:29,809 INFO L226 Difference]: Without dead ends: 13285 [2019-12-27 07:08:29,809 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 07:08:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2019-12-27 07:08:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 12030. [2019-12-27 07:08:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-12-27 07:08:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 39340 transitions. [2019-12-27 07:08:30,158 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 39340 transitions. Word has length 14 [2019-12-27 07:08:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 39340 transitions. [2019-12-27 07:08:30,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 39340 transitions. [2019-12-27 07:08:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:08:30,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:30,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:30,163 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-27 07:08:30,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:30,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300263114] [2019-12-27 07:08:30,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:30,204 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 07:08:30,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300263114] [2019-12-27 07:08:30,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:30,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:30,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292775710] [2019-12-27 07:08:30,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:30,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:30,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:30,207 INFO L87 Difference]: Start difference. First operand 12030 states and 39340 transitions. Second operand 4 states. [2019-12-27 07:08:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:30,427 INFO L93 Difference]: Finished difference Result 14351 states and 46280 transitions. [2019-12-27 07:08:30,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:30,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:08:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:30,481 INFO L225 Difference]: With dead ends: 14351 [2019-12-27 07:08:30,481 INFO L226 Difference]: Without dead ends: 14338 [2019-12-27 07:08:30,481 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 07:08:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-12-27 07:08:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 12371. [2019-12-27 07:08:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-27 07:08:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 40477 transitions. [2019-12-27 07:08:31,022 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 40477 transitions. Word has length 14 [2019-12-27 07:08:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:31,022 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 40477 transitions. [2019-12-27 07:08:31,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 40477 transitions. [2019-12-27 07:08:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:08:31,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:31,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:31,030 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1929456170, now seen corresponding path program 1 times [2019-12-27 07:08:31,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:31,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263109113] [2019-12-27 07:08:31,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:31,068 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 07:08:31,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263109113] [2019-12-27 07:08:31,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:31,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:08:31,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478321779] [2019-12-27 07:08:31,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:31,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:31,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:31,071 INFO L87 Difference]: Start difference. First operand 12371 states and 40477 transitions. Second operand 3 states. [2019-12-27 07:08:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:31,121 INFO L93 Difference]: Finished difference Result 12224 states and 39993 transitions. [2019-12-27 07:08:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:31,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:08:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:31,149 INFO L225 Difference]: With dead ends: 12224 [2019-12-27 07:08:31,149 INFO L226 Difference]: Without dead ends: 12224 [2019-12-27 07:08:31,149 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 07:08:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2019-12-27 07:08:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12224. [2019-12-27 07:08:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12224 states. [2019-12-27 07:08:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12224 states to 12224 states and 39993 transitions. [2019-12-27 07:08:31,678 INFO L78 Accepts]: Start accepts. Automaton has 12224 states and 39993 transitions. Word has length 16 [2019-12-27 07:08:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:31,678 INFO L462 AbstractCegarLoop]: Abstraction has 12224 states and 39993 transitions. [2019-12-27 07:08:31,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 12224 states and 39993 transitions. [2019-12-27 07:08:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:08:31,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:31,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:08:31,690 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 324203655, now seen corresponding path program 1 times [2019-12-27 07:08:31,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:31,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562557659] [2019-12-27 07:08:31,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:31,762 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 07:08:31,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562557659] [2019-12-27 07:08:31,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:31,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:31,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022389260] [2019-12-27 07:08:31,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:31,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:31,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:31,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:31,765 INFO L87 Difference]: Start difference. First operand 12224 states and 39993 transitions. Second operand 4 states. [2019-12-27 07:08:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:31,815 INFO L93 Difference]: Finished difference Result 2579 states and 6836 transitions. [2019-12-27 07:08:31,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:31,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:08:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:31,820 INFO L225 Difference]: With dead ends: 2579 [2019-12-27 07:08:31,820 INFO L226 Difference]: Without dead ends: 1835 [2019-12-27 07:08:31,821 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 07:08:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-12-27 07:08:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1835. [2019-12-27 07:08:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2019-12-27 07:08:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 4472 transitions. [2019-12-27 07:08:31,867 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 4472 transitions. Word has length 17 [2019-12-27 07:08:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:31,868 INFO L462 AbstractCegarLoop]: Abstraction has 1835 states and 4472 transitions. [2019-12-27 07:08:31,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 4472 transitions. [2019-12-27 07:08:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:31,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:31,873 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] [2019-12-27 07:08:31,873 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:31,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-27 07:08:31,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:31,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259916553] [2019-12-27 07:08:31,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:31,919 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 07:08:31,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259916553] [2019-12-27 07:08:31,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:31,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:31,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563340191] [2019-12-27 07:08:31,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:31,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:31,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:31,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:31,922 INFO L87 Difference]: Start difference. First operand 1835 states and 4472 transitions. Second operand 3 states. [2019-12-27 07:08:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:31,976 INFO L93 Difference]: Finished difference Result 2395 states and 5562 transitions. [2019-12-27 07:08:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:31,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 07:08:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:31,980 INFO L225 Difference]: With dead ends: 2395 [2019-12-27 07:08:31,980 INFO L226 Difference]: Without dead ends: 2395 [2019-12-27 07:08:31,981 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 07:08:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-27 07:08:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1775. [2019-12-27 07:08:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-12-27 07:08:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 4059 transitions. [2019-12-27 07:08:32,015 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 4059 transitions. Word has length 26 [2019-12-27 07:08:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,015 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 4059 transitions. [2019-12-27 07:08:32,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 4059 transitions. [2019-12-27 07:08:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:32,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,020 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] [2019-12-27 07:08:32,020 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,020 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-27 07:08:32,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035014930] [2019-12-27 07:08:32,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,135 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 07:08:32,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035014930] [2019-12-27 07:08:32,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:32,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273390962] [2019-12-27 07:08:32,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:32,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:32,138 INFO L87 Difference]: Start difference. First operand 1775 states and 4059 transitions. Second operand 5 states. [2019-12-27 07:08:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:32,331 INFO L93 Difference]: Finished difference Result 2308 states and 5281 transitions. [2019-12-27 07:08:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:32,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:08:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:32,335 INFO L225 Difference]: With dead ends: 2308 [2019-12-27 07:08:32,336 INFO L226 Difference]: Without dead ends: 2306 [2019-12-27 07:08:32,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2019-12-27 07:08:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1867. [2019-12-27 07:08:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-27 07:08:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4281 transitions. [2019-12-27 07:08:32,370 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4281 transitions. Word has length 26 [2019-12-27 07:08:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,371 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4281 transitions. [2019-12-27 07:08:32,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4281 transitions. [2019-12-27 07:08:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:08:32,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,374 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] [2019-12-27 07:08:32,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,375 INFO L82 PathProgramCache]: Analyzing trace with hash -895166994, now seen corresponding path program 1 times [2019-12-27 07:08:32,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18629136] [2019-12-27 07:08:32,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,424 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 07:08:32,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18629136] [2019-12-27 07:08:32,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:08:32,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21854500] [2019-12-27 07:08:32,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:08:32,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:08:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:08:32,426 INFO L87 Difference]: Start difference. First operand 1867 states and 4281 transitions. Second operand 3 states. [2019-12-27 07:08:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:32,447 INFO L93 Difference]: Finished difference Result 1799 states and 4059 transitions. [2019-12-27 07:08:32,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:08:32,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 07:08:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:32,451 INFO L225 Difference]: With dead ends: 1799 [2019-12-27 07:08:32,452 INFO L226 Difference]: Without dead ends: 1799 [2019-12-27 07:08:32,452 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 07:08:32,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-12-27 07:08:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1647. [2019-12-27 07:08:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-27 07:08:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3725 transitions. [2019-12-27 07:08:32,486 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3725 transitions. Word has length 26 [2019-12-27 07:08:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,486 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 3725 transitions. [2019-12-27 07:08:32,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:08:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3725 transitions. [2019-12-27 07:08:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:32,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,491 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 07:08:32,491 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-27 07:08:32,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479858133] [2019-12-27 07:08:32,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,568 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 07:08:32,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479858133] [2019-12-27 07:08:32,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:32,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955344219] [2019-12-27 07:08:32,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:32,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:32,571 INFO L87 Difference]: Start difference. First operand 1647 states and 3725 transitions. Second operand 5 states. [2019-12-27 07:08:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:32,766 INFO L93 Difference]: Finished difference Result 2085 states and 4728 transitions. [2019-12-27 07:08:32,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:08:32,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:32,769 INFO L225 Difference]: With dead ends: 2085 [2019-12-27 07:08:32,769 INFO L226 Difference]: Without dead ends: 2083 [2019-12-27 07:08:32,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-12-27 07:08:32,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1574. [2019-12-27 07:08:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-12-27 07:08:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 3550 transitions. [2019-12-27 07:08:32,798 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 3550 transitions. Word has length 27 [2019-12-27 07:08:32,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,798 INFO L462 AbstractCegarLoop]: Abstraction has 1574 states and 3550 transitions. [2019-12-27 07:08:32,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 3550 transitions. [2019-12-27 07:08:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:08:32,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,802 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 07:08:32,802 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-27 07:08:32,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176406944] [2019-12-27 07:08:32,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,873 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 07:08:32,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176406944] [2019-12-27 07:08:32,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:08:32,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250580537] [2019-12-27 07:08:32,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:08:32,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:08:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:08:32,875 INFO L87 Difference]: Start difference. First operand 1574 states and 3550 transitions. Second operand 5 states. [2019-12-27 07:08:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:32,918 INFO L93 Difference]: Finished difference Result 781 states and 1674 transitions. [2019-12-27 07:08:32,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:08:32,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:08:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:32,920 INFO L225 Difference]: With dead ends: 781 [2019-12-27 07:08:32,920 INFO L226 Difference]: Without dead ends: 707 [2019-12-27 07:08:32,920 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 07:08:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-27 07:08:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-12-27 07:08:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-27 07:08:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1503 transitions. [2019-12-27 07:08:32,930 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1503 transitions. Word has length 27 [2019-12-27 07:08:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:32,930 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1503 transitions. [2019-12-27 07:08:32,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:08:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1503 transitions. [2019-12-27 07:08:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:32,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:32,933 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] [2019-12-27 07:08:32,933 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:32,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1133197983, now seen corresponding path program 1 times [2019-12-27 07:08:32,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:32,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258832598] [2019-12-27 07:08:32,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:32,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 07:08:32,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258832598] [2019-12-27 07:08:32,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:32,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:08:32,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166752470] [2019-12-27 07:08:32,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:08:32,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:32,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:08:32,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:08:32,998 INFO L87 Difference]: Start difference. First operand 707 states and 1503 transitions. Second operand 4 states. [2019-12-27 07:08:33,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:33,238 INFO L93 Difference]: Finished difference Result 1173 states and 2520 transitions. [2019-12-27 07:08:33,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:08:33,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 07:08:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:33,239 INFO L225 Difference]: With dead ends: 1173 [2019-12-27 07:08:33,239 INFO L226 Difference]: Without dead ends: 486 [2019-12-27 07:08:33,240 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 07:08:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-27 07:08:33,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-27 07:08:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-27 07:08:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1050 transitions. [2019-12-27 07:08:33,249 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1050 transitions. Word has length 42 [2019-12-27 07:08:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:33,249 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1050 transitions. [2019-12-27 07:08:33,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:08:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1050 transitions. [2019-12-27 07:08:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:33,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:33,251 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] [2019-12-27 07:08:33,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1118913551, now seen corresponding path program 2 times [2019-12-27 07:08:33,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:33,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762719495] [2019-12-27 07:08:33,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:08:33,351 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 07:08:33,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762719495] [2019-12-27 07:08:33,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:08:33,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:08:33,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635840835] [2019-12-27 07:08:33,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:08:33,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:08:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:08:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:08:33,353 INFO L87 Difference]: Start difference. First operand 486 states and 1050 transitions. Second operand 7 states. [2019-12-27 07:08:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:08:33,531 INFO L93 Difference]: Finished difference Result 887 states and 1866 transitions. [2019-12-27 07:08:33,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:08:33,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 07:08:33,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:08:33,532 INFO L225 Difference]: With dead ends: 887 [2019-12-27 07:08:33,532 INFO L226 Difference]: Without dead ends: 593 [2019-12-27 07:08:33,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:08:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-27 07:08:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 527. [2019-12-27 07:08:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-27 07:08:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1106 transitions. [2019-12-27 07:08:33,542 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1106 transitions. Word has length 42 [2019-12-27 07:08:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:08:33,542 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1106 transitions. [2019-12-27 07:08:33,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:08:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1106 transitions. [2019-12-27 07:08:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:08:33,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:08:33,544 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] [2019-12-27 07:08:33,544 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:08:33,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:08:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 3 times [2019-12-27 07:08:33,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:08:33,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961916260] [2019-12-27 07:08:33,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:08:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:08:33,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:08:33,692 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:08:33,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1653~0.base_19| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) (= v_~y$r_buff0_thd1~0_65 0) (= 0 v_~y$r_buff1_thd2~0_17) (= (store .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19| 1) |v_#valid_38|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1653~0.base_19|) 0) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1653~0.base_19|) |v_ULTIMATE.start_main_~#t1653~0.offset_17| 0)) |v_#memory_int_11|) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t1653~0.offset_17|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ULTIMATE.start_main_~#t1653~0.offset=|v_ULTIMATE.start_main_~#t1653~0.offset_17|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_22|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1653~0.base=|v_ULTIMATE.start_main_~#t1653~0.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1654~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ULTIMATE.start_main_~#t1653~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1654~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1653~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:08:33,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1654~0.base_9| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1654~0.base_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1654~0.base_9|) |v_ULTIMATE.start_main_~#t1654~0.offset_8| 1))) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1654~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1654~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1654~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1654~0.offset=|v_ULTIMATE.start_main_~#t1654~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1654~0.base=|v_ULTIMATE.start_main_~#t1654~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1654~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1654~0.base] because there is no mapped edge [2019-12-27 07:08:33,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:08:33,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In306236726 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In306236726 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In306236726 |P1Thread1of1ForFork0_#t~ite28_Out306236726|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out306236726|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In306236726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In306236726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In306236726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In306236726, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out306236726|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:08:33,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1092276412 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1092276412 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1092276412 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1092276412 256)))) (or (and (= ~y$w_buff1_used~0_In-1092276412 |P1Thread1of1ForFork0_#t~ite29_Out-1092276412|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1092276412|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092276412, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092276412, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092276412, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092276412} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092276412, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092276412, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092276412, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1092276412|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092276412} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:08:33,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-494575295 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-494575295 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out-494575295 ~y$r_buff0_thd2~0_In-494575295) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd2~0_Out-494575295 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-494575295, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-494575295} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-494575295, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-494575295|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-494575295} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:08:33,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1599729869 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite17_Out-1599729869| ~y$w_buff1_used~0_In-1599729869) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1599729869 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1599729869 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd1~0_In-1599729869 256)) .cse0) (= (mod ~y$w_buff0_used~0_In-1599729869 256) 0))) (= |P0Thread1of1ForFork1_#t~ite18_Out-1599729869| |P0Thread1of1ForFork1_#t~ite17_Out-1599729869|) .cse1) (and (= |P0Thread1of1ForFork1_#t~ite17_In-1599729869| |P0Thread1of1ForFork1_#t~ite17_Out-1599729869|) (= |P0Thread1of1ForFork1_#t~ite18_Out-1599729869| ~y$w_buff1_used~0_In-1599729869) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1599729869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599729869, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1599729869, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-1599729869|, ~weak$$choice2~0=~weak$$choice2~0_In-1599729869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1599729869} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1599729869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599729869, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1599729869, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-1599729869|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-1599729869|, ~weak$$choice2~0=~weak$$choice2~0_In-1599729869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1599729869} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 07:08:33,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:08:33,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 07:08:33,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1868750008 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1868750008 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1868750008 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1868750008 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1868750008| ~y$r_buff1_thd2~0_In1868750008) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1868750008| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1868750008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1868750008, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1868750008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1868750008} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1868750008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1868750008, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1868750008|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1868750008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1868750008} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:08:33,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:08:33,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:08:33,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In431609643 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In431609643 256)))) (or (and (= ~y~0_In431609643 |ULTIMATE.start_main_#t~ite34_Out431609643|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite34_Out431609643| ~y$w_buff1~0_In431609643) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In431609643, ~y~0=~y~0_In431609643, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In431609643, ~y$w_buff1_used~0=~y$w_buff1_used~0_In431609643} OutVars{~y$w_buff1~0=~y$w_buff1~0_In431609643, ~y~0=~y~0_In431609643, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In431609643, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out431609643|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In431609643} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:33,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 07:08:33,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1361446037 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1361446037 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1361446037|)) (and (= |ULTIMATE.start_main_#t~ite36_Out1361446037| ~y$w_buff0_used~0_In1361446037) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1361446037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1361446037} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1361446037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1361446037, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1361446037|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 07:08:33,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In926818522 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In926818522 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In926818522 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In926818522 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In926818522 |ULTIMATE.start_main_#t~ite37_Out926818522|)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out926818522|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In926818522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In926818522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In926818522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In926818522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In926818522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In926818522, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out926818522|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In926818522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In926818522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 07:08:33,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-913739289 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-913739289 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-913739289| ~y$r_buff0_thd0~0_In-913739289)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-913739289|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-913739289, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-913739289} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-913739289, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-913739289, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-913739289|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:08:33,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-235086270 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-235086270 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-235086270 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-235086270 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-235086270|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-235086270 |ULTIMATE.start_main_#t~ite39_Out-235086270|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-235086270, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-235086270, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-235086270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-235086270} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-235086270, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-235086270|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-235086270, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-235086270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-235086270} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 07:08:33,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:08:33,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:08:33 BasicIcfg [2019-12-27 07:08:33,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:08:33,810 INFO L168 Benchmark]: Toolchain (without parser) took 13295.61 ms. Allocated memory was 145.2 MB in the beginning and 608.2 MB in the end (delta: 462.9 MB). Free memory was 101.4 MB in the beginning and 489.3 MB in the end (delta: -387.9 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:33,811 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 07:08:33,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.61 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:33,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.99 ms. Allocated memory is still 202.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:33,813 INFO L168 Benchmark]: Boogie Preprocessor took 36.80 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:33,814 INFO L168 Benchmark]: RCFGBuilder took 752.82 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 111.4 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:33,815 INFO L168 Benchmark]: TraceAbstraction took 11653.60 ms. Allocated memory was 202.4 MB in the beginning and 608.2 MB in the end (delta: 405.8 MB). Free memory was 110.7 MB in the beginning and 489.3 MB in the end (delta: -378.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:08:33,819 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.61 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.99 ms. Allocated memory is still 202.4 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.80 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 752.82 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 111.4 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11653.60 ms. Allocated memory was 202.4 MB in the beginning and 608.2 MB in the end (delta: 405.8 MB). Free memory was 110.7 MB in the beginning and 489.3 MB in the end (delta: -378.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 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) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1466 SDtfs, 1344 SDslu, 2162 SDs, 0 SdLazy, 892 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12371occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 6870 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 21776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...