./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi000_power.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_power.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 b3ae452df12de0c6a1fb927454711cf972ad1d78 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:39:21,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:39:21,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:39:21,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:39:21,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:39:21,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:39:21,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:39:21,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:39:21,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:39:21,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:39:21,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:39:21,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:39:21,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:39:21,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:39:21,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:39:21,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:39:21,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:39:21,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:39:21,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:39:21,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:39:21,547 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:39:21,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:39:21,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:39:21,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:39:21,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:39:21,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:39:21,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:39:21,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:39:21,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:39:21,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:39:21,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:39:21,556 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:39:21,556 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:39:21,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:39:21,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:39:21,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:39:21,558 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:39:21,584 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:39:21,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:39:21,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:39:21,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:39:21,587 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:39:21,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:39:21,588 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:39:21,588 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:39:21,588 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:39:21,588 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:39:21,588 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:39:21,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:39:21,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:39:21,591 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:39:21,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:39:21,591 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:39:21,591 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:39:21,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:39:21,593 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:39:21,593 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:39:21,593 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:39:21,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:39:21,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:39:21,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:39:21,594 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:39:21,594 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:39:21,594 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:39:21,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:39:21,597 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 -> b3ae452df12de0c6a1fb927454711cf972ad1d78 [2019-01-13 03:39:21,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:39:21,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:39:21,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:39:21,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:39:21,660 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:39:21,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi000_power.opt_false-unreach-call.i [2019-01-13 03:39:21,731 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53185157/9250952303c04c139b4dd9f14f14d8dc/FLAGe06089575 [2019-01-13 03:39:22,256 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:39:22,257 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi000_power.opt_false-unreach-call.i [2019-01-13 03:39:22,271 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53185157/9250952303c04c139b4dd9f14f14d8dc/FLAGe06089575 [2019-01-13 03:39:22,532 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53185157/9250952303c04c139b4dd9f14f14d8dc [2019-01-13 03:39:22,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:39:22,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:39:22,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:39:22,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:39:22,544 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:39:22,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:39:22" (1/1) ... [2019-01-13 03:39:22,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd00d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:22, skipping insertion in model container [2019-01-13 03:39:22,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:39:22" (1/1) ... [2019-01-13 03:39:22,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:39:22,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:39:23,143 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:39:23,171 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:39:23,312 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:39:23,407 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:39:23,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23 WrapperNode [2019-01-13 03:39:23,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:39:23,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:39:23,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:39:23,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:39:23,419 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:39:23" (1/1) ... [2019-01-13 03:39:23,443 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:39:23" (1/1) ... [2019-01-13 03:39:23,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:39:23,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:39:23,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:39:23,490 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:39:23,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... [2019-01-13 03:39:23,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... [2019-01-13 03:39:23,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... [2019-01-13 03:39:23,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... [2019-01-13 03:39:23,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... [2019-01-13 03:39:23,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... [2019-01-13 03:39:23,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... [2019-01-13 03:39:23,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:39:23,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:39:23,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:39:23,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:39:23,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:39:23,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:39:23,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:39:23,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:39:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:39:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:39:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:39:23,609 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:39:24,743 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:39:24,743 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:39:24,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:39:24 BoogieIcfgContainer [2019-01-13 03:39:24,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:39:24,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:39:24,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:39:24,751 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:39:24,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:39:22" (1/3) ... [2019-01-13 03:39:24,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2047345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:39:24, skipping insertion in model container [2019-01-13 03:39:24,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:39:23" (2/3) ... [2019-01-13 03:39:24,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2047345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:39:24, skipping insertion in model container [2019-01-13 03:39:24,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:39:24" (3/3) ... [2019-01-13 03:39:24,756 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_false-unreach-call.i [2019-01-13 03:39:24,799 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,799 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,799 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,799 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,800 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,801 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,802 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,805 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,806 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,807 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,808 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,808 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:39:24,808 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,808 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,808 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:39:24,840 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:39:24,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:39:24,850 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:39:24,868 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:39:24,893 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:39:24,894 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:39:24,894 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:39:24,894 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:39:24,894 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:39:24,895 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:39:24,895 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:39:24,895 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:39:24,895 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:39:24,908 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2019-01-13 03:39:26,620 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25088 states. [2019-01-13 03:39:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states. [2019-01-13 03:39:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 03:39:26,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:26,634 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:39:26,636 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1172530028, now seen corresponding path program 1 times [2019-01-13 03:39:26,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:26,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:26,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:26,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:27,075 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:39:27,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:27,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:39:27,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:39:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:39:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:39:27,104 INFO L87 Difference]: Start difference. First operand 25088 states. Second operand 4 states. [2019-01-13 03:39:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:28,102 INFO L93 Difference]: Finished difference Result 45388 states and 177626 transitions. [2019-01-13 03:39:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:39:28,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 03:39:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:28,514 INFO L225 Difference]: With dead ends: 45388 [2019-01-13 03:39:28,514 INFO L226 Difference]: Without dead ends: 40628 [2019-01-13 03:39:28,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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:39:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40628 states. [2019-01-13 03:39:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40628 to 23662. [2019-01-13 03:39:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2019-01-13 03:39:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 92543 transitions. [2019-01-13 03:39:30,252 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 92543 transitions. Word has length 37 [2019-01-13 03:39:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:30,253 INFO L480 AbstractCegarLoop]: Abstraction has 23662 states and 92543 transitions. [2019-01-13 03:39:30,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:39:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 92543 transitions. [2019-01-13 03:39:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 03:39:30,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:30,270 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:39:30,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1746574175, now seen corresponding path program 1 times [2019-01-13 03:39:30,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:30,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:30,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:30,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:30,566 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:39:30,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:30,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:39:30,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:39:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:39:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:39:30,570 INFO L87 Difference]: Start difference. First operand 23662 states and 92543 transitions. Second operand 5 states. [2019-01-13 03:39:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:33,139 INFO L93 Difference]: Finished difference Result 64830 states and 241369 transitions. [2019-01-13 03:39:33,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:39:33,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-01-13 03:39:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:33,394 INFO L225 Difference]: With dead ends: 64830 [2019-01-13 03:39:33,394 INFO L226 Difference]: Without dead ends: 64670 [2019-01-13 03:39:33,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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:39:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64670 states. [2019-01-13 03:39:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64670 to 37142. [2019-01-13 03:39:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37142 states. [2019-01-13 03:39:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37142 states to 37142 states and 138284 transitions. [2019-01-13 03:39:35,144 INFO L78 Accepts]: Start accepts. Automaton has 37142 states and 138284 transitions. Word has length 44 [2019-01-13 03:39:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:35,145 INFO L480 AbstractCegarLoop]: Abstraction has 37142 states and 138284 transitions. [2019-01-13 03:39:35,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:39:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 37142 states and 138284 transitions. [2019-01-13 03:39:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 03:39:35,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:35,150 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:39:35,151 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1206649085, now seen corresponding path program 1 times [2019-01-13 03:39:35,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:35,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:35,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:35,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:35,263 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:39:35,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:35,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:39:35,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:39:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:39:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:39:35,264 INFO L87 Difference]: Start difference. First operand 37142 states and 138284 transitions. Second operand 4 states. [2019-01-13 03:39:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:35,344 INFO L93 Difference]: Finished difference Result 12364 states and 41177 transitions. [2019-01-13 03:39:35,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:39:35,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-01-13 03:39:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:35,380 INFO L225 Difference]: With dead ends: 12364 [2019-01-13 03:39:35,380 INFO L226 Difference]: Without dead ends: 11843 [2019-01-13 03:39:35,381 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:39:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2019-01-13 03:39:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 11843. [2019-01-13 03:39:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11843 states. [2019-01-13 03:39:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11843 states to 11843 states and 39622 transitions. [2019-01-13 03:39:35,641 INFO L78 Accepts]: Start accepts. Automaton has 11843 states and 39622 transitions. Word has length 45 [2019-01-13 03:39:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:35,641 INFO L480 AbstractCegarLoop]: Abstraction has 11843 states and 39622 transitions. [2019-01-13 03:39:35,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:39:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 11843 states and 39622 transitions. [2019-01-13 03:39:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 03:39:35,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:35,649 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:39:35,649 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:35,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1535092985, now seen corresponding path program 1 times [2019-01-13 03:39:35,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:35,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:35,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:35,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:35,775 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:39:35,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:35,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:39:35,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:39:35,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:39:35,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:39:35,776 INFO L87 Difference]: Start difference. First operand 11843 states and 39622 transitions. Second operand 4 states. [2019-01-13 03:39:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:36,179 INFO L93 Difference]: Finished difference Result 17019 states and 55693 transitions. [2019-01-13 03:39:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:39:36,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-13 03:39:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:36,256 INFO L225 Difference]: With dead ends: 17019 [2019-01-13 03:39:36,256 INFO L226 Difference]: Without dead ends: 17019 [2019-01-13 03:39:36,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:39:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-01-13 03:39:36,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 12879. [2019-01-13 03:39:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12879 states. [2019-01-13 03:39:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 42720 transitions. [2019-01-13 03:39:36,652 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 42720 transitions. Word has length 58 [2019-01-13 03:39:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:36,653 INFO L480 AbstractCegarLoop]: Abstraction has 12879 states and 42720 transitions. [2019-01-13 03:39:36,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:39:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 42720 transitions. [2019-01-13 03:39:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 03:39:36,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:36,660 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:39:36,661 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:36,661 INFO L82 PathProgramCache]: Analyzing trace with hash -986044169, now seen corresponding path program 1 times [2019-01-13 03:39:36,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:36,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:36,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:36,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:36,807 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:39:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:36,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:39:36,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:39:36,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:39:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:39:36,810 INFO L87 Difference]: Start difference. First operand 12879 states and 42720 transitions. Second operand 6 states. [2019-01-13 03:39:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:37,864 INFO L93 Difference]: Finished difference Result 18599 states and 60830 transitions. [2019-01-13 03:39:37,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:39:37,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-01-13 03:39:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:38,344 INFO L225 Difference]: With dead ends: 18599 [2019-01-13 03:39:38,344 INFO L226 Difference]: Without dead ends: 18567 [2019-01-13 03:39:38,344 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:39:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18567 states. [2019-01-13 03:39:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18567 to 14411. [2019-01-13 03:39:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2019-01-13 03:39:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 47549 transitions. [2019-01-13 03:39:38,674 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 47549 transitions. Word has length 58 [2019-01-13 03:39:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:38,674 INFO L480 AbstractCegarLoop]: Abstraction has 14411 states and 47549 transitions. [2019-01-13 03:39:38,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:39:38,674 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 47549 transitions. [2019-01-13 03:39:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-13 03:39:38,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:38,702 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:39:38,703 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2012561834, now seen corresponding path program 1 times [2019-01-13 03:39:38,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:38,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:38,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:38,875 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:39:38,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:38,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:39:38,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:39:38,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:39:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:39:38,877 INFO L87 Difference]: Start difference. First operand 14411 states and 47549 transitions. Second operand 7 states. [2019-01-13 03:39:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:39,873 INFO L93 Difference]: Finished difference Result 19527 states and 63626 transitions. [2019-01-13 03:39:39,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-13 03:39:39,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-01-13 03:39:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:39,915 INFO L225 Difference]: With dead ends: 19527 [2019-01-13 03:39:39,915 INFO L226 Difference]: Without dead ends: 19463 [2019-01-13 03:39:39,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-01-13 03:39:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19463 states. [2019-01-13 03:39:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19463 to 16195. [2019-01-13 03:39:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16195 states. [2019-01-13 03:39:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16195 states to 16195 states and 53059 transitions. [2019-01-13 03:39:40,237 INFO L78 Accepts]: Start accepts. Automaton has 16195 states and 53059 transitions. Word has length 72 [2019-01-13 03:39:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:40,238 INFO L480 AbstractCegarLoop]: Abstraction has 16195 states and 53059 transitions. [2019-01-13 03:39:40,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:39:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 16195 states and 53059 transitions. [2019-01-13 03:39:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-13 03:39:40,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:40,262 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] [2019-01-13 03:39:40,263 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash -351525462, now seen corresponding path program 1 times [2019-01-13 03:39:40,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:40,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:40,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:40,373 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:39:40,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:39:40,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:39:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:39:40,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:39:40,377 INFO L87 Difference]: Start difference. First operand 16195 states and 53059 transitions. Second operand 3 states. [2019-01-13 03:39:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:40,774 INFO L93 Difference]: Finished difference Result 19283 states and 62127 transitions. [2019-01-13 03:39:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:39:40,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-13 03:39:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:40,809 INFO L225 Difference]: With dead ends: 19283 [2019-01-13 03:39:40,809 INFO L226 Difference]: Without dead ends: 19283 [2019-01-13 03:39:40,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:39:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19283 states. [2019-01-13 03:39:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19283 to 17291. [2019-01-13 03:39:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17291 states. [2019-01-13 03:39:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17291 states to 17291 states and 56209 transitions. [2019-01-13 03:39:41,090 INFO L78 Accepts]: Start accepts. Automaton has 17291 states and 56209 transitions. Word has length 74 [2019-01-13 03:39:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:41,090 INFO L480 AbstractCegarLoop]: Abstraction has 17291 states and 56209 transitions. [2019-01-13 03:39:41,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:39:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 17291 states and 56209 transitions. [2019-01-13 03:39:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-13 03:39:41,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:41,111 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] [2019-01-13 03:39:41,112 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:41,112 INFO L82 PathProgramCache]: Analyzing trace with hash 610734480, now seen corresponding path program 1 times [2019-01-13 03:39:41,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:41,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:41,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:41,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:41,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:41,936 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:39:41,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:39:41,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:39:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:39:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:39:41,938 INFO L87 Difference]: Start difference. First operand 17291 states and 56209 transitions. Second operand 10 states. [2019-01-13 03:39:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:44,556 INFO L93 Difference]: Finished difference Result 25447 states and 79950 transitions. [2019-01-13 03:39:44,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 03:39:44,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-01-13 03:39:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:44,603 INFO L225 Difference]: With dead ends: 25447 [2019-01-13 03:39:44,603 INFO L226 Difference]: Without dead ends: 25383 [2019-01-13 03:39:44,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2019-01-13 03:39:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25383 states. [2019-01-13 03:39:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25383 to 19359. [2019-01-13 03:39:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19359 states. [2019-01-13 03:39:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19359 states to 19359 states and 62260 transitions. [2019-01-13 03:39:44,969 INFO L78 Accepts]: Start accepts. Automaton has 19359 states and 62260 transitions. Word has length 78 [2019-01-13 03:39:44,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:44,970 INFO L480 AbstractCegarLoop]: Abstraction has 19359 states and 62260 transitions. [2019-01-13 03:39:44,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:39:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 19359 states and 62260 transitions. [2019-01-13 03:39:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 03:39:44,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:44,997 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] [2019-01-13 03:39:44,997 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash -676930281, now seen corresponding path program 1 times [2019-01-13 03:39:44,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:44,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:45,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:45,143 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:39:45,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:45,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:39:45,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:39:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:39:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:39:45,145 INFO L87 Difference]: Start difference. First operand 19359 states and 62260 transitions. Second operand 3 states. [2019-01-13 03:39:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:45,832 INFO L93 Difference]: Finished difference Result 20621 states and 66127 transitions. [2019-01-13 03:39:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:39:45,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-01-13 03:39:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:45,870 INFO L225 Difference]: With dead ends: 20621 [2019-01-13 03:39:45,870 INFO L226 Difference]: Without dead ends: 20621 [2019-01-13 03:39:45,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:39:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20621 states. [2019-01-13 03:39:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20621 to 19971. [2019-01-13 03:39:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19971 states. [2019-01-13 03:39:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19971 states to 19971 states and 64142 transitions. [2019-01-13 03:39:46,191 INFO L78 Accepts]: Start accepts. Automaton has 19971 states and 64142 transitions. Word has length 79 [2019-01-13 03:39:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:46,191 INFO L480 AbstractCegarLoop]: Abstraction has 19971 states and 64142 transitions. [2019-01-13 03:39:46,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:39:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 19971 states and 64142 transitions. [2019-01-13 03:39:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 03:39:46,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:46,216 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] [2019-01-13 03:39:46,217 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:46,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash -34557090, now seen corresponding path program 1 times [2019-01-13 03:39:46,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:46,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:46,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:46,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:46,403 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:39:46,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:46,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:39:46,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:39:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:39:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:39:46,405 INFO L87 Difference]: Start difference. First operand 19971 states and 64142 transitions. Second operand 4 states. [2019-01-13 03:39:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:46,895 INFO L93 Difference]: Finished difference Result 24353 states and 77144 transitions. [2019-01-13 03:39:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:39:46,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-13 03:39:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:46,944 INFO L225 Difference]: With dead ends: 24353 [2019-01-13 03:39:46,944 INFO L226 Difference]: Without dead ends: 24353 [2019-01-13 03:39:46,944 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:39:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24353 states. [2019-01-13 03:39:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24353 to 22837. [2019-01-13 03:39:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22837 states. [2019-01-13 03:39:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22837 states to 22837 states and 72763 transitions. [2019-01-13 03:39:47,363 INFO L78 Accepts]: Start accepts. Automaton has 22837 states and 72763 transitions. Word has length 80 [2019-01-13 03:39:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:47,363 INFO L480 AbstractCegarLoop]: Abstraction has 22837 states and 72763 transitions. [2019-01-13 03:39:47,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:39:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 22837 states and 72763 transitions. [2019-01-13 03:39:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 03:39:47,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:47,391 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] [2019-01-13 03:39:47,392 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1970217377, now seen corresponding path program 1 times [2019-01-13 03:39:47,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:47,531 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:39:47,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:47,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:39:47,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:39:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:39:47,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:39:47,534 INFO L87 Difference]: Start difference. First operand 22837 states and 72763 transitions. Second operand 3 states. [2019-01-13 03:39:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:48,191 INFO L93 Difference]: Finished difference Result 24179 states and 76859 transitions. [2019-01-13 03:39:48,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:39:48,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-13 03:39:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:48,239 INFO L225 Difference]: With dead ends: 24179 [2019-01-13 03:39:48,239 INFO L226 Difference]: Without dead ends: 24179 [2019-01-13 03:39:48,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:39:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24179 states. [2019-01-13 03:39:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24179 to 23519. [2019-01-13 03:39:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23519 states. [2019-01-13 03:39:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23519 states to 23519 states and 74839 transitions. [2019-01-13 03:39:49,025 INFO L78 Accepts]: Start accepts. Automaton has 23519 states and 74839 transitions. Word has length 80 [2019-01-13 03:39:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:49,025 INFO L480 AbstractCegarLoop]: Abstraction has 23519 states and 74839 transitions. [2019-01-13 03:39:49,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:39:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23519 states and 74839 transitions. [2019-01-13 03:39:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:39:49,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:49,049 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] [2019-01-13 03:39:49,050 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash 217933573, now seen corresponding path program 1 times [2019-01-13 03:39:49,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:49,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:49,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:49,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:49,252 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:39:49,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:49,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:39:49,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:39:49,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:39:49,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:39:49,253 INFO L87 Difference]: Start difference. First operand 23519 states and 74839 transitions. Second operand 5 states. [2019-01-13 03:39:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:50,541 INFO L93 Difference]: Finished difference Result 55998 states and 175087 transitions. [2019-01-13 03:39:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:39:50,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-01-13 03:39:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:50,656 INFO L225 Difference]: With dead ends: 55998 [2019-01-13 03:39:50,657 INFO L226 Difference]: Without dead ends: 55998 [2019-01-13 03:39:50,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:39:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55998 states. [2019-01-13 03:39:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55998 to 28501. [2019-01-13 03:39:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28501 states. [2019-01-13 03:39:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28501 states to 28501 states and 91285 transitions. [2019-01-13 03:39:51,284 INFO L78 Accepts]: Start accepts. Automaton has 28501 states and 91285 transitions. Word has length 81 [2019-01-13 03:39:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:51,284 INFO L480 AbstractCegarLoop]: Abstraction has 28501 states and 91285 transitions. [2019-01-13 03:39:51,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:39:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 28501 states and 91285 transitions. [2019-01-13 03:39:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:39:51,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:51,320 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] [2019-01-13 03:39:51,320 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash -111832188, now seen corresponding path program 1 times [2019-01-13 03:39:51,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:51,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:51,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:51,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:51,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:51,525 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:39:51,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:51,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:39:51,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:39:51,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:39:51,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:39:51,527 INFO L87 Difference]: Start difference. First operand 28501 states and 91285 transitions. Second operand 6 states. [2019-01-13 03:39:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:52,554 INFO L93 Difference]: Finished difference Result 51217 states and 160214 transitions. [2019-01-13 03:39:52,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:39:52,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-01-13 03:39:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:52,653 INFO L225 Difference]: With dead ends: 51217 [2019-01-13 03:39:52,653 INFO L226 Difference]: Without dead ends: 49953 [2019-01-13 03:39:52,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:39:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49953 states. [2019-01-13 03:39:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49953 to 39661. [2019-01-13 03:39:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39661 states. [2019-01-13 03:39:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39661 states to 39661 states and 126611 transitions. [2019-01-13 03:39:53,781 INFO L78 Accepts]: Start accepts. Automaton has 39661 states and 126611 transitions. Word has length 81 [2019-01-13 03:39:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:53,781 INFO L480 AbstractCegarLoop]: Abstraction has 39661 states and 126611 transitions. [2019-01-13 03:39:53,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:39:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 39661 states and 126611 transitions. [2019-01-13 03:39:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:39:53,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:53,836 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] [2019-01-13 03:39:53,836 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:53,837 INFO L82 PathProgramCache]: Analyzing trace with hash 849781829, now seen corresponding path program 1 times [2019-01-13 03:39:53,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:53,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:53,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:53,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:54,062 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:39:54,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:54,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:39:54,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:39:54,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:39:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:39:54,063 INFO L87 Difference]: Start difference. First operand 39661 states and 126611 transitions. Second operand 7 states. [2019-01-13 03:39:55,507 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-13 03:39:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:56,526 INFO L93 Difference]: Finished difference Result 64885 states and 198772 transitions. [2019-01-13 03:39:56,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:39:56,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-01-13 03:39:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:56,648 INFO L225 Difference]: With dead ends: 64885 [2019-01-13 03:39:56,649 INFO L226 Difference]: Without dead ends: 64773 [2019-01-13 03:39:56,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-01-13 03:39:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64773 states. [2019-01-13 03:39:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64773 to 39776. [2019-01-13 03:39:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39776 states. [2019-01-13 03:39:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39776 states to 39776 states and 123995 transitions. [2019-01-13 03:39:57,429 INFO L78 Accepts]: Start accepts. Automaton has 39776 states and 123995 transitions. Word has length 81 [2019-01-13 03:39:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:57,429 INFO L480 AbstractCegarLoop]: Abstraction has 39776 states and 123995 transitions. [2019-01-13 03:39:57,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:39:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 39776 states and 123995 transitions. [2019-01-13 03:39:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:39:57,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:57,467 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] [2019-01-13 03:39:57,468 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:57,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1574202429, now seen corresponding path program 2 times [2019-01-13 03:39:57,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:57,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:57,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:57,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:39:57,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:39:57,742 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:39:57,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:39:57,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:39:57,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:39:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:39:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:39:57,744 INFO L87 Difference]: Start difference. First operand 39776 states and 123995 transitions. Second operand 6 states. [2019-01-13 03:39:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:39:58,791 INFO L93 Difference]: Finished difference Result 58816 states and 182231 transitions. [2019-01-13 03:39:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:39:58,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-01-13 03:39:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:39:58,917 INFO L225 Difference]: With dead ends: 58816 [2019-01-13 03:39:58,917 INFO L226 Difference]: Without dead ends: 58816 [2019-01-13 03:39:58,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:39:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58816 states. [2019-01-13 03:39:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58816 to 43484. [2019-01-13 03:39:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43484 states. [2019-01-13 03:39:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43484 states to 43484 states and 135064 transitions. [2019-01-13 03:39:59,738 INFO L78 Accepts]: Start accepts. Automaton has 43484 states and 135064 transitions. Word has length 81 [2019-01-13 03:39:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:39:59,739 INFO L480 AbstractCegarLoop]: Abstraction has 43484 states and 135064 transitions. [2019-01-13 03:39:59,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:39:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 43484 states and 135064 transitions. [2019-01-13 03:39:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:39:59,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:39:59,790 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] [2019-01-13 03:39:59,790 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:39:59,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:39:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1476000386, now seen corresponding path program 1 times [2019-01-13 03:39:59,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:39:59,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:39:59,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:59,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:39:59,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:39:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:00,068 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:00,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:00,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:00,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:00,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:00,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:00,069 INFO L87 Difference]: Start difference. First operand 43484 states and 135064 transitions. Second operand 7 states. [2019-01-13 03:40:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:01,431 INFO L93 Difference]: Finished difference Result 53488 states and 164527 transitions. [2019-01-13 03:40:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:40:01,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-01-13 03:40:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:01,537 INFO L225 Difference]: With dead ends: 53488 [2019-01-13 03:40:01,537 INFO L226 Difference]: Without dead ends: 52872 [2019-01-13 03:40:01,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:40:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52872 states. [2019-01-13 03:40:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52872 to 42203. [2019-01-13 03:40:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42203 states. [2019-01-13 03:40:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42203 states to 42203 states and 131430 transitions. [2019-01-13 03:40:02,703 INFO L78 Accepts]: Start accepts. Automaton has 42203 states and 131430 transitions. Word has length 81 [2019-01-13 03:40:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:02,703 INFO L480 AbstractCegarLoop]: Abstraction has 42203 states and 131430 transitions. [2019-01-13 03:40:02,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 42203 states and 131430 transitions. [2019-01-13 03:40:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:40:02,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:02,745 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] [2019-01-13 03:40:02,746 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2033769469, now seen corresponding path program 1 times [2019-01-13 03:40:02,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:02,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:02,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:02,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:02,938 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:02,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:02,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:02,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:02,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:02,939 INFO L87 Difference]: Start difference. First operand 42203 states and 131430 transitions. Second operand 7 states. [2019-01-13 03:40:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:04,318 INFO L93 Difference]: Finished difference Result 77506 states and 237207 transitions. [2019-01-13 03:40:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:40:04,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-01-13 03:40:04,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:04,468 INFO L225 Difference]: With dead ends: 77506 [2019-01-13 03:40:04,468 INFO L226 Difference]: Without dead ends: 76650 [2019-01-13 03:40:04,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:40:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76650 states. [2019-01-13 03:40:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76650 to 42136. [2019-01-13 03:40:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42136 states. [2019-01-13 03:40:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42136 states to 42136 states and 131261 transitions. [2019-01-13 03:40:05,353 INFO L78 Accepts]: Start accepts. Automaton has 42136 states and 131261 transitions. Word has length 81 [2019-01-13 03:40:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:05,353 INFO L480 AbstractCegarLoop]: Abstraction has 42136 states and 131261 transitions. [2019-01-13 03:40:05,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 42136 states and 131261 transitions. [2019-01-13 03:40:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:40:05,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:05,397 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] [2019-01-13 03:40:05,398 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash 149471869, now seen corresponding path program 1 times [2019-01-13 03:40:05,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:05,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:05,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:06,015 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:06,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:06,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:40:06,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:40:06,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:40:06,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:06,016 INFO L87 Difference]: Start difference. First operand 42136 states and 131261 transitions. Second operand 8 states. [2019-01-13 03:40:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:07,917 INFO L93 Difference]: Finished difference Result 63307 states and 191899 transitions. [2019-01-13 03:40:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 03:40:07,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-01-13 03:40:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:08,037 INFO L225 Difference]: With dead ends: 63307 [2019-01-13 03:40:08,037 INFO L226 Difference]: Without dead ends: 62455 [2019-01-13 03:40:08,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-01-13 03:40:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62455 states. [2019-01-13 03:40:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62455 to 41419. [2019-01-13 03:40:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41419 states. [2019-01-13 03:40:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41419 states to 41419 states and 128481 transitions. [2019-01-13 03:40:08,872 INFO L78 Accepts]: Start accepts. Automaton has 41419 states and 128481 transitions. Word has length 81 [2019-01-13 03:40:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:08,872 INFO L480 AbstractCegarLoop]: Abstraction has 41419 states and 128481 transitions. [2019-01-13 03:40:08,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:40:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 41419 states and 128481 transitions. [2019-01-13 03:40:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:40:09,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:09,354 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] [2019-01-13 03:40:09,354 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1111085886, now seen corresponding path program 1 times [2019-01-13 03:40:09,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:09,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:09,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:09,498 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:09,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:09,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:09,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:09,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:09,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:09,500 INFO L87 Difference]: Start difference. First operand 41419 states and 128481 transitions. Second operand 5 states. [2019-01-13 03:40:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:09,553 INFO L93 Difference]: Finished difference Result 5447 states and 13942 transitions. [2019-01-13 03:40:09,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:40:09,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-01-13 03:40:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:09,560 INFO L225 Difference]: With dead ends: 5447 [2019-01-13 03:40:09,560 INFO L226 Difference]: Without dead ends: 4629 [2019-01-13 03:40:09,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2019-01-13 03:40:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4234. [2019-01-13 03:40:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4234 states. [2019-01-13 03:40:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 10952 transitions. [2019-01-13 03:40:09,609 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 10952 transitions. Word has length 81 [2019-01-13 03:40:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:09,609 INFO L480 AbstractCegarLoop]: Abstraction has 4234 states and 10952 transitions. [2019-01-13 03:40:09,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 10952 transitions. [2019-01-13 03:40:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:09,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:09,614 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:09,614 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1704916654, now seen corresponding path program 1 times [2019-01-13 03:40:09,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:09,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:09,777 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:09,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:09,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:09,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:09,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:09,779 INFO L87 Difference]: Start difference. First operand 4234 states and 10952 transitions. Second operand 5 states. [2019-01-13 03:40:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:10,018 INFO L93 Difference]: Finished difference Result 5421 states and 13801 transitions. [2019-01-13 03:40:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:10,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 03:40:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:10,027 INFO L225 Difference]: With dead ends: 5421 [2019-01-13 03:40:10,027 INFO L226 Difference]: Without dead ends: 5421 [2019-01-13 03:40:10,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2019-01-13 03:40:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 4317. [2019-01-13 03:40:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-01-13 03:40:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 11119 transitions. [2019-01-13 03:40:10,080 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 11119 transitions. Word has length 93 [2019-01-13 03:40:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:10,080 INFO L480 AbstractCegarLoop]: Abstraction has 4317 states and 11119 transitions. [2019-01-13 03:40:10,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 11119 transitions. [2019-01-13 03:40:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:10,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:10,086 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:10,086 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1827291417, now seen corresponding path program 1 times [2019-01-13 03:40:10,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:10,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:10,254 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-13 03:40:10,556 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:10,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:10,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:10,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:10,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:10,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:10,557 INFO L87 Difference]: Start difference. First operand 4317 states and 11119 transitions. Second operand 7 states. [2019-01-13 03:40:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:10,899 INFO L93 Difference]: Finished difference Result 4718 states and 12062 transitions. [2019-01-13 03:40:10,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:40:10,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-01-13 03:40:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:10,908 INFO L225 Difference]: With dead ends: 4718 [2019-01-13 03:40:10,908 INFO L226 Difference]: Without dead ends: 4718 [2019-01-13 03:40:10,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:10,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2019-01-13 03:40:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4442. [2019-01-13 03:40:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2019-01-13 03:40:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 11391 transitions. [2019-01-13 03:40:10,959 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 11391 transitions. Word has length 93 [2019-01-13 03:40:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:10,959 INFO L480 AbstractCegarLoop]: Abstraction has 4442 states and 11391 transitions. [2019-01-13 03:40:10,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 11391 transitions. [2019-01-13 03:40:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:10,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:10,964 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:10,964 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1284328582, now seen corresponding path program 1 times [2019-01-13 03:40:10,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:10,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:10,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:10,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:11,188 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:11,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:11,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:11,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:11,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:11,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:11,190 INFO L87 Difference]: Start difference. First operand 4442 states and 11391 transitions. Second operand 5 states. [2019-01-13 03:40:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:11,319 INFO L93 Difference]: Finished difference Result 4357 states and 11139 transitions. [2019-01-13 03:40:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:40:11,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-01-13 03:40:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:11,327 INFO L225 Difference]: With dead ends: 4357 [2019-01-13 03:40:11,327 INFO L226 Difference]: Without dead ends: 4357 [2019-01-13 03:40:11,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2019-01-13 03:40:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 4316. [2019-01-13 03:40:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4316 states. [2019-01-13 03:40:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 11052 transitions. [2019-01-13 03:40:11,376 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 11052 transitions. Word has length 93 [2019-01-13 03:40:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:11,377 INFO L480 AbstractCegarLoop]: Abstraction has 4316 states and 11052 transitions. [2019-01-13 03:40:11,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 11052 transitions. [2019-01-13 03:40:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-13 03:40:11,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:11,382 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:11,382 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash -125982074, now seen corresponding path program 1 times [2019-01-13 03:40:11,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:11,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:11,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:11,583 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:11,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:11,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:11,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:11,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:11,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:11,585 INFO L87 Difference]: Start difference. First operand 4316 states and 11052 transitions. Second operand 6 states. [2019-01-13 03:40:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:11,787 INFO L93 Difference]: Finished difference Result 4028 states and 10044 transitions. [2019-01-13 03:40:11,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:40:11,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-01-13 03:40:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:11,794 INFO L225 Difference]: With dead ends: 4028 [2019-01-13 03:40:11,794 INFO L226 Difference]: Without dead ends: 4028 [2019-01-13 03:40:11,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2019-01-13 03:40:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 2988. [2019-01-13 03:40:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-01-13 03:40:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7539 transitions. [2019-01-13 03:40:11,833 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7539 transitions. Word has length 93 [2019-01-13 03:40:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:11,833 INFO L480 AbstractCegarLoop]: Abstraction has 2988 states and 7539 transitions. [2019-01-13 03:40:11,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7539 transitions. [2019-01-13 03:40:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:11,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:11,837 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:11,837 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1682422135, now seen corresponding path program 1 times [2019-01-13 03:40:11,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:11,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:12,041 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:12,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:12,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:40:12,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:40:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:40:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:12,043 INFO L87 Difference]: Start difference. First operand 2988 states and 7539 transitions. Second operand 8 states. [2019-01-13 03:40:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:12,724 INFO L93 Difference]: Finished difference Result 4724 states and 11574 transitions. [2019-01-13 03:40:12,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:40:12,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 03:40:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:12,733 INFO L225 Difference]: With dead ends: 4724 [2019-01-13 03:40:12,733 INFO L226 Difference]: Without dead ends: 4692 [2019-01-13 03:40:12,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:40:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2019-01-13 03:40:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 3656. [2019-01-13 03:40:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3656 states. [2019-01-13 03:40:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 9134 transitions. [2019-01-13 03:40:12,780 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 9134 transitions. Word has length 95 [2019-01-13 03:40:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:12,780 INFO L480 AbstractCegarLoop]: Abstraction has 3656 states and 9134 transitions. [2019-01-13 03:40:12,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:40:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 9134 transitions. [2019-01-13 03:40:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:12,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:12,785 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:12,785 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1367780680, now seen corresponding path program 1 times [2019-01-13 03:40:12,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:12,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:13,556 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:13,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:13,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:40:13,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:40:13,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:40:13,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:13,560 INFO L87 Difference]: Start difference. First operand 3656 states and 9134 transitions. Second operand 8 states. [2019-01-13 03:40:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:14,418 INFO L93 Difference]: Finished difference Result 4805 states and 11811 transitions. [2019-01-13 03:40:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-13 03:40:14,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 03:40:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:14,426 INFO L225 Difference]: With dead ends: 4805 [2019-01-13 03:40:14,426 INFO L226 Difference]: Without dead ends: 4751 [2019-01-13 03:40:14,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-01-13 03:40:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2019-01-13 03:40:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 3617. [2019-01-13 03:40:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3617 states. [2019-01-13 03:40:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 9016 transitions. [2019-01-13 03:40:14,471 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 9016 transitions. Word has length 95 [2019-01-13 03:40:14,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:14,471 INFO L480 AbstractCegarLoop]: Abstraction has 3617 states and 9016 transitions. [2019-01-13 03:40:14,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:40:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 9016 transitions. [2019-01-13 03:40:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:14,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:14,476 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:14,476 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:14,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash 991526329, now seen corresponding path program 1 times [2019-01-13 03:40:14,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:14,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:14,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:14,681 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:14,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:14,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:14,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:14,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:14,683 INFO L87 Difference]: Start difference. First operand 3617 states and 9016 transitions. Second operand 7 states. [2019-01-13 03:40:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:15,030 INFO L93 Difference]: Finished difference Result 4493 states and 11080 transitions. [2019-01-13 03:40:15,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:15,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:40:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:15,038 INFO L225 Difference]: With dead ends: 4493 [2019-01-13 03:40:15,038 INFO L226 Difference]: Without dead ends: 4493 [2019-01-13 03:40:15,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:40:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2019-01-13 03:40:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 3702. [2019-01-13 03:40:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3702 states. [2019-01-13 03:40:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 9179 transitions. [2019-01-13 03:40:15,082 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 9179 transitions. Word has length 95 [2019-01-13 03:40:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:15,082 INFO L480 AbstractCegarLoop]: Abstraction has 3702 states and 9179 transitions. [2019-01-13 03:40:15,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 9179 transitions. [2019-01-13 03:40:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:15,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:15,087 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:15,087 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:15,088 INFO L82 PathProgramCache]: Analyzing trace with hash 76527609, now seen corresponding path program 1 times [2019-01-13 03:40:15,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:15,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:15,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:15,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:15,252 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:15,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:15,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:40:15,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:40:15,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:40:15,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:40:15,253 INFO L87 Difference]: Start difference. First operand 3702 states and 9179 transitions. Second operand 5 states. [2019-01-13 03:40:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:15,490 INFO L93 Difference]: Finished difference Result 4150 states and 10283 transitions. [2019-01-13 03:40:15,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:40:15,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-13 03:40:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:15,499 INFO L225 Difference]: With dead ends: 4150 [2019-01-13 03:40:15,499 INFO L226 Difference]: Without dead ends: 4118 [2019-01-13 03:40:15,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2019-01-13 03:40:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3098. [2019-01-13 03:40:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-01-13 03:40:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 7705 transitions. [2019-01-13 03:40:15,544 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 7705 transitions. Word has length 95 [2019-01-13 03:40:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:15,544 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 7705 transitions. [2019-01-13 03:40:15,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:40:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 7705 transitions. [2019-01-13 03:40:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:15,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:15,548 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:15,549 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1321292090, now seen corresponding path program 1 times [2019-01-13 03:40:15,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:15,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:15,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:15,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:15,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:15,776 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:15,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:15,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:40:15,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:40:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:40:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:40:15,777 INFO L87 Difference]: Start difference. First operand 3098 states and 7705 transitions. Second operand 8 states. [2019-01-13 03:40:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:16,359 INFO L93 Difference]: Finished difference Result 5658 states and 14511 transitions. [2019-01-13 03:40:16,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:40:16,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 03:40:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:16,369 INFO L225 Difference]: With dead ends: 5658 [2019-01-13 03:40:16,369 INFO L226 Difference]: Without dead ends: 5658 [2019-01-13 03:40:16,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:40:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2019-01-13 03:40:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 3023. [2019-01-13 03:40:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3023 states. [2019-01-13 03:40:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3023 states to 3023 states and 7556 transitions. [2019-01-13 03:40:16,416 INFO L78 Accepts]: Start accepts. Automaton has 3023 states and 7556 transitions. Word has length 95 [2019-01-13 03:40:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:16,416 INFO L480 AbstractCegarLoop]: Abstraction has 3023 states and 7556 transitions. [2019-01-13 03:40:16,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:40:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3023 states and 7556 transitions. [2019-01-13 03:40:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:16,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:16,420 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:16,420 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1332501510, now seen corresponding path program 1 times [2019-01-13 03:40:16,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:16,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:16,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:16,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:16,687 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,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:16,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:40:16,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:40:16,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:40:16,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:40:16,688 INFO L87 Difference]: Start difference. First operand 3023 states and 7556 transitions. Second operand 6 states. [2019-01-13 03:40:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:16,832 INFO L93 Difference]: Finished difference Result 3264 states and 8028 transitions. [2019-01-13 03:40:16,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:40:16,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-01-13 03:40:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:16,837 INFO L225 Difference]: With dead ends: 3264 [2019-01-13 03:40:16,838 INFO L226 Difference]: Without dead ends: 3264 [2019-01-13 03:40:16,838 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:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2019-01-13 03:40:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3072. [2019-01-13 03:40:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-01-13 03:40:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 7656 transitions. [2019-01-13 03:40:16,874 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 7656 transitions. Word has length 95 [2019-01-13 03:40:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:16,874 INFO L480 AbstractCegarLoop]: Abstraction has 3072 states and 7656 transitions. [2019-01-13 03:40:16,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:40:16,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 7656 transitions. [2019-01-13 03:40:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:16,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:16,878 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:16,878 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1002735749, now seen corresponding path program 1 times [2019-01-13 03:40:16,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:16,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:16,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:16,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:40:17,114 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 03:40:17,160 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:17,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:40:17,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:40:17,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:40:17,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:40:17,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:40:17,161 INFO L87 Difference]: Start difference. First operand 3072 states and 7656 transitions. Second operand 7 states. [2019-01-13 03:40:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:40:17,490 INFO L93 Difference]: Finished difference Result 5207 states and 13139 transitions. [2019-01-13 03:40:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:40:17,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-01-13 03:40:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:40:17,495 INFO L225 Difference]: With dead ends: 5207 [2019-01-13 03:40:17,495 INFO L226 Difference]: Without dead ends: 2120 [2019-01-13 03:40:17,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 03:40:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2019-01-13 03:40:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2120. [2019-01-13 03:40:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-01-13 03:40:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 5435 transitions. [2019-01-13 03:40:17,520 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 5435 transitions. Word has length 95 [2019-01-13 03:40:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:40:17,520 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 5435 transitions. [2019-01-13 03:40:17,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:40:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 5435 transitions. [2019-01-13 03:40:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 03:40:17,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:40:17,524 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:17,524 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:40:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:40:17,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1809124577, now seen corresponding path program 2 times [2019-01-13 03:40:17,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:40:17,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:40:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:17,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:40:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:40:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:40:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:40:17,604 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:40:17,781 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:40:17,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:40:17 BasicIcfg [2019-01-13 03:40:17,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:40:17,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:40:17,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:40:17,788 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:40:17,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:39:24" (3/4) ... [2019-01-13 03:40:17,794 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:40:18,017 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:40:18,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:40:18,022 INFO L168 Benchmark]: Toolchain (without parser) took 55484.36 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 952.7 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-01-13 03:40:18,022 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:40:18,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-13 03:40:18,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.15 ms. Allocated memory is still 1.2 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:18,029 INFO L168 Benchmark]: Boogie Preprocessor took 52.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:40:18,029 INFO L168 Benchmark]: RCFGBuilder took 1203.86 ms. Allocated memory is still 1.2 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:18,029 INFO L168 Benchmark]: TraceAbstraction took 53039.74 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-13 03:40:18,029 INFO L168 Benchmark]: Witness Printer took 233.23 ms. Allocated memory is still 4.1 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-13 03:40:18,033 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 868.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.15 ms. Allocated memory is still 1.2 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 52.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1203.86 ms. Allocated memory is still 1.2 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 53039.74 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 233.23 ms. Allocated memory is still 4.1 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 t1589; 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(&t1589, ((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 t1590; 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(&t1590, ((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] [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=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$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=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$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=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] [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=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=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] [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=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=1, 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=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] [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=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] [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=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, 52.8s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 28.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9168 SDtfs, 9629 SDslu, 22393 SDs, 0 SdLazy, 11866 SolverSat, 662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 93 SyntacticMatches, 22 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43484occurred in iteration=15, 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: 13.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 220901 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2485 NumberOfCodeBlocks, 2485 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2360 ConstructedInterpolants, 0 QuantifiedInterpolants, 472807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...