/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/mix037_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:02:21,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:02:21,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:02:21,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:02:21,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:02:21,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:02:21,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:02:21,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:02:21,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:02:21,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:02:21,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:02:21,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:02:21,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:02:21,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:02:21,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:02:21,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:02:21,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:02:21,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:02:21,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:02:21,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:02:21,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:02:21,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:02:21,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:02:21,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:02:21,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:02:21,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:02:21,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:02:21,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:02:21,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:02:21,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:02:21,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:02:21,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:02:21,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:02:21,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:02:21,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:02:21,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:02:21,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:02:21,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:02:21,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:02:21,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:02:21,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:02:21,299 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 21:02:21,325 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:02:21,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:02:21,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:02:21,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:02:21,328 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:02:21,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:02:21,329 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:02:21,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:02:21,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:02:21,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:02:21,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:02:21,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:02:21,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:02:21,330 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:02:21,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:02:21,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:02:21,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:02:21,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:02:21,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:02:21,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:02:21,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:02:21,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:02:21,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:02:21,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:02:21,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:02:21,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:02:21,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:02:21,334 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:02:21,334 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:02:21,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:02:21,335 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:02:21,335 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:02:21,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:02:21,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:02:21,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:02:21,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:02:21,683 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:02:21,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_power.opt.i [2019-12-27 21:02:21,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932d1859e/55d27df5107c49c58000e68c4e2d3a53/FLAGfb80bd2d7 [2019-12-27 21:02:22,276 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:02:22,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_power.opt.i [2019-12-27 21:02:22,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932d1859e/55d27df5107c49c58000e68c4e2d3a53/FLAGfb80bd2d7 [2019-12-27 21:02:22,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932d1859e/55d27df5107c49c58000e68c4e2d3a53 [2019-12-27 21:02:22,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:02:22,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:02:22,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:02:22,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:02:22,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:02:22,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:02:22" (1/1) ... [2019-12-27 21:02:22,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21807566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:22, skipping insertion in model container [2019-12-27 21:02:22,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:02:22" (1/1) ... [2019-12-27 21:02:22,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:02:22,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:02:23,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:02:23,252 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:02:23,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:02:23,407 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:02:23,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23 WrapperNode [2019-12-27 21:02:23,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:02:23,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:02:23,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:02:23,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:02:23,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:02:23,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:02:23,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:02:23,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:02:23,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (1/1) ... [2019-12-27 21:02:23,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:02:23,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:02:23,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:02:23,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:02:23,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (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 21:02:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:02:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:02:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:02:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:02:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:02:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:02:23,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:02:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:02:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:02:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:02:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:02:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:02:23,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:02:23,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:02:23,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:02:23,613 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 21:02:24,329 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:02:24,330 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:02:24,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:02:24 BoogieIcfgContainer [2019-12-27 21:02:24,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:02:24,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:02:24,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:02:24,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:02:24,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:02:22" (1/3) ... [2019-12-27 21:02:24,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7619ed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:02:24, skipping insertion in model container [2019-12-27 21:02:24,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:02:23" (2/3) ... [2019-12-27 21:02:24,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7619ed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:02:24, skipping insertion in model container [2019-12-27 21:02:24,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:02:24" (3/3) ... [2019-12-27 21:02:24,345 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_power.opt.i [2019-12-27 21:02:24,355 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:02:24,355 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:02:24,362 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:02:24,363 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:02:24,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,409 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,460 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,461 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,461 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,461 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,461 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,461 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,465 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,466 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,467 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,470 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,483 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,485 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,486 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,491 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,491 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,491 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,492 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,492 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,493 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,493 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:02:24,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:02:24,534 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:02:24,534 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:02:24,534 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:02:24,534 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:02:24,534 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:02:24,534 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:02:24,535 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:02:24,535 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:02:24,558 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 21:02:24,560 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:02:24,666 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:02:24,666 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:02:24,680 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:02:24,701 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 21:02:24,751 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 21:02:24,752 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:02:24,758 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 21:02:24,773 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 21:02:24,775 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:02:28,747 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 21:02:28,918 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 21:02:28,932 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-27 21:02:28,932 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 21:02:28,936 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-27 21:02:30,268 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-27 21:02:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-27 21:02:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:02:30,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:30,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:30,279 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-27 21:02:30,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:30,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925871194] [2019-12-27 21:02:30,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:30,647 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 21:02:30,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925871194] [2019-12-27 21:02:30,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:30,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:02:30,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1769271494] [2019-12-27 21:02:30,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:30,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:30,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:02:30,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:30,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:30,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:02:30,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:02:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:02:30,711 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-27 21:02:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:31,157 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-27 21:02:31,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:31,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:02:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:31,367 INFO L225 Difference]: With dead ends: 21750 [2019-12-27 21:02:31,367 INFO L226 Difference]: Without dead ends: 20406 [2019-12-27 21:02:31,368 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 21:02:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-27 21:02:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-27 21:02:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 21:02:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-27 21:02:33,469 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-27 21:02:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:33,470 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-27 21:02:33,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:02:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-27 21:02:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:02:33,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:33,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:33,484 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:33,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:33,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-27 21:02:33,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:33,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441812742] [2019-12-27 21:02:33,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:33,575 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 21:02:33,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441812742] [2019-12-27 21:02:33,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:33,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:33,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392591214] [2019-12-27 21:02:33,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:33,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:33,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:02:33,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:33,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:33,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:02:33,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:02:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:33,585 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-27 21:02:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:35,148 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-27 21:02:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:02:35,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 21:02:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:35,284 INFO L225 Difference]: With dead ends: 31694 [2019-12-27 21:02:35,284 INFO L226 Difference]: Without dead ends: 31634 [2019-12-27 21:02:35,285 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 21:02:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-27 21:02:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-27 21:02:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-27 21:02:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-27 21:02:36,502 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-27 21:02:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:36,502 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-27 21:02:36,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:02:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-27 21:02:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 21:02:36,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:36,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:36,510 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-27 21:02:36,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:36,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823939972] [2019-12-27 21:02:36,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:36,608 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 21:02:36,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823939972] [2019-12-27 21:02:36,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:36,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:36,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918624362] [2019-12-27 21:02:36,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:36,613 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:36,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 21:02:36,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:36,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:02:36,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:02:36,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:02:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:02:36,661 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 5 states. [2019-12-27 21:02:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:37,316 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-27 21:02:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:02:37,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 21:02:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:37,465 INFO L225 Difference]: With dead ends: 35982 [2019-12-27 21:02:37,465 INFO L226 Difference]: Without dead ends: 35934 [2019-12-27 21:02:37,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:02:37,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-27 21:02:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-27 21:02:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-27 21:02:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-27 21:02:40,747 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-27 21:02:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:40,747 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-27 21:02:40,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:02:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-27 21:02:40,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 21:02:40,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:40,759 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] [2019-12-27 21:02:40,759 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-27 21:02:40,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:40,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423214903] [2019-12-27 21:02:40,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:40,824 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 21:02:40,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423214903] [2019-12-27 21:02:40,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:40,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:02:40,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161858021] [2019-12-27 21:02:40,826 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:40,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:40,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 21:02:40,837 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:40,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:40,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:02:40,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:40,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:02:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:02:40,840 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-27 21:02:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:41,011 INFO L93 Difference]: Finished difference Result 30483 states and 126804 transitions. [2019-12-27 21:02:41,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:41,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 21:02:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:41,117 INFO L225 Difference]: With dead ends: 30483 [2019-12-27 21:02:41,117 INFO L226 Difference]: Without dead ends: 30483 [2019-12-27 21:02:41,117 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 21:02:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30483 states. [2019-12-27 21:02:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30483 to 30483. [2019-12-27 21:02:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30483 states. [2019-12-27 21:02:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30483 states to 30483 states and 126804 transitions. [2019-12-27 21:02:42,514 INFO L78 Accepts]: Start accepts. Automaton has 30483 states and 126804 transitions. Word has length 20 [2019-12-27 21:02:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:42,514 INFO L462 AbstractCegarLoop]: Abstraction has 30483 states and 126804 transitions. [2019-12-27 21:02:42,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:02:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 30483 states and 126804 transitions. [2019-12-27 21:02:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 21:02:42,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:42,525 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] [2019-12-27 21:02:42,525 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:42,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash -300921262, now seen corresponding path program 1 times [2019-12-27 21:02:42,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:42,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955178097] [2019-12-27 21:02:42,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:42,643 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 21:02:42,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955178097] [2019-12-27 21:02:42,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:42,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:02:42,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278736349] [2019-12-27 21:02:42,645 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:42,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:42,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 21:02:42,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:42,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:42,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:02:42,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:02:42,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:02:42,654 INFO L87 Difference]: Start difference. First operand 30483 states and 126804 transitions. Second operand 3 states. [2019-12-27 21:02:42,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:42,824 INFO L93 Difference]: Finished difference Result 30156 states and 125536 transitions. [2019-12-27 21:02:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:42,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 21:02:42,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:42,893 INFO L225 Difference]: With dead ends: 30156 [2019-12-27 21:02:42,893 INFO L226 Difference]: Without dead ends: 30156 [2019-12-27 21:02:42,894 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 21:02:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2019-12-27 21:02:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 30156. [2019-12-27 21:02:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30156 states. [2019-12-27 21:02:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30156 states to 30156 states and 125536 transitions. [2019-12-27 21:02:45,003 INFO L78 Accepts]: Start accepts. Automaton has 30156 states and 125536 transitions. Word has length 21 [2019-12-27 21:02:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:45,003 INFO L462 AbstractCegarLoop]: Abstraction has 30156 states and 125536 transitions. [2019-12-27 21:02:45,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:02:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 30156 states and 125536 transitions. [2019-12-27 21:02:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:02:45,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:45,015 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] [2019-12-27 21:02:45,016 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-27 21:02:45,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:45,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429443710] [2019-12-27 21:02:45,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:45,125 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 21:02:45,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429443710] [2019-12-27 21:02:45,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:45,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:45,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534652898] [2019-12-27 21:02:45,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:45,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:45,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 46 transitions. [2019-12-27 21:02:45,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:45,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:02:45,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:02:45,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:45,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:02:45,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:45,143 INFO L87 Difference]: Start difference. First operand 30156 states and 125536 transitions. Second operand 4 states. [2019-12-27 21:02:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:45,578 INFO L93 Difference]: Finished difference Result 30156 states and 124144 transitions. [2019-12-27 21:02:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:02:45,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 21:02:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:45,654 INFO L225 Difference]: With dead ends: 30156 [2019-12-27 21:02:45,654 INFO L226 Difference]: Without dead ends: 30156 [2019-12-27 21:02:45,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 21:02:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2019-12-27 21:02:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 29756. [2019-12-27 21:02:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2019-12-27 21:02:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 122584 transitions. [2019-12-27 21:02:47,987 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 122584 transitions. Word has length 22 [2019-12-27 21:02:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:47,988 INFO L462 AbstractCegarLoop]: Abstraction has 29756 states and 122584 transitions. [2019-12-27 21:02:47,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:02:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 122584 transitions. [2019-12-27 21:02:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:02:47,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:47,999 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] [2019-12-27 21:02:47,999 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1925311680, now seen corresponding path program 1 times [2019-12-27 21:02:48,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:48,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325982289] [2019-12-27 21:02:48,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:48,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 21:02:48,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325982289] [2019-12-27 21:02:48,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:48,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:02:48,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1802354513] [2019-12-27 21:02:48,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:48,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:48,099 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 41 transitions. [2019-12-27 21:02:48,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:48,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:02:48,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:02:48,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:02:48,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:48,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:02:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:02:48,157 INFO L87 Difference]: Start difference. First operand 29756 states and 122584 transitions. Second operand 8 states. [2019-12-27 21:02:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:48,627 INFO L93 Difference]: Finished difference Result 18293 states and 60476 transitions. [2019-12-27 21:02:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:02:48,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-12-27 21:02:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:48,653 INFO L225 Difference]: With dead ends: 18293 [2019-12-27 21:02:48,653 INFO L226 Difference]: Without dead ends: 16493 [2019-12-27 21:02:48,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:02:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16493 states. [2019-12-27 21:02:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16493 to 10556. [2019-12-27 21:02:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10556 states. [2019-12-27 21:02:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 34237 transitions. [2019-12-27 21:02:48,913 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 34237 transitions. Word has length 23 [2019-12-27 21:02:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:48,913 INFO L462 AbstractCegarLoop]: Abstraction has 10556 states and 34237 transitions. [2019-12-27 21:02:48,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:02:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 34237 transitions. [2019-12-27 21:02:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:02:48,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:48,919 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] [2019-12-27 21:02:48,919 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1601638180, now seen corresponding path program 1 times [2019-12-27 21:02:48,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:48,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377287221] [2019-12-27 21:02:48,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:48,972 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 21:02:48,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377287221] [2019-12-27 21:02:48,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:48,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:02:48,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611473690] [2019-12-27 21:02:48,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:48,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:48,986 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 50 transitions. [2019-12-27 21:02:48,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:49,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:02:49,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:02:49,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:49,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:02:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:49,002 INFO L87 Difference]: Start difference. First operand 10556 states and 34237 transitions. Second operand 4 states. [2019-12-27 21:02:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:49,075 INFO L93 Difference]: Finished difference Result 17590 states and 56181 transitions. [2019-12-27 21:02:49,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:49,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 21:02:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:49,094 INFO L225 Difference]: With dead ends: 17590 [2019-12-27 21:02:49,094 INFO L226 Difference]: Without dead ends: 10990 [2019-12-27 21:02:49,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10990 states. [2019-12-27 21:02:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10990 to 10806. [2019-12-27 21:02:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10806 states. [2019-12-27 21:02:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10806 states to 10806 states and 33714 transitions. [2019-12-27 21:02:49,405 INFO L78 Accepts]: Start accepts. Automaton has 10806 states and 33714 transitions. Word has length 24 [2019-12-27 21:02:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:49,405 INFO L462 AbstractCegarLoop]: Abstraction has 10806 states and 33714 transitions. [2019-12-27 21:02:49,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:02:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 10806 states and 33714 transitions. [2019-12-27 21:02:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:02:49,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:49,409 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] [2019-12-27 21:02:49,409 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash 702094496, now seen corresponding path program 2 times [2019-12-27 21:02:49,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:49,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621115143] [2019-12-27 21:02:49,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:49,476 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 21:02:49,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621115143] [2019-12-27 21:02:49,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:49,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:02:49,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [559411006] [2019-12-27 21:02:49,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:49,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:49,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 56 transitions. [2019-12-27 21:02:49,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:49,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:02:49,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:02:49,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:49,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:02:49,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:02:49,549 INFO L87 Difference]: Start difference. First operand 10806 states and 33714 transitions. Second operand 6 states. [2019-12-27 21:02:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:49,660 INFO L93 Difference]: Finished difference Result 16343 states and 51703 transitions. [2019-12-27 21:02:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:02:49,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 21:02:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:49,678 INFO L225 Difference]: With dead ends: 16343 [2019-12-27 21:02:49,678 INFO L226 Difference]: Without dead ends: 8666 [2019-12-27 21:02:49,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:02:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8666 states. [2019-12-27 21:02:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8666 to 8361. [2019-12-27 21:02:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8361 states. [2019-12-27 21:02:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8361 states to 8361 states and 26206 transitions. [2019-12-27 21:02:49,815 INFO L78 Accepts]: Start accepts. Automaton has 8361 states and 26206 transitions. Word has length 24 [2019-12-27 21:02:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:49,815 INFO L462 AbstractCegarLoop]: Abstraction has 8361 states and 26206 transitions. [2019-12-27 21:02:49,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:02:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 8361 states and 26206 transitions. [2019-12-27 21:02:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 21:02:49,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:49,819 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] [2019-12-27 21:02:49,819 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:49,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:49,819 INFO L82 PathProgramCache]: Analyzing trace with hash 238221496, now seen corresponding path program 3 times [2019-12-27 21:02:49,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:49,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622315222] [2019-12-27 21:02:49,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:49,924 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 21:02:49,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622315222] [2019-12-27 21:02:49,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:49,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:02:49,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83722996] [2019-12-27 21:02:49,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:49,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:49,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 21:02:49,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:49,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:49,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:02:49,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:02:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:02:49,940 INFO L87 Difference]: Start difference. First operand 8361 states and 26206 transitions. Second operand 6 states. [2019-12-27 21:02:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:50,070 INFO L93 Difference]: Finished difference Result 3182 states and 9111 transitions. [2019-12-27 21:02:50,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:02:50,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 21:02:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:50,075 INFO L225 Difference]: With dead ends: 3182 [2019-12-27 21:02:50,075 INFO L226 Difference]: Without dead ends: 2648 [2019-12-27 21:02:50,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:02:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2019-12-27 21:02:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2648. [2019-12-27 21:02:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2648 states. [2019-12-27 21:02:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 7485 transitions. [2019-12-27 21:02:50,133 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 7485 transitions. Word has length 24 [2019-12-27 21:02:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:50,134 INFO L462 AbstractCegarLoop]: Abstraction has 2648 states and 7485 transitions. [2019-12-27 21:02:50,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:02:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 7485 transitions. [2019-12-27 21:02:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:02:50,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:50,142 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] [2019-12-27 21:02:50,142 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-27 21:02:50,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:50,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731010856] [2019-12-27 21:02:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:50,197 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 21:02:50,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731010856] [2019-12-27 21:02:50,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:50,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:02:50,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192284798] [2019-12-27 21:02:50,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:50,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:50,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 220 transitions. [2019-12-27 21:02:50,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:50,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:02:50,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:02:50,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:02:50,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:02:50,291 INFO L87 Difference]: Start difference. First operand 2648 states and 7485 transitions. Second operand 5 states. [2019-12-27 21:02:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:50,388 INFO L93 Difference]: Finished difference Result 3966 states and 11148 transitions. [2019-12-27 21:02:50,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:02:50,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 21:02:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:50,395 INFO L225 Difference]: With dead ends: 3966 [2019-12-27 21:02:50,396 INFO L226 Difference]: Without dead ends: 3966 [2019-12-27 21:02:50,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:02:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2019-12-27 21:02:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3124. [2019-12-27 21:02:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2019-12-27 21:02:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 8947 transitions. [2019-12-27 21:02:50,456 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 8947 transitions. Word has length 32 [2019-12-27 21:02:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:50,457 INFO L462 AbstractCegarLoop]: Abstraction has 3124 states and 8947 transitions. [2019-12-27 21:02:50,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:02:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 8947 transitions. [2019-12-27 21:02:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 21:02:50,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:50,464 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] [2019-12-27 21:02:50,464 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:50,464 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-27 21:02:50,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:50,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087245908] [2019-12-27 21:02:50,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:50,549 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 21:02:50,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087245908] [2019-12-27 21:02:50,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:50,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:02:50,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1331472883] [2019-12-27 21:02:50,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:50,556 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:50,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 220 transitions. [2019-12-27 21:02:50,675 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:50,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:02:50,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:02:50,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:02:50,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:02:50,733 INFO L87 Difference]: Start difference. First operand 3124 states and 8947 transitions. Second operand 8 states. [2019-12-27 21:02:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:51,360 INFO L93 Difference]: Finished difference Result 6556 states and 17848 transitions. [2019-12-27 21:02:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:02:51,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 21:02:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:51,372 INFO L225 Difference]: With dead ends: 6556 [2019-12-27 21:02:51,372 INFO L226 Difference]: Without dead ends: 6418 [2019-12-27 21:02:51,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:02:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2019-12-27 21:02:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 3254. [2019-12-27 21:02:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-12-27 21:02:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 9275 transitions. [2019-12-27 21:02:51,448 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 9275 transitions. Word has length 32 [2019-12-27 21:02:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:51,448 INFO L462 AbstractCegarLoop]: Abstraction has 3254 states and 9275 transitions. [2019-12-27 21:02:51,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:02:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 9275 transitions. [2019-12-27 21:02:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:02:51,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:51,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:51,454 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash 390952001, now seen corresponding path program 1 times [2019-12-27 21:02:51,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:51,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318369018] [2019-12-27 21:02:51,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:51,538 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 21:02:51,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318369018] [2019-12-27 21:02:51,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:51,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:02:51,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482968039] [2019-12-27 21:02:51,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:51,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:51,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 233 transitions. [2019-12-27 21:02:51,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:51,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:02:51,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:02:51,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:51,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:02:51,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:02:51,640 INFO L87 Difference]: Start difference. First operand 3254 states and 9275 transitions. Second operand 8 states. [2019-12-27 21:02:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:52,221 INFO L93 Difference]: Finished difference Result 6239 states and 16879 transitions. [2019-12-27 21:02:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:02:52,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:02:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:52,231 INFO L225 Difference]: With dead ends: 6239 [2019-12-27 21:02:52,231 INFO L226 Difference]: Without dead ends: 6095 [2019-12-27 21:02:52,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:02:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-12-27 21:02:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3058. [2019-12-27 21:02:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2019-12-27 21:02:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 8767 transitions. [2019-12-27 21:02:52,280 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 8767 transitions. Word has length 33 [2019-12-27 21:02:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:52,280 INFO L462 AbstractCegarLoop]: Abstraction has 3058 states and 8767 transitions. [2019-12-27 21:02:52,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:02:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 8767 transitions. [2019-12-27 21:02:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:02:52,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:52,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:02:52,284 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2023232687, now seen corresponding path program 1 times [2019-12-27 21:02:52,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:52,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656717073] [2019-12-27 21:02:52,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:52,365 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 21:02:52,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656717073] [2019-12-27 21:02:52,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:52,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:02:52,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068681817] [2019-12-27 21:02:52,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:52,372 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:52,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 21:02:52,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:52,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:52,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:02:52,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:02:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:02:52,383 INFO L87 Difference]: Start difference. First operand 3058 states and 8767 transitions. Second operand 7 states. [2019-12-27 21:02:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:52,491 INFO L93 Difference]: Finished difference Result 2310 states and 6941 transitions. [2019-12-27 21:02:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:02:52,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:02:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:52,495 INFO L225 Difference]: With dead ends: 2310 [2019-12-27 21:02:52,495 INFO L226 Difference]: Without dead ends: 1641 [2019-12-27 21:02:52,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:02:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-12-27 21:02:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1587. [2019-12-27 21:02:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-12-27 21:02:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 4626 transitions. [2019-12-27 21:02:52,523 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 4626 transitions. Word has length 33 [2019-12-27 21:02:52,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:52,524 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 4626 transitions. [2019-12-27 21:02:52,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:02:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 4626 transitions. [2019-12-27 21:02:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:02:52,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:52,528 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] [2019-12-27 21:02:52,528 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1690133927, now seen corresponding path program 1 times [2019-12-27 21:02:52,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:52,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583258675] [2019-12-27 21:02:52,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:52,593 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 21:02:52,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583258675] [2019-12-27 21:02:52,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:52,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:02:52,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980544231] [2019-12-27 21:02:52,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:52,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:52,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 103 transitions. [2019-12-27 21:02:52,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:52,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:52,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:02:52,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:52,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:02:52,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:02:52,737 INFO L87 Difference]: Start difference. First operand 1587 states and 4626 transitions. Second operand 4 states. [2019-12-27 21:02:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:52,760 INFO L93 Difference]: Finished difference Result 2023 states and 5628 transitions. [2019-12-27 21:02:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:02:52,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-27 21:02:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:52,761 INFO L225 Difference]: With dead ends: 2023 [2019-12-27 21:02:52,761 INFO L226 Difference]: Without dead ends: 481 [2019-12-27 21:02:52,764 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 21:02:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-27 21:02:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-27 21:02:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 21:02:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1081 transitions. [2019-12-27 21:02:52,771 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1081 transitions. Word has length 48 [2019-12-27 21:02:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:52,771 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1081 transitions. [2019-12-27 21:02:52,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:02:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1081 transitions. [2019-12-27 21:02:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:02:52,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:52,773 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] [2019-12-27 21:02:52,773 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 2 times [2019-12-27 21:02:52,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:52,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664561995] [2019-12-27 21:02:52,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:02:52,864 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 21:02:52,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664561995] [2019-12-27 21:02:52,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:02:52,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:02:52,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1219175146] [2019-12-27 21:02:52,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:02:52,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:02:52,911 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-27 21:02:52,912 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:02:52,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:02:52,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:02:52,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:02:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:02:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:02:52,913 INFO L87 Difference]: Start difference. First operand 481 states and 1081 transitions. Second operand 7 states. [2019-12-27 21:02:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:02:53,055 INFO L93 Difference]: Finished difference Result 912 states and 2005 transitions. [2019-12-27 21:02:53,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:02:53,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 21:02:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:02:53,057 INFO L225 Difference]: With dead ends: 912 [2019-12-27 21:02:53,057 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 21:02:53,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:02:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 21:02:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 548. [2019-12-27 21:02:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 21:02:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1194 transitions. [2019-12-27 21:02:53,065 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1194 transitions. Word has length 48 [2019-12-27 21:02:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:02:53,065 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1194 transitions. [2019-12-27 21:02:53,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:02:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1194 transitions. [2019-12-27 21:02:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 21:02:53,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:02:53,067 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] [2019-12-27 21:02:53,067 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:02:53,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:02:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 3 times [2019-12-27 21:02:53,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:02:53,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708007975] [2019-12-27 21:02:53,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:02:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:02:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:02:53,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:02:53,173 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:02:53,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= v_~b~0_13 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t973~0.base_29|) 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t973~0.base_29|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t973~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t973~0.base_29|) |v_ULTIMATE.start_main_~#t973~0.offset_22| 0)) |v_#memory_int_25|) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= |v_ULTIMATE.start_main_~#t973~0.offset_22| 0) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_66 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t973~0.base_29| 4) |v_#length_29|) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z~0_20 0) (= v_~y~0_11 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t973~0.base_29| 1)) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_23|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_16|, ULTIMATE.start_main_~#t973~0.base=|v_ULTIMATE.start_main_~#t973~0.base_29|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_19|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t973~0.offset=|v_ULTIMATE.start_main_~#t973~0.offset_22|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t974~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t974~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t976~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t975~0.offset, ULTIMATE.start_main_~#t973~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t976~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t973~0.offset, ULTIMATE.start_main_~#t975~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:02:53,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t974~0.base_11|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t974~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t974~0.offset_10|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t974~0.base_11| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11|) |v_ULTIMATE.start_main_~#t974~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t974~0.base] because there is no mapped edge [2019-12-27 21:02:53,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t975~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t975~0.offset_11|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12|) |v_ULTIMATE.start_main_~#t975~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t975~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t975~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:02:53,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12|) |v_ULTIMATE.start_main_~#t976~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t976~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t976~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t976~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t976~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_10|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t976~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t976~0.base, #length] because there is no mapped edge [2019-12-27 21:02:53,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (= ~z$r_buff0_thd0~0_In-1731645678 ~z$r_buff1_thd0~0_Out-1731645678) (= 1 ~z$r_buff0_thd4~0_Out-1731645678) (= 1 ~a~0_Out-1731645678) (= ~z$r_buff0_thd1~0_In-1731645678 ~z$r_buff1_thd1~0_Out-1731645678) (= ~z$r_buff1_thd3~0_Out-1731645678 ~z$r_buff0_thd3~0_In-1731645678) (= ~z$r_buff1_thd2~0_Out-1731645678 ~z$r_buff0_thd2~0_In-1731645678) (= ~b~0_In-1731645678 ~__unbuffered_p3_EBX~0_Out-1731645678) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1731645678)) (= ~z$r_buff0_thd4~0_In-1731645678 ~z$r_buff1_thd4~0_Out-1731645678) (= ~a~0_Out-1731645678 ~__unbuffered_p3_EAX~0_Out-1731645678)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1731645678, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1731645678, ~b~0=~b~0_In-1731645678, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1731645678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1731645678, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1731645678, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1731645678} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1731645678, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1731645678, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1731645678, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1731645678, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1731645678, ~a~0=~a~0_Out-1731645678, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1731645678, ~b~0=~b~0_In-1731645678, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1731645678, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1731645678, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1731645678, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1731645678, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1731645678, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1731645678, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1731645678} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 21:02:53,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|} OutVars{~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 21:02:53,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 2 v_~x~0_8) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_7, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 21:02:53,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-49278008 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-49278008| ~z$w_buff0~0_In-49278008) (= |P2Thread1of1ForFork1_#t~ite8_In-49278008| |P2Thread1of1ForFork1_#t~ite8_Out-49278008|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite8_Out-49278008| ~z$w_buff0~0_In-49278008) .cse0 (= |P2Thread1of1ForFork1_#t~ite9_Out-49278008| |P2Thread1of1ForFork1_#t~ite8_Out-49278008|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-49278008 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-49278008 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-49278008 256))) (= (mod ~z$w_buff0_used~0_In-49278008 256) 0)))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-49278008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-49278008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-49278008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-49278008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-49278008, ~weak$$choice2~0=~weak$$choice2~0_In-49278008, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-49278008|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-49278008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-49278008, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-49278008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-49278008, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-49278008, ~weak$$choice2~0=~weak$$choice2~0_In-49278008, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-49278008|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-49278008|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:02:53,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1141904851 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1141904851 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1141904851 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In1141904851 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In1141904851 256)))) .cse1 (= |P2Thread1of1ForFork1_#t~ite11_Out1141904851| ~z$w_buff1~0_In1141904851) (= |P2Thread1of1ForFork1_#t~ite11_Out1141904851| |P2Thread1of1ForFork1_#t~ite12_Out1141904851|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_In1141904851| |P2Thread1of1ForFork1_#t~ite11_Out1141904851|) (= |P2Thread1of1ForFork1_#t~ite12_Out1141904851| ~z$w_buff1~0_In1141904851)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1141904851, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1141904851, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1141904851|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1141904851, ~z$w_buff1~0=~z$w_buff1~0_In1141904851, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1141904851, ~weak$$choice2~0=~weak$$choice2~0_In1141904851} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1141904851, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1141904851|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1141904851, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1141904851|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1141904851, ~z$w_buff1~0=~z$w_buff1~0_In1141904851, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1141904851, ~weak$$choice2~0=~weak$$choice2~0_In1141904851} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:02:53,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1894095976 256)))) (or (and (= ~z$w_buff0_used~0_In-1894095976 |P2Thread1of1ForFork1_#t~ite15_Out-1894095976|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In-1894095976| |P2Thread1of1ForFork1_#t~ite14_Out-1894095976|)) (and (= ~z$w_buff0_used~0_In-1894095976 |P2Thread1of1ForFork1_#t~ite14_Out-1894095976|) .cse0 (= |P2Thread1of1ForFork1_#t~ite15_Out-1894095976| |P2Thread1of1ForFork1_#t~ite14_Out-1894095976|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1894095976 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-1894095976 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1894095976 256))) (= 0 (mod ~z$w_buff0_used~0_In-1894095976 256))))))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-1894095976|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894095976, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1894095976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894095976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1894095976, ~weak$$choice2~0=~weak$$choice2~0_In-1894095976} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1894095976|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-1894095976|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894095976, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1894095976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894095976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1894095976, ~weak$$choice2~0=~weak$$choice2~0_In-1894095976} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 21:02:53,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 21:02:53,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In513689944 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite24_Out513689944| ~z$r_buff1_thd3~0_In513689944) (= |P2Thread1of1ForFork1_#t~ite23_In513689944| |P2Thread1of1ForFork1_#t~ite23_Out513689944|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In513689944 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In513689944 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In513689944 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In513689944 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite24_Out513689944| |P2Thread1of1ForFork1_#t~ite23_Out513689944|) (= |P2Thread1of1ForFork1_#t~ite23_Out513689944| ~z$r_buff1_thd3~0_In513689944)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In513689944, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In513689944, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In513689944|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In513689944, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In513689944, ~weak$$choice2~0=~weak$$choice2~0_In513689944} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out513689944|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In513689944, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In513689944, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out513689944|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In513689944, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In513689944, ~weak$$choice2~0=~weak$$choice2~0_In513689944} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 21:02:53,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:02:53,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-350818530 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-350818530 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-350818530| ~z$w_buff0_used~0_In-350818530) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-350818530| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-350818530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-350818530} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-350818530|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-350818530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-350818530} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 21:02:53,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1322913136 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1322913136 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1322913136 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1322913136 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-1322913136|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1322913136 |P3Thread1of1ForFork2_#t~ite29_Out-1322913136|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1322913136, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1322913136, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1322913136, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1322913136} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1322913136|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1322913136, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1322913136, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1322913136, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1322913136} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 21:02:53,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1169774373 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1169774373 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out1169774373)) (and (= ~z$r_buff0_thd4~0_Out1169774373 ~z$r_buff0_thd4~0_In1169774373) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1169774373, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1169774373} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1169774373, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1169774373, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1169774373|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 21:02:53,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-1920726891 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1920726891 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1920726891 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1920726891 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1920726891 |P3Thread1of1ForFork2_#t~ite31_Out-1920726891|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1920726891|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1920726891, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920726891, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1920726891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1920726891} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1920726891, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920726891, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1920726891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1920726891, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1920726891|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:02:53,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:02:53,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:02:53,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite36_Out-953452889| |ULTIMATE.start_main_#t~ite37_Out-953452889|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-953452889 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-953452889 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-953452889 |ULTIMATE.start_main_#t~ite36_Out-953452889|)) (and .cse0 (or .cse2 .cse1) (= ~z~0_In-953452889 |ULTIMATE.start_main_#t~ite36_Out-953452889|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-953452889, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-953452889, ~z$w_buff1~0=~z$w_buff1~0_In-953452889, ~z~0=~z~0_In-953452889} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-953452889, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-953452889, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-953452889|, ~z$w_buff1~0=~z$w_buff1~0_In-953452889, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-953452889|, ~z~0=~z~0_In-953452889} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:02:53,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1086536922 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1086536922 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1086536922 |ULTIMATE.start_main_#t~ite38_Out1086536922|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out1086536922|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1086536922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1086536922} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1086536922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1086536922, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1086536922|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:02:53,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In447714273 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In447714273 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In447714273 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In447714273 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out447714273|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In447714273 |ULTIMATE.start_main_#t~ite39_Out447714273|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In447714273, ~z$w_buff0_used~0=~z$w_buff0_used~0_In447714273, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In447714273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447714273} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In447714273, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out447714273|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In447714273, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In447714273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In447714273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:02:53,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1764873950 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1764873950 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1764873950| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1764873950| ~z$r_buff0_thd0~0_In1764873950)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1764873950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1764873950} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1764873950, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1764873950|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1764873950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:02:53,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-180757142 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-180757142 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-180757142 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-180757142 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-180757142|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-180757142 |ULTIMATE.start_main_#t~ite41_Out-180757142|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-180757142, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-180757142, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-180757142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-180757142} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-180757142|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-180757142, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-180757142, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-180757142, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-180757142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 21:02:53,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:02:53,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:02:53 BasicIcfg [2019-12-27 21:02:53,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:02:53,293 INFO L168 Benchmark]: Toolchain (without parser) took 30645.88 ms. Allocated memory was 145.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.1 MB in the beginning and 926.9 MB in the end (delta: -825.8 MB). Peak memory consumption was 522.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:53,294 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:02:53,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.63 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 100.7 MB in the beginning and 152.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:53,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.32 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:53,300 INFO L168 Benchmark]: Boogie Preprocessor took 68.84 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:53,301 INFO L168 Benchmark]: RCFGBuilder took 793.09 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.5 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:53,301 INFO L168 Benchmark]: TraceAbstraction took 28957.76 ms. Allocated memory was 201.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.5 MB in the beginning and 926.9 MB in the end (delta: -825.4 MB). Peak memory consumption was 466.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:02:53,309 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.63 ms. Allocated memory was 145.2 MB in the beginning and 201.3 MB in the end (delta: 56.1 MB). Free memory was 100.7 MB in the beginning and 152.9 MB in the end (delta: -52.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.32 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.84 ms. Allocated memory is still 201.3 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.09 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 101.5 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28957.76 ms. Allocated memory was 201.3 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.5 MB in the beginning and 926.9 MB in the end (delta: -825.4 MB). Peak memory consumption was 466.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5618 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1762 SDtfs, 2676 SDslu, 3565 SDs, 0 SdLazy, 1470 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31130occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 21837 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 36052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...