./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7fedffaf166c04fa23911a87ebd562034522f75b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 03:40:11,447 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:40:11,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:40:11,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:40:11,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:40:11,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:40:11,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:40:11,466 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:40:11,468 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:40:11,469 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:40:11,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:40:11,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:40:11,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:40:11,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:40:11,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:40:11,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:40:11,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:40:11,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:40:11,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:40:11,482 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:40:11,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:40:11,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:40:11,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:40:11,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:40:11,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:40:11,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:40:11,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:40:11,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:40:11,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:40:11,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:40:11,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:40:11,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:40:11,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:40:11,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:40:11,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:40:11,498 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:40:11,498 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 03:40:11,523 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:40:11,523 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:40:11,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:40:11,526 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:40:11,526 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:40:11,527 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:40:11,527 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:40:11,527 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:40:11,527 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:40:11,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:40:11,528 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:40:11,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:40:11,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:40:11,528 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:40:11,528 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:40:11,528 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:40:11,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:40:11,531 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:40:11,531 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:40:11,531 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:40:11,531 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:40:11,532 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:40:11,532 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:40:11,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:40:11,532 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:40:11,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:40:11,532 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:40:11,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:40:11,533 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fedffaf166c04fa23911a87ebd562034522f75b [2019-01-13 03:40:11,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:40:11,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:40:11,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:40:11,617 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:40:11,618 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:40:11,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i [2019-01-13 03:40:11,677 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43cd19578/58fa9bcd31ea4b8d8fb4c1bd305d5274/FLAG4eacabd4d [2019-01-13 03:40:12,185 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:40:12,186 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi000_pso.opt_false-unreach-call.i [2019-01-13 03:40:12,199 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43cd19578/58fa9bcd31ea4b8d8fb4c1bd305d5274/FLAG4eacabd4d [2019-01-13 03:40:12,475 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43cd19578/58fa9bcd31ea4b8d8fb4c1bd305d5274 [2019-01-13 03:40:12,479 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:40:12,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:40:12,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:40:12,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:40:12,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:40:12,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:40:12" (1/1) ... [2019-01-13 03:40:12,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a0c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:12, skipping insertion in model container [2019-01-13 03:40:12,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:40:12" (1/1) ... [2019-01-13 03:40:12,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:40:12,547 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:40:13,017 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:40:13,039 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:40:13,204 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:40:13,293 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:40:13,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13 WrapperNode [2019-01-13 03:40:13,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:40:13,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:40:13,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:40:13,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:40:13,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:40:13,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:40:13,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:40:13,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:40:13,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (1/1) ... [2019-01-13 03:40:13,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:40:13,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:40:13,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:40:13,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:40:13,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (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-01-13 03:40:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:40:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:40:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:40:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:40:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:40:13,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:40:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:40:13,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:40:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:40:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:40:13,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:40:13,496 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 03:40:14,703 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:40:14,704 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:40:14,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:14 BoogieIcfgContainer [2019-01-13 03:40:14,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:40:14,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:40:14,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:40:14,713 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:40:14,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:40:12" (1/3) ... [2019-01-13 03:40:14,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5136d743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:40:14, skipping insertion in model container [2019-01-13 03:40:14,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:40:13" (2/3) ... [2019-01-13 03:40:14,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5136d743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:40:14, skipping insertion in model container [2019-01-13 03:40:14,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:14" (3/3) ... [2019-01-13 03:40:14,717 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt_false-unreach-call.i [2019-01-13 03:40:14,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,757 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,757 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,761 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,763 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,764 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,765 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,766 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,767 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,768 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,769 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,770 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,772 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,772 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,773 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:40:14,797 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:40:14,797 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:40:14,806 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:40:14,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:40:14,849 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:40:14,850 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:40:14,850 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:40:14,851 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:40:14,851 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:40:14,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:40:14,851 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:40:14,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:40:14,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:40:14,863 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-13 03:40:16,246 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25088 states. [2019-01-13 03:40:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states. [2019-01-13 03:40:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 03:40:16,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:16,259 INFO L402 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] [2019-01-13 03:40:16,261 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:16,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1172530028, now seen corresponding path program 1 times [2019-01-13 03:40:16,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:16,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:16,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:16,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:16,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:16,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:16,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:16,589 INFO L87 Difference]: Start difference. First operand 25088 states. Second operand 4 states. [2019-01-13 03:40:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:17,649 INFO L93 Difference]: Finished difference Result 45388 states and 177626 transitions. [2019-01-13 03:40:17,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:17,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 03:40:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:17,979 INFO L225 Difference]: With dead ends: 45388 [2019-01-13 03:40:17,980 INFO L226 Difference]: Without dead ends: 40628 [2019-01-13 03:40:17,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2019-01-13 03:40:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 23662. [2019-01-13 03:40:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2019-01-13 03:40:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 92543 transitions. [2019-01-13 03:40:19,597 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 92543 transitions. Word has length 37 [2019-01-13 03:40:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:19,600 INFO L480 AbstractCegarLoop]: Abstraction has 23662 states and 92543 transitions. [2019-01-13 03:40:19,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 92543 transitions. [2019-01-13 03:40:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 03:40:19,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:19,613 INFO L402 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] [2019-01-13 03:40:19,613 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1746574175, now seen corresponding path program 1 times [2019-01-13 03:40:19,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:19,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:19,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:19,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:19,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:19,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:19,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:19,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:19,840 INFO L87 Difference]: Start difference. First operand 23662 states and 92543 transitions. Second operand 5 states. [2019-01-13 03:40:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:23,315 INFO L93 Difference]: Finished difference Result 64830 states and 241369 transitions. [2019-01-13 03:40:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:23,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-01-13 03:40:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:23,722 INFO L225 Difference]: With dead ends: 64830 [2019-01-13 03:40:23,722 INFO L226 Difference]: Without dead ends: 64670 [2019-01-13 03:40:23,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64670 states. [2019-01-13 03:40:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64670 to 37142. [2019-01-13 03:40:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37142 states. [2019-01-13 03:40:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 138284 transitions. [2019-01-13 03:40:25,401 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 138284 transitions. Word has length 44 [2019-01-13 03:40:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:25,402 INFO L480 AbstractCegarLoop]: Abstraction has 37142 states and 138284 transitions. [2019-01-13 03:40:25,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 138284 transitions. [2019-01-13 03:40:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 03:40:25,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:25,407 INFO L402 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] [2019-01-13 03:40:25,408 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1206649085, now seen corresponding path program 1 times [2019-01-13 03:40:25,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:25,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:25,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:25,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-01-13 03:40:25,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:25,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:25,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:25,551 INFO L87 Difference]: Start difference. First operand 37142 states and 138284 transitions. Second operand 4 states. [2019-01-13 03:40:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:25,627 INFO L93 Difference]: Finished difference Result 12364 states and 41177 transitions. [2019-01-13 03:40:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:25,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 03:40:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:25,652 INFO L225 Difference]: With dead ends: 12364 [2019-01-13 03:40:25,653 INFO L226 Difference]: Without dead ends: 11843 [2019-01-13 03:40:25,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-13 03:40:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2019-01-13 03:40:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11843. [2019-01-13 03:40:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2019-01-13 03:40:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 39622 transitions. [2019-01-13 03:40:25,932 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 39622 transitions. Word has length 45 [2019-01-13 03:40:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:25,932 INFO L480 AbstractCegarLoop]: Abstraction has 11843 states and 39622 transitions. [2019-01-13 03:40:25,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 39622 transitions. [2019-01-13 03:40:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 03:40:25,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:25,943 INFO L402 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] [2019-01-13 03:40:25,943 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -372868821, now seen corresponding path program 1 times [2019-01-13 03:40:25,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:25,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:26,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:26,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:26,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:26,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:26,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:26,235 INFO L87 Difference]: Start difference. First operand 11843 states and 39622 transitions. Second operand 4 states. [2019-01-13 03:40:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:26,596 INFO L93 Difference]: Finished difference Result 17019 states and 55693 transitions. [2019-01-13 03:40:26,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:26,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-13 03:40:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:26,623 INFO L225 Difference]: With dead ends: 17019 [2019-01-13 03:40:26,624 INFO L226 Difference]: Without dead ends: 17019 [2019-01-13 03:40:26,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-01-13 03:40:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 12879. [2019-01-13 03:40:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12879 states. [2019-01-13 03:40:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 42720 transitions. [2019-01-13 03:40:26,912 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 42720 transitions. Word has length 58 [2019-01-13 03:40:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:26,912 INFO L480 AbstractCegarLoop]: Abstraction has 12879 states and 42720 transitions. [2019-01-13 03:40:26,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 42720 transitions. [2019-01-13 03:40:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 03:40:26,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:26,920 INFO L402 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] [2019-01-13 03:40:26,920 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1400961321, now seen corresponding path program 1 times [2019-01-13 03:40:26,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:26,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:26,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:27,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:27,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:27,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:27,114 INFO L87 Difference]: Start difference. First operand 12879 states and 42720 transitions. Second operand 6 states. [2019-01-13 03:40:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:28,444 INFO L93 Difference]: Finished difference Result 18599 states and 60830 transitions. [2019-01-13 03:40:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:40:28,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-01-13 03:40:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:28,484 INFO L225 Difference]: With dead ends: 18599 [2019-01-13 03:40:28,484 INFO L226 Difference]: Without dead ends: 18567 [2019-01-13 03:40:28,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-13 03:40:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2019-01-13 03:40:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 14411. [2019-01-13 03:40:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2019-01-13 03:40:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 47549 transitions. [2019-01-13 03:40:28,719 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 47549 transitions. Word has length 58 [2019-01-13 03:40:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:28,719 INFO L480 AbstractCegarLoop]: Abstraction has 14411 states and 47549 transitions. [2019-01-13 03:40:28,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 47549 transitions. [2019-01-13 03:40:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:40:28,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:28,746 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:40:28,746 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:28,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:28,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1996508936, now seen corresponding path program 1 times [2019-01-13 03:40:28,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:28,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:28,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:28,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:28,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:28,927 INFO L87 Difference]: Start difference. First operand 14411 states and 47549 transitions. Second operand 4 states. [2019-01-13 03:40:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:29,704 INFO L93 Difference]: Finished difference Result 20322 states and 66029 transitions. [2019-01-13 03:40:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:29,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-01-13 03:40:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:29,734 INFO L225 Difference]: With dead ends: 20322 [2019-01-13 03:40:29,734 INFO L226 Difference]: Without dead ends: 20322 [2019-01-13 03:40:29,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20322 states. [2019-01-13 03:40:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20322 to 18247. [2019-01-13 03:40:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-01-13 03:40:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 59758 transitions. [2019-01-13 03:40:30,104 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 59758 transitions. Word has length 72 [2019-01-13 03:40:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:30,104 INFO L480 AbstractCegarLoop]: Abstraction has 18247 states and 59758 transitions. [2019-01-13 03:40:30,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 59758 transitions. [2019-01-13 03:40:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:40:30,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:30,128 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:40:30,129 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1947658423, now seen corresponding path program 1 times [2019-01-13 03:40:30,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:30,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:30,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:30,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:30,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:30,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:30,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:30,269 INFO L87 Difference]: Start difference. First operand 18247 states and 59758 transitions. Second operand 5 states. [2019-01-13 03:40:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:30,331 INFO L93 Difference]: Finished difference Result 3155 states and 8363 transitions. [2019-01-13 03:40:30,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:40:30,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-01-13 03:40:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:30,335 INFO L225 Difference]: With dead ends: 3155 [2019-01-13 03:40:30,336 INFO L226 Difference]: Without dead ends: 2655 [2019-01-13 03:40:30,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-01-13 03:40:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2548. [2019-01-13 03:40:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2019-01-13 03:40:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 6738 transitions. [2019-01-13 03:40:30,368 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 6738 transitions. Word has length 72 [2019-01-13 03:40:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:30,368 INFO L480 AbstractCegarLoop]: Abstraction has 2548 states and 6738 transitions. [2019-01-13 03:40:30,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 6738 transitions. [2019-01-13 03:40:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:30,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:30,375 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:30,375 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1359573718, now seen corresponding path program 1 times [2019-01-13 03:40:30,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:30,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:30,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:30,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:30,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:30,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:30,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:30,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:30,690 INFO L87 Difference]: Start difference. First operand 2548 states and 6738 transitions. Second operand 5 states. [2019-01-13 03:40:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:30,868 INFO L93 Difference]: Finished difference Result 2925 states and 7599 transitions. [2019-01-13 03:40:30,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:40:30,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 03:40:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:30,873 INFO L225 Difference]: With dead ends: 2925 [2019-01-13 03:40:30,873 INFO L226 Difference]: Without dead ends: 2925 [2019-01-13 03:40:30,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-01-13 03:40:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2630. [2019-01-13 03:40:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-01-13 03:40:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 6945 transitions. [2019-01-13 03:40:30,897 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 6945 transitions. Word has length 91 [2019-01-13 03:40:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:30,897 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 6945 transitions. [2019-01-13 03:40:30,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 6945 transitions. [2019-01-13 03:40:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:30,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:30,902 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:30,903 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1671596477, now seen corresponding path program 1 times [2019-01-13 03:40:30,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:30,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:30,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:30,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:30,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:31,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:31,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:31,158 INFO L87 Difference]: Start difference. First operand 2630 states and 6945 transitions. Second operand 4 states. [2019-01-13 03:40:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:31,454 INFO L93 Difference]: Finished difference Result 3181 states and 8228 transitions. [2019-01-13 03:40:31,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:31,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 03:40:31,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:31,459 INFO L225 Difference]: With dead ends: 3181 [2019-01-13 03:40:31,459 INFO L226 Difference]: Without dead ends: 3153 [2019-01-13 03:40:31,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-01-13 03:40:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 3096. [2019-01-13 03:40:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-01-13 03:40:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 8053 transitions. [2019-01-13 03:40:31,493 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 8053 transitions. Word has length 91 [2019-01-13 03:40:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:31,493 INFO L480 AbstractCegarLoop]: Abstraction has 3096 states and 8053 transitions. [2019-01-13 03:40:31,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 8053 transitions. [2019-01-13 03:40:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:31,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:31,500 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:31,500 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:31,501 INFO L82 PathProgramCache]: Analyzing trace with hash -702015454, now seen corresponding path program 1 times [2019-01-13 03:40:31,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:31,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:31,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:31,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:40:31,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:40:31,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:40:31,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:31,709 INFO L87 Difference]: Start difference. First operand 3096 states and 8053 transitions. Second operand 4 states. [2019-01-13 03:40:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:32,524 INFO L93 Difference]: Finished difference Result 4008 states and 10487 transitions. [2019-01-13 03:40:32,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:32,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-13 03:40:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:32,528 INFO L225 Difference]: With dead ends: 4008 [2019-01-13 03:40:32,528 INFO L226 Difference]: Without dead ends: 4008 [2019-01-13 03:40:32,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:40:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2019-01-13 03:40:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 2965. [2019-01-13 03:40:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2019-01-13 03:40:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 7662 transitions. [2019-01-13 03:40:32,560 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 7662 transitions. Word has length 91 [2019-01-13 03:40:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:32,560 INFO L480 AbstractCegarLoop]: Abstraction has 2965 states and 7662 transitions. [2019-01-13 03:40:32,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:40:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 7662 transitions. [2019-01-13 03:40:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 03:40:32,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:32,564 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:32,565 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1437858380, now seen corresponding path program 2 times [2019-01-13 03:40:32,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:32,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:32,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:32,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:32,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:32,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:32,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:32,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:32,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:32,706 INFO L87 Difference]: Start difference. First operand 2965 states and 7662 transitions. Second operand 5 states. [2019-01-13 03:40:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:33,080 INFO L93 Difference]: Finished difference Result 3357 states and 8582 transitions. [2019-01-13 03:40:33,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:33,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-01-13 03:40:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:33,086 INFO L225 Difference]: With dead ends: 3357 [2019-01-13 03:40:33,086 INFO L226 Difference]: Without dead ends: 3329 [2019-01-13 03:40:33,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2019-01-13 03:40:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 2891. [2019-01-13 03:40:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2891 states. [2019-01-13 03:40:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 7472 transitions. [2019-01-13 03:40:33,114 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 7472 transitions. Word has length 91 [2019-01-13 03:40:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:33,114 INFO L480 AbstractCegarLoop]: Abstraction has 2891 states and 7472 transitions. [2019-01-13 03:40:33,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 7472 transitions. [2019-01-13 03:40:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:33,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:33,118 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:33,119 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1748261029, now seen corresponding path program 1 times [2019-01-13 03:40:33,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:33,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:40:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:33,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:33,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:33,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:33,705 INFO L87 Difference]: Start difference. First operand 2891 states and 7472 transitions. Second operand 7 states. [2019-01-13 03:40:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:34,399 INFO L93 Difference]: Finished difference Result 3286 states and 8389 transitions. [2019-01-13 03:40:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:40:34,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 03:40:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:34,404 INFO L225 Difference]: With dead ends: 3286 [2019-01-13 03:40:34,404 INFO L226 Difference]: Without dead ends: 3286 [2019-01-13 03:40:34,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2019-01-13 03:40:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 3003. [2019-01-13 03:40:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-01-13 03:40:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 7699 transitions. [2019-01-13 03:40:34,431 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 7699 transitions. Word has length 93 [2019-01-13 03:40:34,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:34,431 INFO L480 AbstractCegarLoop]: Abstraction has 3003 states and 7699 transitions. [2019-01-13 03:40:34,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 7699 transitions. [2019-01-13 03:40:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:34,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:34,436 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:34,436 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash 564913732, now seen corresponding path program 1 times [2019-01-13 03:40:34,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:34,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:34,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:34,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:34,903 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 03:40:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:35,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:35,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:35,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:35,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:35,053 INFO L87 Difference]: Start difference. First operand 3003 states and 7699 transitions. Second operand 5 states. [2019-01-13 03:40:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:35,213 INFO L93 Difference]: Finished difference Result 2531 states and 6471 transitions. [2019-01-13 03:40:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:35,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 03:40:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:35,218 INFO L225 Difference]: With dead ends: 2531 [2019-01-13 03:40:35,218 INFO L226 Difference]: Without dead ends: 2531 [2019-01-13 03:40:35,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-01-13 03:40:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2434. [2019-01-13 03:40:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-01-13 03:40:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 6271 transitions. [2019-01-13 03:40:35,242 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 6271 transitions. Word has length 93 [2019-01-13 03:40:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:35,242 INFO L480 AbstractCegarLoop]: Abstraction has 2434 states and 6271 transitions. [2019-01-13 03:40:35,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 6271 transitions. [2019-01-13 03:40:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:35,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:35,246 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:35,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:35,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1370746555, now seen corresponding path program 1 times [2019-01-13 03:40:35,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:35,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:35,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:35,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:35,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:35,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:35,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:35,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:35,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:35,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:35,570 INFO L87 Difference]: Start difference. First operand 2434 states and 6271 transitions. Second operand 6 states. [2019-01-13 03:40:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:35,795 INFO L93 Difference]: Finished difference Result 2466 states and 6223 transitions. [2019-01-13 03:40:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:40:35,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 03:40:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:35,800 INFO L225 Difference]: With dead ends: 2466 [2019-01-13 03:40:35,800 INFO L226 Difference]: Without dead ends: 2466 [2019-01-13 03:40:35,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2019-01-13 03:40:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2133. [2019-01-13 03:40:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-01-13 03:40:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 5437 transitions. [2019-01-13 03:40:35,822 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 5437 transitions. Word has length 93 [2019-01-13 03:40:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:35,823 INFO L480 AbstractCegarLoop]: Abstraction has 2133 states and 5437 transitions. [2019-01-13 03:40:35,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 5437 transitions. [2019-01-13 03:40:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:35,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:35,826 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:35,827 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1440363890, now seen corresponding path program 1 times [2019-01-13 03:40:35,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:35,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:35,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:35,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:35,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:36,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:36,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:36,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:36,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:36,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:36,208 INFO L87 Difference]: Start difference. First operand 2133 states and 5437 transitions. Second operand 7 states. [2019-01-13 03:40:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:36,862 INFO L93 Difference]: Finished difference Result 4089 states and 10169 transitions. [2019-01-13 03:40:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:40:36,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:40:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:36,868 INFO L225 Difference]: With dead ends: 4089 [2019-01-13 03:40:36,869 INFO L226 Difference]: Without dead ends: 4057 [2019-01-13 03:40:36,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:40:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2019-01-13 03:40:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 3169. [2019-01-13 03:40:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3169 states. [2019-01-13 03:40:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 3169 states and 8031 transitions. [2019-01-13 03:40:36,905 INFO L78 Accepts]: Start accepts. Automaton has 3169 states and 8031 transitions. Word has length 95 [2019-01-13 03:40:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:36,905 INFO L480 AbstractCegarLoop]: Abstraction has 3169 states and 8031 transitions. [2019-01-13 03:40:36,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3169 states and 8031 transitions. [2019-01-13 03:40:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:36,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:36,910 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:36,911 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:36,911 INFO L82 PathProgramCache]: Analyzing trace with hash -195599409, now seen corresponding path program 1 times [2019-01-13 03:40:36,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:36,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:36,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:36,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:37,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:37,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:37,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:37,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:37,200 INFO L87 Difference]: Start difference. First operand 3169 states and 8031 transitions. Second operand 6 states. [2019-01-13 03:40:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:37,733 INFO L93 Difference]: Finished difference Result 3274 states and 8259 transitions. [2019-01-13 03:40:37,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 03:40:37,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 03:40:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:37,739 INFO L225 Difference]: With dead ends: 3274 [2019-01-13 03:40:37,739 INFO L226 Difference]: Without dead ends: 3274 [2019-01-13 03:40:37,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:40:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2019-01-13 03:40:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3207. [2019-01-13 03:40:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3207 states. [2019-01-13 03:40:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 8114 transitions. [2019-01-13 03:40:37,772 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 8114 transitions. Word has length 95 [2019-01-13 03:40:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:37,772 INFO L480 AbstractCegarLoop]: Abstraction has 3207 states and 8114 transitions. [2019-01-13 03:40:37,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 8114 transitions. [2019-01-13 03:40:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:37,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:37,780 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:37,780 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash 192440109, now seen corresponding path program 1 times [2019-01-13 03:40:37,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:37,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:37,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:37,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:38,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:38,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:38,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:38,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:38,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:38,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:38,029 INFO L87 Difference]: Start difference. First operand 3207 states and 8114 transitions. Second operand 6 states. [2019-01-13 03:40:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:38,183 INFO L93 Difference]: Finished difference Result 3021 states and 7578 transitions. [2019-01-13 03:40:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:40:38,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 03:40:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:38,187 INFO L225 Difference]: With dead ends: 3021 [2019-01-13 03:40:38,188 INFO L226 Difference]: Without dead ends: 3021 [2019-01-13 03:40:38,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:40:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-01-13 03:40:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2955. [2019-01-13 03:40:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2955 states. [2019-01-13 03:40:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 7454 transitions. [2019-01-13 03:40:38,216 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 7454 transitions. Word has length 95 [2019-01-13 03:40:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:38,217 INFO L480 AbstractCegarLoop]: Abstraction has 2955 states and 7454 transitions. [2019-01-13 03:40:38,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 7454 transitions. [2019-01-13 03:40:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:38,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:38,222 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:38,222 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash 316513356, now seen corresponding path program 1 times [2019-01-13 03:40:38,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:38,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:38,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:38,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:38,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:38,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:38,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:40:38,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:40:38,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:40:38,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:38,600 INFO L87 Difference]: Start difference. First operand 2955 states and 7454 transitions. Second operand 8 states. [2019-01-13 03:40:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:39,293 INFO L93 Difference]: Finished difference Result 4573 states and 11640 transitions. [2019-01-13 03:40:39,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:40:39,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 03:40:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:39,299 INFO L225 Difference]: With dead ends: 4573 [2019-01-13 03:40:39,299 INFO L226 Difference]: Without dead ends: 4541 [2019-01-13 03:40:39,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:40:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2019-01-13 03:40:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 4359. [2019-01-13 03:40:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-01-13 03:40:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 11117 transitions. [2019-01-13 03:40:39,342 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 11117 transitions. Word has length 95 [2019-01-13 03:40:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:39,343 INFO L480 AbstractCegarLoop]: Abstraction has 4359 states and 11117 transitions. [2019-01-13 03:40:39,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:40:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 11117 transitions. [2019-01-13 03:40:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:39,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:39,349 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:39,349 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1561277837, now seen corresponding path program 1 times [2019-01-13 03:40:39,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:39,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:39,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:39,605 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 03:40:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:39,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:39,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:39,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:39,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:39,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:39,741 INFO L87 Difference]: Start difference. First operand 4359 states and 11117 transitions. Second operand 7 states. [2019-01-13 03:40:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:40,058 INFO L93 Difference]: Finished difference Result 6998 states and 18134 transitions. [2019-01-13 03:40:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:40,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:40:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:40,064 INFO L225 Difference]: With dead ends: 6998 [2019-01-13 03:40:40,064 INFO L226 Difference]: Without dead ends: 2720 [2019-01-13 03:40:40,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:40:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-01-13 03:40:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2720. [2019-01-13 03:40:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-01-13 03:40:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 7157 transitions. [2019-01-13 03:40:40,091 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 7157 transitions. Word has length 95 [2019-01-13 03:40:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:40,091 INFO L480 AbstractCegarLoop]: Abstraction has 2720 states and 7157 transitions. [2019-01-13 03:40:40,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 7157 transitions. [2019-01-13 03:40:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:40,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:40,096 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:40,096 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash -827369038, now seen corresponding path program 1 times [2019-01-13 03:40:40,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:40,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:40,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:40,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:40:40,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:40,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:40,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:40,335 INFO L87 Difference]: Start difference. First operand 2720 states and 7157 transitions. Second operand 7 states. [2019-01-13 03:40:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:40,650 INFO L93 Difference]: Finished difference Result 2798 states and 7294 transitions. [2019-01-13 03:40:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:40:40,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:40:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:40,655 INFO L225 Difference]: With dead ends: 2798 [2019-01-13 03:40:40,655 INFO L226 Difference]: Without dead ends: 2769 [2019-01-13 03:40:40,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:40:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-01-13 03:40:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2745. [2019-01-13 03:40:40,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2745 states. [2019-01-13 03:40:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 7205 transitions. [2019-01-13 03:40:40,682 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 7205 transitions. Word has length 95 [2019-01-13 03:40:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:40,683 INFO L480 AbstractCegarLoop]: Abstraction has 2745 states and 7205 transitions. [2019-01-13 03:40:40,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 7205 transitions. [2019-01-13 03:40:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:40,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:40,687 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-13 03:40:40,688 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2010716335, now seen corresponding path program 2 times [2019-01-13 03:40:40,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:40,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:40,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:40:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:40:40,776 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:40:40,951 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:40:40,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:40:40 BasicIcfg [2019-01-13 03:40:40,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:40:40,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:40:40,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:40:40,954 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:40:40,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:40:14" (3/4) ... [2019-01-13 03:40:40,959 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:40:41,202 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:40:41,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:40:41,209 INFO L168 Benchmark]: Toolchain (without parser) took 28728.62 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 947.3 MB in the beginning and 849.7 MB in the end (delta: 97.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-13 03:40:41,214 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:40:41,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:41,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:41,215 INFO L168 Benchmark]: Boogie Preprocessor took 46.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:40:41,215 INFO L168 Benchmark]: RCFGBuilder took 1294.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:41,219 INFO L168 Benchmark]: TraceAbstraction took 26245.17 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 877.7 MB in the end (delta: 164.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-13 03:40:41,219 INFO L168 Benchmark]: Witness Printer took 254.02 ms. Allocated memory is still 2.4 GB. Free memory was 877.7 MB in the beginning and 849.7 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:41,223 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 812.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1294.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26245.17 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 877.7 MB in the end (delta: 164.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 254.02 ms. Allocated memory is still 2.4 GB. Free memory was 877.7 MB in the beginning and 849.7 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] -1 pthread_t t1593; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] FCALL, FORK -1 pthread_create(&t1593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] -1 pthread_t t1594; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L766] FCALL, FORK -1 pthread_create(&t1594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 y = 1 [L735] 0 __unbuffered_p1_EAX = y [L738] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L701] 1 y = 2 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L742] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L709] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L711] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L748] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L773] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L779] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L780] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L781] -1 x$flush_delayed = weak$$choice2 [L782] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L784] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L785] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L786] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L788] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L789] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] -1 x = x$flush_delayed ? x$mem_tmp : x [L792] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 180 locations, 3 error locations. UNSAFE Result, 26.1s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 13.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4489 SDtfs, 3960 SDslu, 9353 SDs, 0 SdLazy, 4013 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 54 SyntacticMatches, 12 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37142occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 58745 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1694 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1579 ConstructedInterpolants, 0 QuantifiedInterpolants, 331697 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...