/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:27:25,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:27:25,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:27:25,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:27:25,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:27:25,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:27:25,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:27:25,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:27:25,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:27:25,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:27:25,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:27:25,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:27:25,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:27:25,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:27:25,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:27:25,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:27:25,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:27:25,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:27:25,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:27:25,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:27:25,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:27:25,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:27:25,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:27:25,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:27:25,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:27:25,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:27:25,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:27:25,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:27:25,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:27:25,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:27:25,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:27:25,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:27:25,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:27:25,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:27:25,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:27:25,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:27:25,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:27:25,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:27:25,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:27:25,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:27:25,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:27:25,267 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-MCR.epf [2019-12-27 20:27:25,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:27:25,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:27:25,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:27:25,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:27:25,299 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:27:25,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:27:25,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:27:25,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:27:25,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:27:25,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:27:25,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:27:25,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:27:25,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:27:25,301 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:27:25,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:27:25,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:27:25,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:27:25,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:27:25,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:27:25,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:27:25,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:27:25,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:27:25,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:27:25,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:27:25,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:27:25,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:27:25,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:27:25,304 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:27:25,304 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:27:25,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:27:25,305 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:27:25,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:27:25,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:27:25,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:27:25,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:27:25,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:27:25,635 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:27:25,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-27 20:27:25,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493f131c3/5e853dc4a052419bb570012ab5770c0b/FLAG5731a2169 [2019-12-27 20:27:26,330 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:27:26,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-27 20:27:26,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493f131c3/5e853dc4a052419bb570012ab5770c0b/FLAG5731a2169 [2019-12-27 20:27:26,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493f131c3/5e853dc4a052419bb570012ab5770c0b [2019-12-27 20:27:26,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:27:26,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:27:26,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:26,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:27:26,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:27:26,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:26" (1/1) ... [2019-12-27 20:27:26,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db1bd3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:26, skipping insertion in model container [2019-12-27 20:27:26,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:26" (1/1) ... [2019-12-27 20:27:26,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:27:26,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:27:27,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:27,210 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:27:27,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:27,352 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:27:27,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27 WrapperNode [2019-12-27 20:27:27,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:27,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:27,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:27:27,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:27:27,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:27,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:27:27,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:27:27,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:27:27,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (1/1) ... [2019-12-27 20:27:27,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:27:27,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:27:27,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:27:27,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:27:27,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (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 20:27:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:27:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:27:27,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:27:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:27:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:27:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:27:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:27:27,539 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:27:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:27:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:27:27,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:27:27,542 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 20:27:28,280 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:27:28,280 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:27:28,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:28 BoogieIcfgContainer [2019-12-27 20:27:28,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:27:28,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:27:28,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:27:28,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:27:28,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:27:26" (1/3) ... [2019-12-27 20:27:28,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530527a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:28, skipping insertion in model container [2019-12-27 20:27:28,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:27" (2/3) ... [2019-12-27 20:27:28,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530527a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:28, skipping insertion in model container [2019-12-27 20:27:28,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:28" (3/3) ... [2019-12-27 20:27:28,291 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2019-12-27 20:27:28,302 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:27:28,302 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:27:28,313 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:27:28,314 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:27:28,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,401 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,409 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:28,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:27:28,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:27:28,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:27:28,468 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:27:28,468 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:27:28,468 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:27:28,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:27:28,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:27:28,469 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:27:28,486 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 20:27:28,488 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:27:28,601 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:27:28,601 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:28,616 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:27:28,632 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:27:28,694 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:27:28,694 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:28,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:27:28,713 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:27:28,715 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:27:31,817 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 20:27:32,035 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 20:27:32,140 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 20:27:32,157 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 20:27:32,157 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 20:27:32,160 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 20:27:32,698 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 20:27:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 20:27:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:27:32,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:32,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:27:32,708 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:32,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 20:27:32,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:32,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821544703] [2019-12-27 20:27:32,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:32,958 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 20:27:32,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821544703] [2019-12-27 20:27:32,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:32,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:32,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1846991425] [2019-12-27 20:27:32,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:32,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:32,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:27:32,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:32,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:32,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:32,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:33,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:33,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:33,006 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 20:27:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:33,302 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 20:27:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:33,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:27:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:33,405 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 20:27:33,405 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 20:27:33,407 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 20:27:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 20:27:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 20:27:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 20:27:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 20:27:34,031 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 20:27:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:34,032 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 20:27:34,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 20:27:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:27:34,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:34,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:34,036 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 20:27:34,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:34,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985806883] [2019-12-27 20:27:34,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:34,148 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 20:27:34,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985806883] [2019-12-27 20:27:34,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:34,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:27:34,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759517356] [2019-12-27 20:27:34,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:34,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:34,153 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:27:34,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:34,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:34,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:34,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:34,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:34,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:34,156 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 20:27:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:34,222 INFO L93 Difference]: Finished difference Result 1940 states and 4887 transitions. [2019-12-27 20:27:34,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:27:34,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:27:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:34,231 INFO L225 Difference]: With dead ends: 1940 [2019-12-27 20:27:34,231 INFO L226 Difference]: Without dead ends: 1410 [2019-12-27 20:27:34,232 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 20:27:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-12-27 20:27:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2019-12-27 20:27:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-12-27 20:27:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 3190 transitions. [2019-12-27 20:27:34,271 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 3190 transitions. Word has length 11 [2019-12-27 20:27:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:34,272 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 3190 transitions. [2019-12-27 20:27:34,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 3190 transitions. [2019-12-27 20:27:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:27:34,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:34,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:34,274 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:34,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:34,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 20:27:34,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:34,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526065101] [2019-12-27 20:27:34,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:34,412 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 20:27:34,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526065101] [2019-12-27 20:27:34,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:34,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:34,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [475686841] [2019-12-27 20:27:34,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:34,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:34,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:27:34,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:34,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:34,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:34,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:34,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:34,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:34,424 INFO L87 Difference]: Start difference. First operand 1410 states and 3190 transitions. Second operand 4 states. [2019-12-27 20:27:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:34,638 INFO L93 Difference]: Finished difference Result 1718 states and 3820 transitions. [2019-12-27 20:27:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:34,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:27:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:34,648 INFO L225 Difference]: With dead ends: 1718 [2019-12-27 20:27:34,648 INFO L226 Difference]: Without dead ends: 1718 [2019-12-27 20:27:34,650 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 20:27:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-12-27 20:27:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1654. [2019-12-27 20:27:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 20:27:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-27 20:27:34,703 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 14 [2019-12-27 20:27:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:34,707 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-27 20:27:34,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-27 20:27:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:27:34,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:34,713 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] [2019-12-27 20:27:34,713 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 20:27:34,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:34,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702284521] [2019-12-27 20:27:34,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:34,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 20:27:34,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702284521] [2019-12-27 20:27:34,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:34,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:34,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395459292] [2019-12-27 20:27:34,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:34,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:34,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:27:34,885 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:34,886 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:34,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:34,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:34,887 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-27 20:27:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:35,510 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-27 20:27:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:35,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:27:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:35,535 INFO L225 Difference]: With dead ends: 4552 [2019-12-27 20:27:35,535 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 20:27:35,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 20:27:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-27 20:27:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-27 20:27:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-27 20:27:35,699 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-27 20:27:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:35,699 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-27 20:27:35,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-27 20:27:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:35,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:35,703 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 20:27:35,704 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:35,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:35,704 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-27 20:27:35,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:35,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953493794] [2019-12-27 20:27:35,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:35,794 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 20:27:35,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953493794] [2019-12-27 20:27:35,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:35,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:35,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1044124419] [2019-12-27 20:27:35,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:35,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:35,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:27:35,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:35,878 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:35,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:35,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:35,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:35,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:35,880 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 4 states. [2019-12-27 20:27:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:35,916 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-27 20:27:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:35,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 20:27:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:35,935 INFO L225 Difference]: With dead ends: 3872 [2019-12-27 20:27:35,935 INFO L226 Difference]: Without dead ends: 2030 [2019-12-27 20:27:35,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-27 20:27:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-27 20:27:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-27 20:27:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-27 20:27:35,983 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-27 20:27:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:35,983 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-27 20:27:35,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-27 20:27:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:35,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:35,986 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 20:27:35,986 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:35,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 20:27:35,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:35,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565442036] [2019-12-27 20:27:35,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:36,089 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 20:27:36,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565442036] [2019-12-27 20:27:36,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:36,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:36,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [15366584] [2019-12-27 20:27:36,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:36,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:36,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:27:36,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:36,104 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:36,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:36,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:36,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:36,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:36,105 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-27 20:27:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:36,606 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-27 20:27:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:36,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 20:27:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:36,617 INFO L225 Difference]: With dead ends: 3736 [2019-12-27 20:27:36,617 INFO L226 Difference]: Without dead ends: 3707 [2019-12-27 20:27:36,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-27 20:27:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-27 20:27:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 20:27:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-27 20:27:36,679 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-27 20:27:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:36,679 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-27 20:27:36,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-27 20:27:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:27:36,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:36,683 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 20:27:36,683 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-27 20:27:36,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:36,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586120666] [2019-12-27 20:27:36,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:36,757 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 20:27:36,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586120666] [2019-12-27 20:27:36,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:36,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:27:36,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002806524] [2019-12-27 20:27:36,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:36,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:36,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:27:36,775 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:36,867 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:27:36,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:27:36,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:36,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:27:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:36,925 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 8 states. [2019-12-27 20:27:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:37,809 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-27 20:27:37,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:27:37,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:27:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:37,818 INFO L225 Difference]: With dead ends: 2989 [2019-12-27 20:27:37,818 INFO L226 Difference]: Without dead ends: 2989 [2019-12-27 20:27:37,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-27 20:27:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-27 20:27:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 20:27:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-27 20:27:37,878 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-27 20:27:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:37,878 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-27 20:27:37,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:27:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-27 20:27:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:27:37,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:37,883 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] [2019-12-27 20:27:37,883 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:37,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 20:27:37,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:37,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881631353] [2019-12-27 20:27:37,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:37,959 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 20:27:37,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881631353] [2019-12-27 20:27:37,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:37,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:37,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812520183] [2019-12-27 20:27:37,960 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:37,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:37,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:27:37,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:37,996 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:27:37,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:37,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:37,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:37,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:37,997 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 6 states. [2019-12-27 20:27:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:38,042 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-27 20:27:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:38,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:27:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:38,047 INFO L225 Difference]: With dead ends: 1549 [2019-12-27 20:27:38,047 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 20:27:38,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 20:27:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-27 20:27:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-27 20:27:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-27 20:27:38,073 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-27 20:27:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:38,074 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-27 20:27:38,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-27 20:27:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:38,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:38,077 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:38,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:38,078 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-27 20:27:38,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:38,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48919005] [2019-12-27 20:27:38,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:38,173 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 20:27:38,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48919005] [2019-12-27 20:27:38,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:38,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:27:38,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [805501438] [2019-12-27 20:27:38,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:38,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:38,629 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 135 transitions. [2019-12-27 20:27:38,629 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:38,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:27:38,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:38,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:38,736 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 9 states. [2019-12-27 20:27:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:39,026 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-27 20:27:39,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:27:39,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:27:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:39,030 INFO L225 Difference]: With dead ends: 2115 [2019-12-27 20:27:39,031 INFO L226 Difference]: Without dead ends: 1423 [2019-12-27 20:27:39,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:27:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-27 20:27:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-27 20:27:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 20:27:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-27 20:27:39,057 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-27 20:27:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:39,058 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-27 20:27:39,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:39,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-27 20:27:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:39,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:39,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:39,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-27 20:27:39,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:39,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922714234] [2019-12-27 20:27:39,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:39,151 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 20:27:39,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922714234] [2019-12-27 20:27:39,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:39,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:39,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1647600656] [2019-12-27 20:27:39,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:39,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:39,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 133 transitions. [2019-12-27 20:27:39,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:39,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:39,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:39,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:39,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:39,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:39,230 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 3 states. [2019-12-27 20:27:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:39,290 INFO L93 Difference]: Finished difference Result 1587 states and 3364 transitions. [2019-12-27 20:27:39,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:39,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:27:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:39,295 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 20:27:39,295 INFO L226 Difference]: Without dead ends: 1587 [2019-12-27 20:27:39,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 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 20:27:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-27 20:27:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1262. [2019-12-27 20:27:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-27 20:27:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2714 transitions. [2019-12-27 20:27:39,323 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2714 transitions. Word has length 51 [2019-12-27 20:27:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:39,323 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2714 transitions. [2019-12-27 20:27:39,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2714 transitions. [2019-12-27 20:27:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:39,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:39,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:39,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:39,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:39,328 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-27 20:27:39,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:39,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956137312] [2019-12-27 20:27:39,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:39,451 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 20:27:39,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956137312] [2019-12-27 20:27:39,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:39,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:27:39,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956948051] [2019-12-27 20:27:39,452 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:39,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:39,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:39,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:39,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:27:39,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:39,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:39,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:39,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:39,628 INFO L87 Difference]: Start difference. First operand 1262 states and 2714 transitions. Second operand 9 states. [2019-12-27 20:27:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:41,362 INFO L93 Difference]: Finished difference Result 2653 states and 5478 transitions. [2019-12-27 20:27:41,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:27:41,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 20:27:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:41,371 INFO L225 Difference]: With dead ends: 2653 [2019-12-27 20:27:41,371 INFO L226 Difference]: Without dead ends: 2653 [2019-12-27 20:27:41,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:27:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-27 20:27:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1286. [2019-12-27 20:27:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-27 20:27:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-27 20:27:41,420 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-27 20:27:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:41,420 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-27 20:27:41,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-27 20:27:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:41,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:41,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:41,424 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:41,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-27 20:27:41,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:41,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421609334] [2019-12-27 20:27:41,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:41,520 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 20:27:41,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421609334] [2019-12-27 20:27:41,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:41,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:41,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436368213] [2019-12-27 20:27:41,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:41,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:41,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:41,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:41,632 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:41,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:41,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:41,644 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-27 20:27:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:41,899 INFO L93 Difference]: Finished difference Result 1970 states and 4215 transitions. [2019-12-27 20:27:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:41,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:27:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:41,904 INFO L225 Difference]: With dead ends: 1970 [2019-12-27 20:27:41,904 INFO L226 Difference]: Without dead ends: 1970 [2019-12-27 20:27:41,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-27 20:27:41,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1316. [2019-12-27 20:27:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-12-27 20:27:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2818 transitions. [2019-12-27 20:27:41,933 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2818 transitions. Word has length 52 [2019-12-27 20:27:41,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:41,933 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 2818 transitions. [2019-12-27 20:27:41,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2818 transitions. [2019-12-27 20:27:41,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:41,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:41,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:41,937 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:41,937 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-27 20:27:41,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:41,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591648189] [2019-12-27 20:27:41,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:42,016 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 20:27:42,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591648189] [2019-12-27 20:27:42,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:42,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:42,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963809025] [2019-12-27 20:27:42,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:42,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:42,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 120 transitions. [2019-12-27 20:27:42,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:42,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:42,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:42,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:42,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:42,109 INFO L87 Difference]: Start difference. First operand 1316 states and 2818 transitions. Second operand 3 states. [2019-12-27 20:27:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:42,129 INFO L93 Difference]: Finished difference Result 1315 states and 2816 transitions. [2019-12-27 20:27:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:42,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:27:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:42,131 INFO L225 Difference]: With dead ends: 1315 [2019-12-27 20:27:42,131 INFO L226 Difference]: Without dead ends: 1315 [2019-12-27 20:27:42,132 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 20:27:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-12-27 20:27:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 935. [2019-12-27 20:27:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-27 20:27:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2029 transitions. [2019-12-27 20:27:42,150 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2029 transitions. Word has length 52 [2019-12-27 20:27:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:42,150 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2029 transitions. [2019-12-27 20:27:42,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2029 transitions. [2019-12-27 20:27:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:27:42,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:42,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:42,153 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 20:27:42,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:42,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054541634] [2019-12-27 20:27:42,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:42,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:27:42,303 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:27:42,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t595~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t595~0.base_22|) |v_ULTIMATE.start_main_~#t595~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= 0 v_~y$w_buff1~0_25) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_22|) (= 0 v_~y$r_buff1_thd1~0_21) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t595~0.base_22| 4) |v_#length_17|) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= |v_ULTIMATE.start_main_~#t595~0.offset_17| 0) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_22| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_22|)) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, ULTIMATE.start_main_#t~ite40, ~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_#t~nondet38, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:27:42,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:27:42,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:27:42,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In81339999 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In81339999 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out81339999| ~y$w_buff0_used~0_In81339999) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out81339999| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In81339999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In81339999} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out81339999|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In81339999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In81339999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:27:42,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-970624798 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-970624798 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-970624798 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-970624798 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-970624798| ~y$w_buff1_used~0_In-970624798) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-970624798| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-970624798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-970624798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-970624798} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-970624798|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-970624798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-970624798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-970624798} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:27:42,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1683681376 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1683681376 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In-1683681376 ~y$r_buff0_thd1~0_Out-1683681376) (or .cse0 .cse1)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-1683681376 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683681376, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1683681376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1683681376, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1683681376|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1683681376} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:27:42,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-353254520 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-353254520| ~y$w_buff0~0_In-353254520) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-353254520| |P1Thread1of1ForFork1_#t~ite14_Out-353254520|)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-353254520| ~y$w_buff0~0_In-353254520) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-353254520 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-353254520 256)) (and (= (mod ~y$w_buff1_used~0_In-353254520 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-353254520 256) 0)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-353254520| |P1Thread1of1ForFork1_#t~ite15_Out-353254520|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-353254520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-353254520, ~y$w_buff0~0=~y$w_buff0~0_In-353254520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-353254520, ~weak$$choice2~0=~weak$$choice2~0_In-353254520, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-353254520|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-353254520} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-353254520, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-353254520, ~y$w_buff0~0=~y$w_buff0~0_In-353254520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-353254520, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-353254520|, ~weak$$choice2~0=~weak$$choice2~0_In-353254520, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-353254520|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-353254520} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:27:42,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1758188258 256)))) (or (and .cse0 (= ~y$w_buff1~0_In-1758188258 |P1Thread1of1ForFork1_#t~ite17_Out-1758188258|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1758188258 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1758188258 256))) (= 0 (mod ~y$w_buff0_used~0_In-1758188258 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1758188258 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite18_Out-1758188258| |P1Thread1of1ForFork1_#t~ite17_Out-1758188258|)) (and (= |P1Thread1of1ForFork1_#t~ite17_In-1758188258| |P1Thread1of1ForFork1_#t~ite17_Out-1758188258|) (= ~y$w_buff1~0_In-1758188258 |P1Thread1of1ForFork1_#t~ite18_Out-1758188258|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1758188258, ~y$w_buff1~0=~y$w_buff1~0_In-1758188258, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758188258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1758188258, ~weak$$choice2~0=~weak$$choice2~0_In-1758188258, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1758188258|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758188258} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1758188258, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1758188258|, ~y$w_buff1~0=~y$w_buff1~0_In-1758188258, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758188258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1758188258, ~weak$$choice2~0=~weak$$choice2~0_In-1758188258, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1758188258|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758188258} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:27:42,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1610782569 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1610782569| |P1Thread1of1ForFork1_#t~ite20_Out-1610782569|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1610782569| ~y$w_buff0_used~0_In-1610782569)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1610782569| |P1Thread1of1ForFork1_#t~ite20_Out-1610782569|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1610782569 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1610782569 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1610782569 256))) (= (mod ~y$w_buff0_used~0_In-1610782569 256) 0))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1610782569| ~y$w_buff0_used~0_In-1610782569)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1610782569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1610782569|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1610782569, ~weak$$choice2~0=~weak$$choice2~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1610782569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1610782569|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1610782569, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1610782569|, ~weak$$choice2~0=~weak$$choice2~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:27:42,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:27:42,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-692462134 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-692462134| |P1Thread1of1ForFork1_#t~ite29_Out-692462134|) (= ~y$r_buff1_thd2~0_In-692462134 |P1Thread1of1ForFork1_#t~ite30_Out-692462134|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-692462134| ~y$r_buff1_thd2~0_In-692462134) (= |P1Thread1of1ForFork1_#t~ite29_Out-692462134| |P1Thread1of1ForFork1_#t~ite30_Out-692462134|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-692462134 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-692462134 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In-692462134 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-692462134 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-692462134, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-692462134|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-692462134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-692462134, ~weak$$choice2~0=~weak$$choice2~0_In-692462134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-692462134} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-692462134, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-692462134|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-692462134|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-692462134, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-692462134, ~weak$$choice2~0=~weak$$choice2~0_In-692462134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-692462134} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 20:27:42,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2114061175 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2114061175 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2114061175 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-2114061175 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2114061175|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-2114061175| ~y$r_buff1_thd1~0_In-2114061175)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2114061175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114061175, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2114061175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114061175} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2114061175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114061175, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2114061175|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2114061175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2114061175} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:27:42,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:27:42,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:27:42,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In382267170 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In382267170 256)))) (or (and (= ~y~0_In382267170 |P1Thread1of1ForFork1_#t~ite32_Out382267170|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In382267170 |P1Thread1of1ForFork1_#t~ite32_Out382267170|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In382267170, ~y$w_buff1~0=~y$w_buff1~0_In382267170, ~y~0=~y~0_In382267170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In382267170} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In382267170, ~y$w_buff1~0=~y$w_buff1~0_In382267170, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out382267170|, ~y~0=~y~0_In382267170, ~y$w_buff1_used~0=~y$w_buff1_used~0_In382267170} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 20:27:42,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 20:27:42,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-259968805 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-259968805 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-259968805| ~y$w_buff0_used~0_In-259968805) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-259968805|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-259968805, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-259968805} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-259968805, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-259968805, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-259968805|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:27:42,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In410199478 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In410199478 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In410199478 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In410199478 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out410199478| ~y$w_buff1_used~0_In410199478) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out410199478|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In410199478, ~y$w_buff0_used~0=~y$w_buff0_used~0_In410199478, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In410199478, ~y$w_buff1_used~0=~y$w_buff1_used~0_In410199478} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In410199478, ~y$w_buff0_used~0=~y$w_buff0_used~0_In410199478, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In410199478, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out410199478|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In410199478} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:27:42,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2004607668 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2004607668 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2004607668| ~y$r_buff0_thd2~0_In-2004607668)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2004607668|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004607668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004607668} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004607668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004607668, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2004607668|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:27:42,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2003104796 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2003104796 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In2003104796 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2003104796 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out2003104796| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out2003104796| ~y$r_buff1_thd2~0_In2003104796) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2003104796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2003104796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003104796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2003104796} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2003104796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2003104796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2003104796, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2003104796|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2003104796} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:42,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:42,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:27:42,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In970775526 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In970775526 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out970775526| ~y$w_buff1~0_In970775526) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out970775526| ~y~0_In970775526)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In970775526, ~y~0=~y~0_In970775526, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In970775526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In970775526} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out970775526|, ~y$w_buff1~0=~y$w_buff1~0_In970775526, ~y~0=~y~0_In970775526, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In970775526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In970775526} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:27:42,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:27:42,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1531950247 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1531950247 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1531950247| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1531950247 |ULTIMATE.start_main_#t~ite42_Out-1531950247|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531950247, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531950247} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1531950247, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1531950247, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1531950247|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:27:42,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1591954590 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1591954590 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1591954590 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1591954590 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1591954590|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1591954590 |ULTIMATE.start_main_#t~ite43_Out1591954590|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1591954590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591954590, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1591954590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591954590} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1591954590, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591954590, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1591954590|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1591954590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591954590} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:27:42,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-83915088 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-83915088 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-83915088| 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-83915088 |ULTIMATE.start_main_#t~ite44_Out-83915088|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-83915088, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-83915088} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-83915088, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-83915088, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-83915088|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:27:42,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In194357446 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In194357446 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In194357446 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In194357446 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out194357446| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out194357446| ~y$r_buff1_thd0~0_In194357446) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In194357446, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In194357446, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In194357446, ~y$w_buff1_used~0=~y$w_buff1_used~0_In194357446} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In194357446, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In194357446, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In194357446, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out194357446|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In194357446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:27:42,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:27:42,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:27:42 BasicIcfg [2019-12-27 20:27:42,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:27:42,400 INFO L168 Benchmark]: Toolchain (without parser) took 15851.72 ms. Allocated memory was 136.3 MB in the beginning and 605.6 MB in the end (delta: 469.2 MB). Free memory was 99.3 MB in the beginning and 306.5 MB in the end (delta: -207.1 MB). Peak memory consumption was 262.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:42,400 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:27:42,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.08 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 154.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:42,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.52 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:42,403 INFO L168 Benchmark]: Boogie Preprocessor took 45.89 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:42,403 INFO L168 Benchmark]: RCFGBuilder took 807.35 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 106.0 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:42,404 INFO L168 Benchmark]: TraceAbstraction took 14114.43 ms. Allocated memory was 200.3 MB in the beginning and 605.6 MB in the end (delta: 405.3 MB). Free memory was 105.3 MB in the beginning and 306.5 MB in the end (delta: -201.1 MB). Peak memory consumption was 204.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:42,408 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.08 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 154.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.52 ms. Allocated memory is still 200.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.89 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 807.35 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 106.0 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14114.43 ms. Allocated memory was 200.3 MB in the beginning and 605.6 MB in the end (delta: 405.3 MB). Free memory was 105.3 MB in the beginning and 306.5 MB in the end (delta: -201.1 MB). Peak memory consumption was 204.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 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=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1710 SDtfs, 2049 SDslu, 4177 SDs, 0 SdLazy, 3210 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9482occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 7578 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 49357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...