/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:30:58,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:30:58,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:30:58,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:30:58,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:30:58,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:30:58,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:30:58,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:30:58,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:30:58,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:30:58,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:30:58,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:30:58,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:30:58,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:30:58,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:30:58,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:30:58,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:30:58,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:30:58,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:30:58,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:30:58,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:30:58,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:30:58,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:30:58,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:30:58,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:30:58,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:30:58,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:30:58,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:30:58,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:30:58,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:30:58,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:30:58,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:30:58,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:30:58,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:30:58,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:30:58,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:30:58,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:30:58,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:30:58,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:30:58,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:30:58,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:30:58,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:30:58,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:30:58,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:30:58,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:30:58,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:30:58,375 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:30:58,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:30:58,376 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:30:58,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:30:58,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:30:58,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:30:58,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:30:58,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:30:58,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:30:58,377 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:30:58,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:30:58,377 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:30:58,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:30:58,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:30:58,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:30:58,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:30:58,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:30:58,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:30:58,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:30:58,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:30:58,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:30:58,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:30:58,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:30:58,380 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:30:58,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:30:58,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:30:58,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:30:58,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:30:58,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:30:58,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:30:58,676 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:30:58,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2019-12-18 21:30:58,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eee8c923/b7db9ef974e04bed9ded16f54f80e6e8/FLAGfd18c28ff [2019-12-18 21:30:59,380 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:30:59,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2019-12-18 21:30:59,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eee8c923/b7db9ef974e04bed9ded16f54f80e6e8/FLAGfd18c28ff [2019-12-18 21:30:59,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eee8c923/b7db9ef974e04bed9ded16f54f80e6e8 [2019-12-18 21:30:59,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:30:59,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:30:59,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:30:59,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:30:59,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:30:59,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:30:59" (1/1) ... [2019-12-18 21:30:59,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f98591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:30:59, skipping insertion in model container [2019-12-18 21:30:59,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:30:59" (1/1) ... [2019-12-18 21:30:59,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:30:59,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:31:00,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:31:00,315 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:31:00,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:31:00,469 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:31:00,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00 WrapperNode [2019-12-18 21:31:00,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:31:00,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:31:00,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:31:00,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:31:00,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:31:00,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:31:00,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:31:00,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:31:00,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (1/1) ... [2019-12-18 21:31:00,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:31:00,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:31:00,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:31:00,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:31:00,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (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-18 21:31:00,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:31:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:31:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:31:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:31:00,654 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:31:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:31:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:31:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:31:00,655 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:31:00,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:31:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:31:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:31:00,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:31:00,658 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:31:01,380 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:31:01,381 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:31:01,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:31:01 BoogieIcfgContainer [2019-12-18 21:31:01,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:31:01,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:31:01,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:31:01,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:31:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:30:59" (1/3) ... [2019-12-18 21:31:01,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e39ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:31:01, skipping insertion in model container [2019-12-18 21:31:01,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:00" (2/3) ... [2019-12-18 21:31:01,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e39ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:31:01, skipping insertion in model container [2019-12-18 21:31:01,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:31:01" (3/3) ... [2019-12-18 21:31:01,391 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2019-12-18 21:31:01,402 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:31:01,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:31:01,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:31:01,412 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:31:01,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,450 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,456 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,456 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,468 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,470 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,482 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,483 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,484 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,484 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,504 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,505 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:01,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:31:01,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:31:01,545 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:31:01,545 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:31:01,545 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:31:01,545 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:31:01,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:31:01,546 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:31:01,546 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:31:01,563 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 21:31:01,566 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:31:01,644 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:31:01,644 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:31:01,659 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:31:01,678 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 21:31:01,723 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 21:31:01,724 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:31:01,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:31:01,745 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:31:01,746 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:31:05,242 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:31:05,365 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:31:05,389 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-18 21:31:05,390 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:31:05,393 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-18 21:31:06,414 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-18 21:31:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-18 21:31:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:31:06,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:06,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:06,424 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-18 21:31:06,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:06,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437754672] [2019-12-18 21:31:06,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:06,693 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-18 21:31:06,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437754672] [2019-12-18 21:31:06,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:06,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:31:06,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801696803] [2019-12-18 21:31:06,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:06,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:06,723 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-18 21:31:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:07,141 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-18 21:31:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:07,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:31:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:07,339 INFO L225 Difference]: With dead ends: 17518 [2019-12-18 21:31:07,339 INFO L226 Difference]: Without dead ends: 17154 [2019-12-18 21:31:07,342 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-18 21:31:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-18 21:31:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-18 21:31:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-18 21:31:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-18 21:31:08,835 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-18 21:31:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:08,837 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-18 21:31:08,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-18 21:31:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:31:08,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:08,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:08,842 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-18 21:31:08,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:08,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220890096] [2019-12-18 21:31:08,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:08,977 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-18 21:31:08,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220890096] [2019-12-18 21:31:08,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:08,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:08,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573714194] [2019-12-18 21:31:08,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:31:08,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:31:08,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:31:08,982 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 4 states. [2019-12-18 21:31:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:09,556 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-18 21:31:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:31:09,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:31:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:09,676 INFO L225 Difference]: With dead ends: 26570 [2019-12-18 21:31:09,677 INFO L226 Difference]: Without dead ends: 26556 [2019-12-18 21:31:09,677 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-18 21:31:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-18 21:31:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-18 21:31:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-18 21:31:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-18 21:31:12,058 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-18 21:31:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:12,058 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-18 21:31:12,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:31:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-18 21:31:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:31:12,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:12,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:12,062 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:12,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-18 21:31:12,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:12,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976606415] [2019-12-18 21:31:12,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:12,132 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-18 21:31:12,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976606415] [2019-12-18 21:31:12,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:12,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:12,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932564235] [2019-12-18 21:31:12,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:12,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:12,135 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-18 21:31:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:12,229 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-18 21:31:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:12,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:31:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:12,288 INFO L225 Difference]: With dead ends: 13809 [2019-12-18 21:31:12,289 INFO L226 Difference]: Without dead ends: 13809 [2019-12-18 21:31:12,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-18 21:31:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-18 21:31:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-18 21:31:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-18 21:31:12,673 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-18 21:31:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:12,675 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-18 21:31:12,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-18 21:31:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:31:12,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:12,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:12,685 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-18 21:31:12,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:12,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711455817] [2019-12-18 21:31:12,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:12,771 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-18 21:31:12,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711455817] [2019-12-18 21:31:12,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:12,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:31:12,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297515314] [2019-12-18 21:31:12,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:31:12,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:31:12,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:31:12,774 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 4 states. [2019-12-18 21:31:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:12,800 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-18 21:31:12,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:31:12,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:31:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:12,803 INFO L225 Difference]: With dead ends: 2006 [2019-12-18 21:31:12,804 INFO L226 Difference]: Without dead ends: 2006 [2019-12-18 21:31:12,804 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-18 21:31:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-18 21:31:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-18 21:31:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-18 21:31:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-18 21:31:12,838 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-18 21:31:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:12,838 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-18 21:31:12,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:31:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-18 21:31:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:31:12,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:12,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:12,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-18 21:31:12,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:12,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472692626] [2019-12-18 21:31:12,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:12,901 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-18 21:31:12,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472692626] [2019-12-18 21:31:12,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:12,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:31:12,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55071699] [2019-12-18 21:31:12,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:31:12,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:12,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:31:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:31:12,904 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 5 states. [2019-12-18 21:31:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:12,929 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 21:31:12,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:31:12,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:31:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:12,931 INFO L225 Difference]: With dead ends: 653 [2019-12-18 21:31:12,931 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 21:31:12,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:31:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 21:31:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 21:31:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 21:31:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 21:31:12,941 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 21:31:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:12,942 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 21:31:12,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:31:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 21:31:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:12,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:12,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:12,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:12,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-18 21:31:12,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:12,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867969274] [2019-12-18 21:31:12,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:13,023 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-18 21:31:13,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867969274] [2019-12-18 21:31:13,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:13,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:31:13,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729823269] [2019-12-18 21:31:13,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:13,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:13,026 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 21:31:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:13,210 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-18 21:31:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:13,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:31:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:13,212 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:31:13,213 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:31:13,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:31:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:31:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:31:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-18 21:31:13,223 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-18 21:31:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:13,224 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-18 21:31:13,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-18 21:31:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:13,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:13,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:13,226 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:13,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-18 21:31:13,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:13,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684057690] [2019-12-18 21:31:13,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:13,297 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-18 21:31:13,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684057690] [2019-12-18 21:31:13,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:13,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:31:13,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620037178] [2019-12-18 21:31:13,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:13,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:13,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:13,300 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-18 21:31:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:13,350 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-18 21:31:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:13,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:31:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:13,352 INFO L225 Difference]: With dead ends: 609 [2019-12-18 21:31:13,352 INFO L226 Difference]: Without dead ends: 609 [2019-12-18 21:31:13,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-18 21:31:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-18 21:31:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 21:31:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-18 21:31:13,363 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-18 21:31:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:13,363 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-18 21:31:13,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-18 21:31:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:13,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:13,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:13,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-18 21:31:13,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:13,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338797757] [2019-12-18 21:31:13,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:13,470 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-18 21:31:13,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338797757] [2019-12-18 21:31:13,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:13,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:31:13,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408246334] [2019-12-18 21:31:13,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:31:13,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:31:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:31:13,472 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-18 21:31:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:13,695 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-18 21:31:13,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:31:13,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 21:31:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:13,698 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:31:13,698 INFO L226 Difference]: Without dead ends: 894 [2019-12-18 21:31:13,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:31:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-18 21:31:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-18 21:31:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-18 21:31:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-18 21:31:13,711 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-18 21:31:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:13,712 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-18 21:31:13,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:31:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-18 21:31:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:31:13,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:13,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:13,714 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:13,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-18 21:31:13,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:13,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598285613] [2019-12-18 21:31:13,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:13,815 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-18 21:31:13,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598285613] [2019-12-18 21:31:13,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:13,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:13,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548063591] [2019-12-18 21:31:13,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:13,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:13,818 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 3 states. [2019-12-18 21:31:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:13,864 INFO L93 Difference]: Finished difference Result 719 states and 1687 transitions. [2019-12-18 21:31:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:13,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:31:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:13,866 INFO L225 Difference]: With dead ends: 719 [2019-12-18 21:31:13,866 INFO L226 Difference]: Without dead ends: 719 [2019-12-18 21:31:13,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-18 21:31:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 536. [2019-12-18 21:31:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 21:31:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1264 transitions. [2019-12-18 21:31:13,876 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1264 transitions. Word has length 55 [2019-12-18 21:31:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:13,876 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1264 transitions. [2019-12-18 21:31:13,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1264 transitions. [2019-12-18 21:31:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:31:13,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:13,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:13,879 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash 966806383, now seen corresponding path program 1 times [2019-12-18 21:31:13,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:13,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039209824] [2019-12-18 21:31:13,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:14,012 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-18 21:31:14,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039209824] [2019-12-18 21:31:14,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:14,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:31:14,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577135421] [2019-12-18 21:31:14,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:31:14,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:31:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:31:14,015 INFO L87 Difference]: Start difference. First operand 536 states and 1264 transitions. Second operand 6 states. [2019-12-18 21:31:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:14,104 INFO L93 Difference]: Finished difference Result 906 states and 2043 transitions. [2019-12-18 21:31:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:31:14,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 21:31:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:14,105 INFO L225 Difference]: With dead ends: 906 [2019-12-18 21:31:14,105 INFO L226 Difference]: Without dead ends: 372 [2019-12-18 21:31:14,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:31:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-18 21:31:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 319. [2019-12-18 21:31:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-18 21:31:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 591 transitions. [2019-12-18 21:31:14,115 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 591 transitions. Word has length 56 [2019-12-18 21:31:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:14,115 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 591 transitions. [2019-12-18 21:31:14,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:31:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 591 transitions. [2019-12-18 21:31:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:31:14,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:14,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:14,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:14,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:14,120 INFO L82 PathProgramCache]: Analyzing trace with hash 256747969, now seen corresponding path program 2 times [2019-12-18 21:31:14,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:14,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012166411] [2019-12-18 21:31:14,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:14,266 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-18 21:31:14,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012166411] [2019-12-18 21:31:14,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:14,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:14,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788775378] [2019-12-18 21:31:14,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:14,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:14,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:14,268 INFO L87 Difference]: Start difference. First operand 319 states and 591 transitions. Second operand 3 states. [2019-12-18 21:31:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:14,282 INFO L93 Difference]: Finished difference Result 307 states and 552 transitions. [2019-12-18 21:31:14,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:14,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:31:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:14,284 INFO L225 Difference]: With dead ends: 307 [2019-12-18 21:31:14,284 INFO L226 Difference]: Without dead ends: 307 [2019-12-18 21:31:14,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-18 21:31:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 280. [2019-12-18 21:31:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-18 21:31:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-18 21:31:14,289 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 56 [2019-12-18 21:31:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:14,289 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-18 21:31:14,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-18 21:31:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:31:14,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:14,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:14,290 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 1 times [2019-12-18 21:31:14,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:14,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140480581] [2019-12-18 21:31:14,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:31:14,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140480581] [2019-12-18 21:31:14,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:14,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:31:14,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618671473] [2019-12-18 21:31:14,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:31:14,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:14,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:31:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:31:14,961 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 18 states. [2019-12-18 21:31:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:16,318 INFO L93 Difference]: Finished difference Result 774 states and 1373 transitions. [2019-12-18 21:31:16,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 21:31:16,318 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-18 21:31:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:16,320 INFO L225 Difference]: With dead ends: 774 [2019-12-18 21:31:16,320 INFO L226 Difference]: Without dead ends: 740 [2019-12-18 21:31:16,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:31:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-12-18 21:31:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 376. [2019-12-18 21:31:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-18 21:31:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 664 transitions. [2019-12-18 21:31:16,330 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 664 transitions. Word has length 57 [2019-12-18 21:31:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:16,330 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 664 transitions. [2019-12-18 21:31:16,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:31:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 664 transitions. [2019-12-18 21:31:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:31:16,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:16,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:16,332 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1220738587, now seen corresponding path program 2 times [2019-12-18 21:31:16,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:16,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524881394] [2019-12-18 21:31:16,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:16,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-18 21:31:16,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524881394] [2019-12-18 21:31:16,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:16,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:31:16,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348183132] [2019-12-18 21:31:16,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:31:16,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:31:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:31:16,646 INFO L87 Difference]: Start difference. First operand 376 states and 664 transitions. Second operand 13 states. [2019-12-18 21:31:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:17,238 INFO L93 Difference]: Finished difference Result 648 states and 1113 transitions. [2019-12-18 21:31:17,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:31:17,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:31:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:17,240 INFO L225 Difference]: With dead ends: 648 [2019-12-18 21:31:17,240 INFO L226 Difference]: Without dead ends: 614 [2019-12-18 21:31:17,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:31:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-12-18 21:31:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 414. [2019-12-18 21:31:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-18 21:31:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 736 transitions. [2019-12-18 21:31:17,248 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 736 transitions. Word has length 57 [2019-12-18 21:31:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:17,249 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 736 transitions. [2019-12-18 21:31:17,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:31:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 736 transitions. [2019-12-18 21:31:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:31:17,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:17,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:17,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:31:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 3 times [2019-12-18 21:31:17,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:17,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77994647] [2019-12-18 21:31:17,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:31:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:31:17,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:31:17,361 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:31:17,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1208~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1208~0.base_25|) |v_ULTIMATE.start_main_~#t1208~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1208~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$r_buff1_thd0~0_51) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1208~0.base_25|) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1208~0.base_25|)) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= 0 |v_ULTIMATE.start_main_~#t1208~0.offset_19|) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1208~0.base_25| 4) |v_#length_23|) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= v_~y$r_buff0_thd1~0_6 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1210~0.base=|v_ULTIMATE.start_main_~#t1210~0.base_25|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ULTIMATE.start_main_~#t1210~0.offset=|v_ULTIMATE.start_main_~#t1210~0.offset_19|, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1208~0.offset=|v_ULTIMATE.start_main_~#t1208~0.offset_19|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1209~0.offset=|v_ULTIMATE.start_main_~#t1209~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, ULTIMATE.start_main_~#t1209~0.base=|v_ULTIMATE.start_main_~#t1209~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_~#t1208~0.base=|v_ULTIMATE.start_main_~#t1208~0.base_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1210~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t1210~0.offset, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1208~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1209~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1209~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1208~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:31:17,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1209~0.base_13| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1209~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t1209~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1209~0.base_13|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1209~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1209~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1209~0.base_13|) |v_ULTIMATE.start_main_~#t1209~0.offset_11| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1209~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1209~0.offset=|v_ULTIMATE.start_main_~#t1209~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1209~0.base=|v_ULTIMATE.start_main_~#t1209~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1209~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1209~0.base] because there is no mapped edge [2019-12-18 21:31:17,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (= |v_ULTIMATE.start_main_~#t1210~0.offset_11| 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1210~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1210~0.base_13| 0)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1210~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1210~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1210~0.base_13|) |v_ULTIMATE.start_main_~#t1210~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1210~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1210~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1210~0.base=|v_ULTIMATE.start_main_~#t1210~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1210~0.offset=|v_ULTIMATE.start_main_~#t1210~0.offset_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1210~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1210~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:31:17,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:31:17,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:31:17,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In579360522 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In579360522 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out579360522| ~y$w_buff0_used~0_In579360522)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out579360522| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In579360522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In579360522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In579360522, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out579360522|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In579360522} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 21:31:17,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1257033419 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1257033419 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1257033419 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1257033419 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-1257033419|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1257033419 |P2Thread1of1ForFork0_#t~ite12_Out-1257033419|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1257033419, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1257033419, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1257033419, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1257033419} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1257033419, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1257033419, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1257033419|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1257033419, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1257033419} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 21:31:17,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1594608881 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1594608881 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1594608881)) (and (= ~y$r_buff0_thd3~0_In-1594608881 ~y$r_buff0_thd3~0_Out-1594608881) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594608881, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1594608881} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594608881, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1594608881, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1594608881|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 21:31:17,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In399809451 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In399809451 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In399809451 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In399809451 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In399809451 |P2Thread1of1ForFork0_#t~ite14_Out399809451|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out399809451|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In399809451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In399809451, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In399809451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In399809451} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out399809451|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In399809451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In399809451, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In399809451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In399809451} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 21:31:17,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:31:17,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1723467215 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1723467215 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out1723467215| ~y~0_In1723467215)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out1723467215| ~y$w_buff1~0_In1723467215) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1723467215, ~y$w_buff1~0=~y$w_buff1~0_In1723467215, ~y~0=~y~0_In1723467215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1723467215} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1723467215, ~y$w_buff1~0=~y$w_buff1~0_In1723467215, ~y~0=~y~0_In1723467215, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out1723467215|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1723467215} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:31:17,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:31:17,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-37146944 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-37146944 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out-37146944| ~y$w_buff0_used~0_In-37146944) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-37146944| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-37146944, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-37146944} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-37146944, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-37146944, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-37146944|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:31:17,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1288313046 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1288313046 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1288313046 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1288313046 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out-1288313046| ~y$w_buff1_used~0_In-1288313046)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite6_Out-1288313046| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1288313046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288313046, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1288313046, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1288313046} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1288313046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1288313046, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1288313046, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1288313046|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1288313046} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:31:17,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In169011509 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In169011509 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite7_Out169011509|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In169011509 |P1Thread1of1ForFork2_#t~ite7_Out169011509|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In169011509, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In169011509} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In169011509, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In169011509, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out169011509|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:31:17,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2142108712 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2142108712 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2142108712 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-2142108712 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-2142108712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-2142108712 |P1Thread1of1ForFork2_#t~ite8_Out-2142108712|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2142108712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142108712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2142108712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142108712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2142108712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142108712, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-2142108712|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2142108712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142108712} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:31:17,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:31:17,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:31:17,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-299571826 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-299571826 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite18_Out-299571826| |ULTIMATE.start_main_#t~ite19_Out-299571826|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-299571826 |ULTIMATE.start_main_#t~ite18_Out-299571826|) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite18_Out-299571826| ~y~0_In-299571826) (or .cse0 .cse2) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-299571826, ~y~0=~y~0_In-299571826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-299571826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-299571826} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-299571826, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-299571826|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-299571826|, ~y~0=~y~0_In-299571826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-299571826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-299571826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:31:17,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1791050693 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1791050693 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1791050693| ~y$w_buff0_used~0_In1791050693)) (and (= |ULTIMATE.start_main_#t~ite20_Out1791050693| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1791050693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1791050693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1791050693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1791050693, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1791050693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:31:17,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-520335020 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-520335020 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-520335020 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-520335020 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-520335020|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-520335020 |ULTIMATE.start_main_#t~ite21_Out-520335020|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-520335020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-520335020, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-520335020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520335020} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-520335020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-520335020, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-520335020|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-520335020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-520335020} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:31:17,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In972481706 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In972481706 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite22_Out972481706| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out972481706| ~y$r_buff0_thd0~0_In972481706)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In972481706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In972481706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In972481706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In972481706, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out972481706|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:31:17,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1710314065 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1710314065 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1710314065 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1710314065 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1710314065|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1710314065 |ULTIMATE.start_main_#t~ite23_Out-1710314065|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1710314065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1710314065, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1710314065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1710314065} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1710314065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1710314065, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1710314065, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1710314065|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1710314065} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:31:17,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2033851894 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2033851894 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-2033851894 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd0~0_In-2033851894 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-2033851894 256)))) .cse1 (= |ULTIMATE.start_main_#t~ite33_Out-2033851894| |ULTIMATE.start_main_#t~ite32_Out-2033851894|) (= ~y$w_buff1~0_In-2033851894 |ULTIMATE.start_main_#t~ite32_Out-2033851894|)) (and (= |ULTIMATE.start_main_#t~ite32_In-2033851894| |ULTIMATE.start_main_#t~ite32_Out-2033851894|) (not .cse1) (= ~y$w_buff1~0_In-2033851894 |ULTIMATE.start_main_#t~ite33_Out-2033851894|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2033851894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033851894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033851894, ~weak$$choice2~0=~weak$$choice2~0_In-2033851894, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033851894, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-2033851894|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033851894} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2033851894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033851894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033851894, ~weak$$choice2~0=~weak$$choice2~0_In-2033851894, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-2033851894|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033851894, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-2033851894|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033851894} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-18 21:31:17,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-832657926 256)))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In-832657926 |ULTIMATE.start_main_#t~ite36_Out-832657926|) (= |ULTIMATE.start_main_#t~ite35_In-832657926| |ULTIMATE.start_main_#t~ite35_Out-832657926|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite35_Out-832657926| |ULTIMATE.start_main_#t~ite36_Out-832657926|) (= ~y$w_buff0_used~0_In-832657926 |ULTIMATE.start_main_#t~ite35_Out-832657926|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-832657926 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-832657926 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-832657926 256) 0)) (= (mod ~y$w_buff0_used~0_In-832657926 256) 0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-832657926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-832657926, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-832657926|, ~weak$$choice2~0=~weak$$choice2~0_In-832657926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-832657926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-832657926} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-832657926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-832657926, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-832657926|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-832657926|, ~weak$$choice2~0=~weak$$choice2~0_In-832657926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-832657926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-832657926} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:31:17,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-522772063 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-522772063| ~y$w_buff1_used~0_In-522772063) (= |ULTIMATE.start_main_#t~ite38_In-522772063| |ULTIMATE.start_main_#t~ite38_Out-522772063|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-522772063 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-522772063 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-522772063 256)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-522772063 256) 0)))) .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-522772063| ~y$w_buff1_used~0_In-522772063) (= |ULTIMATE.start_main_#t~ite38_Out-522772063| |ULTIMATE.start_main_#t~ite39_Out-522772063|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-522772063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-522772063, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-522772063|, ~weak$$choice2~0=~weak$$choice2~0_In-522772063, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-522772063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-522772063} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-522772063, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-522772063|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-522772063, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-522772063|, ~weak$$choice2~0=~weak$$choice2~0_In-522772063, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-522772063, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-522772063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:31:17,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:31:17,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:31:17,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:31:17,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:31:17 BasicIcfg [2019-12-18 21:31:17,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:31:17,476 INFO L168 Benchmark]: Toolchain (without parser) took 17800.39 ms. Allocated memory was 138.4 MB in the beginning and 870.3 MB in the end (delta: 731.9 MB). Free memory was 101.2 MB in the beginning and 290.8 MB in the end (delta: -189.5 MB). Peak memory consumption was 542.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:17,477 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:31:17,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.18 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 154.6 MB in the end (delta: -53.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:17,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:17,479 INFO L168 Benchmark]: Boogie Preprocessor took 43.30 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 149.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:17,480 INFO L168 Benchmark]: RCFGBuilder took 797.82 ms. Allocated memory is still 202.9 MB. Free memory was 149.3 MB in the beginning and 102.2 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:17,481 INFO L168 Benchmark]: TraceAbstraction took 16091.29 ms. Allocated memory was 202.9 MB in the beginning and 870.3 MB in the end (delta: 667.4 MB). Free memory was 101.6 MB in the beginning and 290.8 MB in the end (delta: -189.2 MB). Peak memory consumption was 478.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:31:17,488 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 792.18 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 154.6 MB in the end (delta: -53.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.30 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 149.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.82 ms. Allocated memory is still 202.9 MB. Free memory was 149.3 MB in the beginning and 102.2 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16091.29 ms. Allocated memory was 202.9 MB in the beginning and 870.3 MB in the end (delta: 667.4 MB). Free memory was 101.6 MB in the beginning and 290.8 MB in the end (delta: -189.2 MB). Peak memory consumption was 478.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1296 SDtfs, 1237 SDslu, 3038 SDs, 0 SdLazy, 1975 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 3322 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 110241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...