/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:28:49,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:28:49,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:28:49,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:28:49,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:28:49,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:28:49,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:28:49,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:28:49,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:28:49,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:28:49,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:28:49,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:28:49,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:28:49,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:28:49,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:28:49,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:28:49,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:28:49,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:28:49,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:28:49,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:28:49,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:28:49,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:28:49,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:28:49,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:28:49,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:28:49,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:28:49,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:28:49,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:28:49,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:28:49,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:28:49,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:28:49,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:28:49,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:28:49,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:28:49,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:28:49,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:28:49,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:28:49,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:28:49,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:28:49,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:28:49,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:28:49,396 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-SemanticLbe.epf [2019-12-18 17:28:49,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:28:49,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:28:49,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:28:49,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:28:49,421 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:28:49,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:28:49,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:28:49,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:28:49,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:28:49,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:28:49,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:28:49,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:28:49,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:28:49,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:28:49,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:28:49,424 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:28:49,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:28:49,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:28:49,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:28:49,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:28:49,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:28:49,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:28:49,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:28:49,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:28:49,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:28:49,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:28:49,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:28:49,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:28:49,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:28:49,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:28:49,702 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:28:49,706 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:28:49,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:28:49,708 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:28:49,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-18 17:28:49,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e819a49a/5d5037e7888c4dcba4a84463682efee9/FLAGe5d9493fc [2019-12-18 17:28:50,364 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:28:50,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-18 17:28:50,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e819a49a/5d5037e7888c4dcba4a84463682efee9/FLAGe5d9493fc [2019-12-18 17:28:50,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e819a49a/5d5037e7888c4dcba4a84463682efee9 [2019-12-18 17:28:50,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:28:50,651 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:28:50,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:28:50,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:28:50,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:28:50,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:28:50" (1/1) ... [2019-12-18 17:28:50,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3265302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:50, skipping insertion in model container [2019-12-18 17:28:50,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:28:50" (1/1) ... [2019-12-18 17:28:50,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:28:50,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:28:51,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:28:51,209 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:28:51,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:28:51,392 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:28:51,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51 WrapperNode [2019-12-18 17:28:51,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:28:51,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:28:51,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:28:51,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:28:51,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:28:51,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:28:51,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:28:51,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:28:51,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (1/1) ... [2019-12-18 17:28:51,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:28:51,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:28:51,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:28:51,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:28:51,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (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 17:28:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:28:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:28:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:28:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:28:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:28:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:28:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:28:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:28:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:28:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:28:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:28:51,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:28:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:28:51,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:28:51,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:28:51,591 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 17:28:52,355 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:28:52,355 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:28:52,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:28:52 BoogieIcfgContainer [2019-12-18 17:28:52,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:28:52,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:28:52,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:28:52,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:28:52,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:28:50" (1/3) ... [2019-12-18 17:28:52,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ee0af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:28:52, skipping insertion in model container [2019-12-18 17:28:52,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:28:51" (2/3) ... [2019-12-18 17:28:52,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ee0af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:28:52, skipping insertion in model container [2019-12-18 17:28:52,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:28:52" (3/3) ... [2019-12-18 17:28:52,366 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2019-12-18 17:28:52,377 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:28:52,377 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:28:52,387 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:28:52,388 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:28:52,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,443 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,445 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,445 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,477 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,477 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,477 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,477 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,477 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,478 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,480 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,481 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,482 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,483 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,484 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,487 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,488 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,496 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,507 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,507 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,510 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,510 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,512 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:28:52,528 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:28:52,549 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:28:52,549 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:28:52,549 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:28:52,550 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:28:52,550 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:28:52,550 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:28:52,550 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:28:52,550 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:28:52,570 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 17:28:52,573 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:28:52,674 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:28:52,674 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:28:52,697 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:28:52,719 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 17:28:52,788 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 17:28:52,789 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:28:52,795 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:28:52,812 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:28:52,813 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:28:56,225 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-18 17:28:58,377 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:28:58,543 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:28:58,569 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-18 17:28:58,569 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-18 17:28:58,573 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-18 17:29:01,235 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-18 17:29:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-18 17:29:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:29:01,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:01,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:01,245 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:01,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:01,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-18 17:29:01,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:01,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853816699] [2019-12-18 17:29:01,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:01,587 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 17:29:01,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853816699] [2019-12-18 17:29:01,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:01,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:29:01,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290577316] [2019-12-18 17:29:01,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:01,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:01,618 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-18 17:29:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:02,321 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-18 17:29:02,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:02,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:29:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:02,881 INFO L225 Difference]: With dead ends: 33638 [2019-12-18 17:29:02,881 INFO L226 Difference]: Without dead ends: 32966 [2019-12-18 17:29:02,883 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 17:29:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-18 17:29:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-18 17:29:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-18 17:29:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-18 17:29:04,691 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-18 17:29:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:04,693 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-18 17:29:04,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-18 17:29:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:29:04,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:04,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:04,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-18 17:29:04,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:04,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56586951] [2019-12-18 17:29:04,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:04,879 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 17:29:04,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56586951] [2019-12-18 17:29:04,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:04,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:04,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122627827] [2019-12-18 17:29:04,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:29:04,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:04,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:29:04,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:29:04,884 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-18 17:29:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:06,906 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-18 17:29:06,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:29:06,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:29:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:07,143 INFO L225 Difference]: With dead ends: 44494 [2019-12-18 17:29:07,143 INFO L226 Difference]: Without dead ends: 44494 [2019-12-18 17:29:07,145 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 17:29:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-18 17:29:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-18 17:29:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-18 17:29:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-18 17:29:09,138 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-18 17:29:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:09,138 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-18 17:29:09,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:29:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-18 17:29:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:29:09,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:09,141 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:09,142 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-18 17:29:09,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:09,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099084334] [2019-12-18 17:29:09,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:09,248 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 17:29:09,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099084334] [2019-12-18 17:29:09,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:09,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:09,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382744080] [2019-12-18 17:29:09,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:29:09,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:09,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:29:09,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:29:09,254 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-18 17:29:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:09,806 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-18 17:29:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:29:09,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:29:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:12,146 INFO L225 Difference]: With dead ends: 62082 [2019-12-18 17:29:12,147 INFO L226 Difference]: Without dead ends: 62054 [2019-12-18 17:29:12,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-18 17:29:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-18 17:29:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-18 17:29:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-18 17:29:13,859 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-18 17:29:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:13,859 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-18 17:29:13,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:29:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-18 17:29:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:29:13,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:13,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:13,875 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:13,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-18 17:29:13,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:13,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634536767] [2019-12-18 17:29:13,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:13,962 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 17:29:13,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634536767] [2019-12-18 17:29:13,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:13,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:29:13,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848672385] [2019-12-18 17:29:13,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:29:13,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:29:13,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:13,965 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-18 17:29:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:15,094 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-18 17:29:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:29:15,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 17:29:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:15,296 INFO L225 Difference]: With dead ends: 68854 [2019-12-18 17:29:15,296 INFO L226 Difference]: Without dead ends: 68826 [2019-12-18 17:29:15,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:29:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-18 17:29:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-18 17:29:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-18 17:29:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-18 17:29:19,388 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-18 17:29:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:19,388 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-18 17:29:19,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:29:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-18 17:29:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:29:19,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:19,451 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] [2019-12-18 17:29:19,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-18 17:29:19,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:19,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761002579] [2019-12-18 17:29:19,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:19,503 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 17:29:19,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761002579] [2019-12-18 17:29:19,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:19,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:29:19,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387498213] [2019-12-18 17:29:19,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:19,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:19,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:19,506 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-18 17:29:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:19,862 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-18 17:29:19,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:19,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 17:29:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:20,025 INFO L225 Difference]: With dead ends: 64130 [2019-12-18 17:29:20,026 INFO L226 Difference]: Without dead ends: 64130 [2019-12-18 17:29:20,026 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 17:29:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-18 17:29:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-18 17:29:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-18 17:29:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-18 17:29:23,775 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-18 17:29:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:23,776 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-18 17:29:23,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-18 17:29:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:29:23,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:23,811 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] [2019-12-18 17:29:23,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-18 17:29:23,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:23,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929933187] [2019-12-18 17:29:23,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:23,898 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 17:29:23,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929933187] [2019-12-18 17:29:23,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:23,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:29:23,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299821636] [2019-12-18 17:29:23,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:23,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:23,901 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-18 17:29:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:25,063 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-18 17:29:25,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:29:25,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:29:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:25,253 INFO L225 Difference]: With dead ends: 81602 [2019-12-18 17:29:25,253 INFO L226 Difference]: Without dead ends: 81538 [2019-12-18 17:29:25,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:29:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-18 17:29:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-18 17:29:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:29:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-18 17:29:29,451 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-18 17:29:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:29,451 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-18 17:29:29,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:29:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-18 17:29:29,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:29,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:29,522 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] [2019-12-18 17:29:29,522 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:29,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-18 17:29:29,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:29,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656202033] [2019-12-18 17:29:29,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:29,605 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 17:29:29,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656202033] [2019-12-18 17:29:29,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:29,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:29,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295121212] [2019-12-18 17:29:29,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:29,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:29,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:29,609 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-18 17:29:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:30,497 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-18 17:29:30,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:30,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-18 17:29:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:30,679 INFO L225 Difference]: With dead ends: 65578 [2019-12-18 17:29:30,680 INFO L226 Difference]: Without dead ends: 65578 [2019-12-18 17:29:30,680 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 17:29:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-18 17:29:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-18 17:29:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-18 17:29:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-18 17:29:32,686 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-18 17:29:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:32,687 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-18 17:29:32,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-18 17:29:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:32,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:32,750 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] [2019-12-18 17:29:32,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:32,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-18 17:29:32,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:32,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755116835] [2019-12-18 17:29:32,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:32,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755116835] [2019-12-18 17:29:32,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:32,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:29:32,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246683966] [2019-12-18 17:29:32,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:29:32,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:29:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:29:32,926 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 9 states. [2019-12-18 17:29:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:37,400 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-18 17:29:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:29:37,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-18 17:29:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:37,621 INFO L225 Difference]: With dead ends: 89414 [2019-12-18 17:29:37,621 INFO L226 Difference]: Without dead ends: 89310 [2019-12-18 17:29:37,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:29:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-18 17:29:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-18 17:29:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-18 17:29:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-18 17:29:39,286 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-18 17:29:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:39,286 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-18 17:29:39,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:29:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-18 17:29:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 17:29:39,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:39,353 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] [2019-12-18 17:29:39,354 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-18 17:29:39,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:39,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477576614] [2019-12-18 17:29:39,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:39,434 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 17:29:39,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477576614] [2019-12-18 17:29:39,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:39,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:29:39,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372974089] [2019-12-18 17:29:39,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:29:39,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:29:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:29:39,437 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 4 states. [2019-12-18 17:29:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:39,640 INFO L93 Difference]: Finished difference Result 47360 states and 179978 transitions. [2019-12-18 17:29:39,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:29:39,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-18 17:29:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:39,738 INFO L225 Difference]: With dead ends: 47360 [2019-12-18 17:29:39,738 INFO L226 Difference]: Without dead ends: 46252 [2019-12-18 17:29:39,738 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 17:29:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46252 states. [2019-12-18 17:29:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46252 to 46252. [2019-12-18 17:29:41,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46252 states. [2019-12-18 17:29:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 176502 transitions. [2019-12-18 17:29:41,223 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 176502 transitions. Word has length 35 [2019-12-18 17:29:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:41,224 INFO L462 AbstractCegarLoop]: Abstraction has 46252 states and 176502 transitions. [2019-12-18 17:29:41,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:29:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 176502 transitions. [2019-12-18 17:29:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 17:29:41,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:41,261 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] [2019-12-18 17:29:41,261 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1617947594, now seen corresponding path program 1 times [2019-12-18 17:29:41,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:41,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137384528] [2019-12-18 17:29:41,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:41,400 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 17:29:41,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137384528] [2019-12-18 17:29:41,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:41,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:29:41,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939147742] [2019-12-18 17:29:41,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:41,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:41,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:41,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:41,402 INFO L87 Difference]: Start difference. First operand 46252 states and 176502 transitions. Second operand 6 states. [2019-12-18 17:29:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:41,852 INFO L93 Difference]: Finished difference Result 58248 states and 224178 transitions. [2019-12-18 17:29:41,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:29:41,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-18 17:29:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:41,968 INFO L225 Difference]: With dead ends: 58248 [2019-12-18 17:29:41,968 INFO L226 Difference]: Without dead ends: 55647 [2019-12-18 17:29:41,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55647 states. [2019-12-18 17:29:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55647 to 51679. [2019-12-18 17:29:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51679 states. [2019-12-18 17:29:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51679 states to 51679 states and 198408 transitions. [2019-12-18 17:29:43,572 INFO L78 Accepts]: Start accepts. Automaton has 51679 states and 198408 transitions. Word has length 36 [2019-12-18 17:29:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:43,573 INFO L462 AbstractCegarLoop]: Abstraction has 51679 states and 198408 transitions. [2019-12-18 17:29:43,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:29:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 51679 states and 198408 transitions. [2019-12-18 17:29:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 17:29:43,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:43,622 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] [2019-12-18 17:29:43,623 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:43,623 INFO L82 PathProgramCache]: Analyzing trace with hash 859028932, now seen corresponding path program 1 times [2019-12-18 17:29:43,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:43,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74016023] [2019-12-18 17:29:43,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:43,751 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 17:29:43,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74016023] [2019-12-18 17:29:43,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:43,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:29:43,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655252013] [2019-12-18 17:29:43,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:29:43,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:43,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:29:43,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:43,754 INFO L87 Difference]: Start difference. First operand 51679 states and 198408 transitions. Second operand 7 states. [2019-12-18 17:29:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:44,340 INFO L93 Difference]: Finished difference Result 82547 states and 311405 transitions. [2019-12-18 17:29:44,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:29:44,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-18 17:29:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:44,447 INFO L225 Difference]: With dead ends: 82547 [2019-12-18 17:29:44,447 INFO L226 Difference]: Without dead ends: 49109 [2019-12-18 17:29:44,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49109 states. [2019-12-18 17:29:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49109 to 45174. [2019-12-18 17:29:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45174 states. [2019-12-18 17:29:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45174 states to 45174 states and 171775 transitions. [2019-12-18 17:29:45,918 INFO L78 Accepts]: Start accepts. Automaton has 45174 states and 171775 transitions. Word has length 38 [2019-12-18 17:29:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:45,918 INFO L462 AbstractCegarLoop]: Abstraction has 45174 states and 171775 transitions. [2019-12-18 17:29:45,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:29:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 45174 states and 171775 transitions. [2019-12-18 17:29:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 17:29:45,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:45,959 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] [2019-12-18 17:29:45,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash -308573782, now seen corresponding path program 2 times [2019-12-18 17:29:45,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:45,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533689284] [2019-12-18 17:29:45,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:46,042 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 17:29:46,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533689284] [2019-12-18 17:29:46,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:46,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:29:46,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625216700] [2019-12-18 17:29:46,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:29:46,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:46,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:29:46,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:29:46,045 INFO L87 Difference]: Start difference. First operand 45174 states and 171775 transitions. Second operand 5 states. [2019-12-18 17:29:46,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:46,145 INFO L93 Difference]: Finished difference Result 17174 states and 54804 transitions. [2019-12-18 17:29:46,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:29:46,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-18 17:29:46,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:46,168 INFO L225 Difference]: With dead ends: 17174 [2019-12-18 17:29:46,168 INFO L226 Difference]: Without dead ends: 16368 [2019-12-18 17:29:46,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16368 states. [2019-12-18 17:29:46,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16368 to 16368. [2019-12-18 17:29:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16368 states. [2019-12-18 17:29:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16368 states to 16368 states and 52247 transitions. [2019-12-18 17:29:46,430 INFO L78 Accepts]: Start accepts. Automaton has 16368 states and 52247 transitions. Word has length 38 [2019-12-18 17:29:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:46,430 INFO L462 AbstractCegarLoop]: Abstraction has 16368 states and 52247 transitions. [2019-12-18 17:29:46,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:29:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 16368 states and 52247 transitions. [2019-12-18 17:29:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:29:46,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:46,441 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] [2019-12-18 17:29:46,441 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:46,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2053204377, now seen corresponding path program 1 times [2019-12-18 17:29:46,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:46,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499754070] [2019-12-18 17:29:46,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:46,614 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 17:29:46,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499754070] [2019-12-18 17:29:46,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:46,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:29:46,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684138568] [2019-12-18 17:29:46,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:29:46,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:29:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:29:46,616 INFO L87 Difference]: Start difference. First operand 16368 states and 52247 transitions. Second operand 10 states. [2019-12-18 17:29:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:47,307 INFO L93 Difference]: Finished difference Result 25166 states and 80853 transitions. [2019-12-18 17:29:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:29:47,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-12-18 17:29:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:47,352 INFO L225 Difference]: With dead ends: 25166 [2019-12-18 17:29:47,352 INFO L226 Difference]: Without dead ends: 21990 [2019-12-18 17:29:47,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:29:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21990 states. [2019-12-18 17:29:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21990 to 19100. [2019-12-18 17:29:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19100 states. [2019-12-18 17:29:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19100 states to 19100 states and 60950 transitions. [2019-12-18 17:29:47,740 INFO L78 Accepts]: Start accepts. Automaton has 19100 states and 60950 transitions. Word has length 39 [2019-12-18 17:29:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:47,741 INFO L462 AbstractCegarLoop]: Abstraction has 19100 states and 60950 transitions. [2019-12-18 17:29:47,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:29:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 19100 states and 60950 transitions. [2019-12-18 17:29:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:29:47,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:47,755 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] [2019-12-18 17:29:47,756 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:47,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1961307543, now seen corresponding path program 1 times [2019-12-18 17:29:47,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:47,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102219549] [2019-12-18 17:29:47,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:47,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 17:29:47,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102219549] [2019-12-18 17:29:47,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:47,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:29:47,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802565448] [2019-12-18 17:29:47,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:29:47,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:47,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:29:47,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:47,980 INFO L87 Difference]: Start difference. First operand 19100 states and 60950 transitions. Second operand 11 states. [2019-12-18 17:29:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:50,015 INFO L93 Difference]: Finished difference Result 35762 states and 115036 transitions. [2019-12-18 17:29:50,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 17:29:50,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-18 17:29:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:50,061 INFO L225 Difference]: With dead ends: 35762 [2019-12-18 17:29:50,061 INFO L226 Difference]: Without dead ends: 29995 [2019-12-18 17:29:50,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2019-12-18 17:29:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29995 states. [2019-12-18 17:29:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29995 to 21498. [2019-12-18 17:29:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21498 states. [2019-12-18 17:29:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21498 states to 21498 states and 68673 transitions. [2019-12-18 17:29:50,439 INFO L78 Accepts]: Start accepts. Automaton has 21498 states and 68673 transitions. Word has length 40 [2019-12-18 17:29:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:50,439 INFO L462 AbstractCegarLoop]: Abstraction has 21498 states and 68673 transitions. [2019-12-18 17:29:50,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:29:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 21498 states and 68673 transitions. [2019-12-18 17:29:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:29:50,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:50,457 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] [2019-12-18 17:29:50,457 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash -579236051, now seen corresponding path program 2 times [2019-12-18 17:29:50,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:50,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738763220] [2019-12-18 17:29:50,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:50,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738763220] [2019-12-18 17:29:50,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:50,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:29:50,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643734655] [2019-12-18 17:29:50,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:29:50,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:29:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:29:50,552 INFO L87 Difference]: Start difference. First operand 21498 states and 68673 transitions. Second operand 6 states. [2019-12-18 17:29:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:50,622 INFO L93 Difference]: Finished difference Result 3504 states and 8923 transitions. [2019-12-18 17:29:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:29:50,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 17:29:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:50,626 INFO L225 Difference]: With dead ends: 3504 [2019-12-18 17:29:50,626 INFO L226 Difference]: Without dead ends: 3143 [2019-12-18 17:29:50,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:29:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2019-12-18 17:29:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3011. [2019-12-18 17:29:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3011 states. [2019-12-18 17:29:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 7460 transitions. [2019-12-18 17:29:50,657 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 7460 transitions. Word has length 40 [2019-12-18 17:29:50,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:50,657 INFO L462 AbstractCegarLoop]: Abstraction has 3011 states and 7460 transitions. [2019-12-18 17:29:50,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:29:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 7460 transitions. [2019-12-18 17:29:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:29:50,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:50,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:50,660 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:50,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:50,660 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 1 times [2019-12-18 17:29:50,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:50,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056851423] [2019-12-18 17:29:50,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:50,765 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 17:29:50,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056851423] [2019-12-18 17:29:50,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:50,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:29:50,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834130453] [2019-12-18 17:29:50,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:29:50,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:29:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:50,769 INFO L87 Difference]: Start difference. First operand 3011 states and 7460 transitions. Second operand 7 states. [2019-12-18 17:29:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:50,855 INFO L93 Difference]: Finished difference Result 1216 states and 3318 transitions. [2019-12-18 17:29:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:29:50,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 17:29:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:50,858 INFO L225 Difference]: With dead ends: 1216 [2019-12-18 17:29:50,858 INFO L226 Difference]: Without dead ends: 1170 [2019-12-18 17:29:50,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-18 17:29:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1058. [2019-12-18 17:29:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-18 17:29:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2908 transitions. [2019-12-18 17:29:50,876 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2908 transitions. Word has length 48 [2019-12-18 17:29:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:50,876 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2908 transitions. [2019-12-18 17:29:50,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:29:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2908 transitions. [2019-12-18 17:29:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:29:50,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:50,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, 1, 1, 1] [2019-12-18 17:29:50,878 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-18 17:29:50,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:50,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824625619] [2019-12-18 17:29:50,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:51,055 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 17:29:51,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824625619] [2019-12-18 17:29:51,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:51,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:29:51,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888858032] [2019-12-18 17:29:51,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:29:51,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:29:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:29:51,057 INFO L87 Difference]: Start difference. First operand 1058 states and 2908 transitions. Second operand 7 states. [2019-12-18 17:29:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:51,203 INFO L93 Difference]: Finished difference Result 1768 states and 4665 transitions. [2019-12-18 17:29:51,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:29:51,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 17:29:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:51,205 INFO L225 Difference]: With dead ends: 1768 [2019-12-18 17:29:51,205 INFO L226 Difference]: Without dead ends: 683 [2019-12-18 17:29:51,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:29:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-18 17:29:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 595. [2019-12-18 17:29:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-12-18 17:29:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1322 transitions. [2019-12-18 17:29:51,217 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1322 transitions. Word has length 59 [2019-12-18 17:29:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:51,218 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 1322 transitions. [2019-12-18 17:29:51,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:29:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1322 transitions. [2019-12-18 17:29:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:29:51,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:51,219 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, 1, 1] [2019-12-18 17:29:51,219 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 2 times [2019-12-18 17:29:51,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:51,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96589172] [2019-12-18 17:29:51,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:51,272 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 17:29:51,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96589172] [2019-12-18 17:29:51,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:51,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:51,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195953694] [2019-12-18 17:29:51,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:51,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:51,274 INFO L87 Difference]: Start difference. First operand 595 states and 1322 transitions. Second operand 3 states. [2019-12-18 17:29:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:51,287 INFO L93 Difference]: Finished difference Result 572 states and 1242 transitions. [2019-12-18 17:29:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:51,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:29:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:51,288 INFO L225 Difference]: With dead ends: 572 [2019-12-18 17:29:51,288 INFO L226 Difference]: Without dead ends: 572 [2019-12-18 17:29:51,289 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 17:29:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-18 17:29:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-12-18 17:29:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-18 17:29:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1242 transitions. [2019-12-18 17:29:51,296 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1242 transitions. Word has length 59 [2019-12-18 17:29:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:51,297 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1242 transitions. [2019-12-18 17:29:51,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1242 transitions. [2019-12-18 17:29:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:29:51,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:51,298 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, 1, 1, 1] [2019-12-18 17:29:51,298 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-18 17:29:51,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:51,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599606655] [2019-12-18 17:29:51,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:51,632 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 17:29:51,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599606655] [2019-12-18 17:29:51,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:51,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:29:51,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777562281] [2019-12-18 17:29:51,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:29:51,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:51,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:29:51,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:29:51,634 INFO L87 Difference]: Start difference. First operand 572 states and 1242 transitions. Second operand 13 states. [2019-12-18 17:29:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:52,017 INFO L93 Difference]: Finished difference Result 908 states and 1982 transitions. [2019-12-18 17:29:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:29:52,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 17:29:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:52,019 INFO L225 Difference]: With dead ends: 908 [2019-12-18 17:29:52,019 INFO L226 Difference]: Without dead ends: 874 [2019-12-18 17:29:52,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:29:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-12-18 17:29:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 783. [2019-12-18 17:29:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-18 17:29:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1714 transitions. [2019-12-18 17:29:52,028 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1714 transitions. Word has length 60 [2019-12-18 17:29:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:52,029 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1714 transitions. [2019-12-18 17:29:52,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:29:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1714 transitions. [2019-12-18 17:29:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:29:52,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:52,030 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, 1, 1, 1] [2019-12-18 17:29:52,030 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 2 times [2019-12-18 17:29:52,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:52,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389965604] [2019-12-18 17:29:52,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:29:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:29:52,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:29:52,155 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:29:52,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21|) |v_ULTIMATE.start_main_~#t1149~0.offset_16| 0))) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1149~0.base_21|) (= v_~z$r_buff0_thd2~0_135 0) (= 0 v_~z$r_buff1_thd3~0_221) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21| 1)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21|)) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| 4) |v_#length_27|) (= 0 v_~z$r_buff1_thd4~0_193) (= 0 |v_ULTIMATE.start_main_~#t1149~0.offset_16|) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_22|, ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_~#t1149~0.offset=|v_ULTIMATE.start_main_~#t1149~0.offset_16|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1149~0.base=|v_ULTIMATE.start_main_~#t1149~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_16|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1151~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1152~0.base, ULTIMATE.start_main_~#t1150~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1150~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1149~0.offset, ULTIMATE.start_main_~#t1152~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1149~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1151~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:29:52,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1150~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1150~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1150~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12|) |v_ULTIMATE.start_main_~#t1150~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1150~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1150~0.base] because there is no mapped edge [2019-12-18 17:29:52,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1151~0.offset_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8|) |v_ULTIMATE.start_main_~#t1151~0.offset_8| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1151~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1151~0.base_8|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1151~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1151~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 17:29:52,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1152~0.base_12|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12|) |v_ULTIMATE.start_main_~#t1152~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1152~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1152~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1152~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1152~0.base] because there is no mapped edge [2019-12-18 17:29:52,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-594249455 0)) (= ~z$r_buff1_thd0~0_Out-594249455 ~z$r_buff0_thd0~0_In-594249455) (= ~__unbuffered_p3_EAX~0_Out-594249455 ~a~0_Out-594249455) (= ~z$r_buff1_thd3~0_Out-594249455 ~z$r_buff0_thd3~0_In-594249455) (= ~z$r_buff0_thd4~0_In-594249455 ~z$r_buff1_thd4~0_Out-594249455) (= ~__unbuffered_p3_EBX~0_Out-594249455 ~b~0_In-594249455) (= 1 ~a~0_Out-594249455) (= ~z$r_buff0_thd4~0_Out-594249455 1) (= ~z$r_buff0_thd1~0_In-594249455 ~z$r_buff1_thd1~0_Out-594249455) (= ~z$r_buff1_thd2~0_Out-594249455 ~z$r_buff0_thd2~0_In-594249455)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-594249455, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-594249455, ~b~0=~b~0_In-594249455, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-594249455, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-594249455, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-594249455, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-594249455} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-594249455, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-594249455, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-594249455, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-594249455, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-594249455, ~a~0=~a~0_Out-594249455, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-594249455, ~b~0=~b~0_In-594249455, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-594249455, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-594249455, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-594249455, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-594249455, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-594249455, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-594249455, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-594249455} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:29:52,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:29:52,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:29:52,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1326194317 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1326194317 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1326194317| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1326194317| ~z$w_buff0_used~0_In1326194317)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1326194317, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1326194317} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1326194317, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1326194317, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1326194317|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:29:52,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In465459254 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In465459254 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite3_Out465459254| ~z~0_In465459254) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out465459254| ~z$w_buff1~0_In465459254) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In465459254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In465459254, ~z$w_buff1~0=~z$w_buff1~0_In465459254, ~z~0=~z~0_In465459254} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out465459254|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In465459254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In465459254, ~z$w_buff1~0=~z$w_buff1~0_In465459254, ~z~0=~z~0_In465459254} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:29:52,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:29:52,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1538608843 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1538608843 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out-1538608843| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-1538608843| ~z$w_buff0_used~0_In-1538608843) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1538608843, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1538608843} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1538608843|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1538608843, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1538608843} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:29:52,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-475286140 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-475286140 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-475286140 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-475286140 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-475286140|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-475286140 |P2Thread1of1ForFork2_#t~ite6_Out-475286140|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-475286140, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-475286140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475286140, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-475286140} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-475286140|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-475286140, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-475286140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475286140, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-475286140} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:29:52,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1907808766 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1907808766 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1907808766| ~z$r_buff0_thd3~0_In-1907808766)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1907808766|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1907808766, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1907808766} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1907808766, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1907808766, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1907808766|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:29:52,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1615686524 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1615686524 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1615686524 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1615686524 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out1615686524| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite8_Out1615686524| ~z$r_buff1_thd3~0_In1615686524)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1615686524, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1615686524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1615686524, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1615686524} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1615686524, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1615686524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1615686524, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1615686524, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1615686524|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:29:52,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:29:52,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1184142037 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1184142037 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1184142037 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1184142037 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1184142037|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1184142037 |P3Thread1of1ForFork3_#t~ite12_Out1184142037|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1184142037, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1184142037, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1184142037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1184142037} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1184142037, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1184142037, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1184142037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1184142037, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1184142037|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:29:52,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1621731137 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1621731137 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1621731137 ~z$r_buff0_thd4~0_Out-1621731137)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-1621731137)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1621731137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1621731137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1621731137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1621731137, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1621731137|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:29:52,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In349219517 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In349219517 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In349219517 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In349219517 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out349219517| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P3Thread1of1ForFork3_#t~ite14_Out349219517| ~z$r_buff1_thd4~0_In349219517)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In349219517, ~z$w_buff0_used~0=~z$w_buff0_used~0_In349219517, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In349219517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In349219517} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In349219517, ~z$w_buff0_used~0=~z$w_buff0_used~0_In349219517, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out349219517|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In349219517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In349219517} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:29:52,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:29:52,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:29:52,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1008141343 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1008141343 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite20_Out-1008141343| |ULTIMATE.start_main_#t~ite19_Out-1008141343|))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In-1008141343 |ULTIMATE.start_main_#t~ite19_Out-1008141343|) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In-1008141343 |ULTIMATE.start_main_#t~ite19_Out-1008141343|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1008141343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1008141343, ~z$w_buff1~0=~z$w_buff1~0_In-1008141343, ~z~0=~z~0_In-1008141343} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1008141343|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1008141343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1008141343, ~z$w_buff1~0=~z$w_buff1~0_In-1008141343, ~z~0=~z~0_In-1008141343, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1008141343|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:29:52,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In530689489 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In530689489 256) 0))) (or (and (= ~z$w_buff0_used~0_In530689489 |ULTIMATE.start_main_#t~ite21_Out530689489|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out530689489|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In530689489, ~z$w_buff0_used~0=~z$w_buff0_used~0_In530689489} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In530689489, ~z$w_buff0_used~0=~z$w_buff0_used~0_In530689489, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out530689489|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:29:52,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2118677466 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2118677466 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2118677466 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2118677466 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out2118677466|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In2118677466 |ULTIMATE.start_main_#t~ite22_Out2118677466|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2118677466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2118677466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2118677466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2118677466} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2118677466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2118677466, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2118677466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2118677466, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2118677466|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:29:52,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In503098747 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In503098747 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out503098747| ~z$r_buff0_thd0~0_In503098747)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out503098747| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In503098747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In503098747} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In503098747, ~z$w_buff0_used~0=~z$w_buff0_used~0_In503098747, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out503098747|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:29:52,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1058888266 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1058888266 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1058888266 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1058888266 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-1058888266 |ULTIMATE.start_main_#t~ite24_Out-1058888266|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-1058888266|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1058888266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1058888266, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1058888266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1058888266} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1058888266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1058888266, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1058888266, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1058888266|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1058888266} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:29:52,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-189455374 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-189455374| ~z$w_buff0_used~0_In-189455374) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-189455374 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-189455374 256) 0)) (= (mod ~z$w_buff0_used~0_In-189455374 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-189455374 256))))) (= |ULTIMATE.start_main_#t~ite36_Out-189455374| |ULTIMATE.start_main_#t~ite37_Out-189455374|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_In-189455374| |ULTIMATE.start_main_#t~ite36_Out-189455374|) (= |ULTIMATE.start_main_#t~ite37_Out-189455374| ~z$w_buff0_used~0_In-189455374)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-189455374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-189455374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-189455374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-189455374, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In-189455374|, ~weak$$choice2~0=~weak$$choice2~0_In-189455374} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-189455374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-189455374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-189455374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-189455374, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-189455374|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-189455374|, ~weak$$choice2~0=~weak$$choice2~0_In-189455374} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:29:52,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-88773974 256)))) (or (and (= ~z$w_buff1_used~0_In-88773974 |ULTIMATE.start_main_#t~ite39_Out-88773974|) (= |ULTIMATE.start_main_#t~ite39_Out-88773974| |ULTIMATE.start_main_#t~ite40_Out-88773974|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-88773974 256)))) (or (and (= (mod ~z$r_buff1_thd0~0_In-88773974 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-88773974 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-88773974 256)) .cse1)))) (and (= ~z$w_buff1_used~0_In-88773974 |ULTIMATE.start_main_#t~ite40_Out-88773974|) (= |ULTIMATE.start_main_#t~ite39_In-88773974| |ULTIMATE.start_main_#t~ite39_Out-88773974|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-88773974, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-88773974, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-88773974|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-88773974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-88773974, ~weak$$choice2~0=~weak$$choice2~0_In-88773974} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-88773974, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-88773974|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-88773974|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-88773974, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-88773974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-88773974, ~weak$$choice2~0=~weak$$choice2~0_In-88773974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:29:52,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:29:52,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:29:52,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:29:52,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:29:52 BasicIcfg [2019-12-18 17:29:52,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:29:52,283 INFO L168 Benchmark]: Toolchain (without parser) took 61629.72 ms. Allocated memory was 138.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 102.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 17:29:52,283 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:29:52,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.00 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 156.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:52,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.85 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:52,285 INFO L168 Benchmark]: Boogie Preprocessor took 42.88 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:52,286 INFO L168 Benchmark]: RCFGBuilder took 843.51 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 101.2 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:29:52,286 INFO L168 Benchmark]: TraceAbstraction took 59920.06 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 17:29:52,290 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.00 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 156.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.85 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.88 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.51 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 101.2 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59920.06 ms. Allocated memory was 202.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 59.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2889 SDtfs, 3814 SDslu, 8610 SDs, 0 SdLazy, 4072 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65578occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 101745 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 661 ConstructedInterpolants, 0 QuantifiedInterpolants, 154107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...