./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/rfi001_rmo.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/rfi001_rmo.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 955a7462776db711df9d88fc8b0a22926f6ecdd0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:41:12,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 03:41:12,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 03:41:12,650 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 03:41:12,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 03:41:12,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 03:41:12,653 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 03:41:12,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 03:41:12,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 03:41:12,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 03:41:12,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 03:41:12,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 03:41:12,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 03:41:12,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 03:41:12,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 03:41:12,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 03:41:12,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 03:41:12,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 03:41:12,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 03:41:12,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 03:41:12,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 03:41:12,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 03:41:12,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 03:41:12,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 03:41:12,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 03:41:12,689 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 03:41:12,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 03:41:12,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 03:41:12,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 03:41:12,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 03:41:12,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 03:41:12,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 03:41:12,701 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 03:41:12,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 03:41:12,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 03:41:12,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 03:41:12,703 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:41:12,725 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 03:41:12,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 03:41:12,726 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 03:41:12,727 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 03:41:12,727 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 03:41:12,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 03:41:12,728 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 03:41:12,728 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 03:41:12,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 03:41:12,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 03:41:12,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 03:41:12,729 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 03:41:12,729 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 03:41:12,729 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 03:41:12,729 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 03:41:12,729 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 03:41:12,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 03:41:12,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 03:41:12,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 03:41:12,731 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 03:41:12,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 03:41:12,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 03:41:12,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 03:41:12,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 03:41:12,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 03:41:12,733 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 03:41:12,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 03:41:12,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 03:41:12,734 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 -> 955a7462776db711df9d88fc8b0a22926f6ecdd0 [2019-01-13 03:41:12,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 03:41:12,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 03:41:12,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 03:41:12,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 03:41:12,792 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 03:41:12,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i [2019-01-13 03:41:12,854 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079354568/4bc8a571cbe94727839cc4fd6ce9fac7/FLAGeb187f19c [2019-01-13 03:41:13,462 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 03:41:13,463 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/rfi001_rmo.opt_false-unreach-call.i [2019-01-13 03:41:13,493 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079354568/4bc8a571cbe94727839cc4fd6ce9fac7/FLAGeb187f19c [2019-01-13 03:41:13,696 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/079354568/4bc8a571cbe94727839cc4fd6ce9fac7 [2019-01-13 03:41:13,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 03:41:13,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 03:41:13,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 03:41:13,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 03:41:13,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 03:41:13,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:41:13" (1/1) ... [2019-01-13 03:41:13,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743af7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:13, skipping insertion in model container [2019-01-13 03:41:13,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 03:41:13" (1/1) ... [2019-01-13 03:41:13,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 03:41:13,786 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 03:41:14,277 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:41:14,298 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 03:41:14,460 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 03:41:14,560 INFO L195 MainTranslator]: Completed translation [2019-01-13 03:41:14,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14 WrapperNode [2019-01-13 03:41:14,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 03:41:14,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 03:41:14,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 03:41:14,562 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 03:41:14,572 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:41:14" (1/1) ... [2019-01-13 03:41:14,603 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:41:14" (1/1) ... [2019-01-13 03:41:14,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 03:41:14,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 03:41:14,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 03:41:14,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 03:41:14,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (1/1) ... [2019-01-13 03:41:14,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (1/1) ... [2019-01-13 03:41:14,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (1/1) ... [2019-01-13 03:41:14,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (1/1) ... [2019-01-13 03:41:14,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (1/1) ... [2019-01-13 03:41:14,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (1/1) ... [2019-01-13 03:41:14,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (1/1) ... [2019-01-13 03:41:14,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 03:41:14,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 03:41:14,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 03:41:14,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 03:41:14,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (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:41:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 03:41:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 03:41:14,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 03:41:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 03:41:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 03:41:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 03:41:14,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 03:41:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 03:41:14,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 03:41:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 03:41:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 03:41:14,752 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:41:15,854 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 03:41:15,855 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 03:41:15,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:41:15 BoogieIcfgContainer [2019-01-13 03:41:15,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 03:41:15,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 03:41:15,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 03:41:15,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 03:41:15,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 03:41:13" (1/3) ... [2019-01-13 03:41:15,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803cb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:41:15, skipping insertion in model container [2019-01-13 03:41:15,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 03:41:14" (2/3) ... [2019-01-13 03:41:15,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803cb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 03:41:15, skipping insertion in model container [2019-01-13 03:41:15,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:41:15" (3/3) ... [2019-01-13 03:41:15,869 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.opt_false-unreach-call.i [2019-01-13 03:41:15,910 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,911 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,911 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,911 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,912 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,913 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,914 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,915 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,916 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,917 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,917 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,917 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,917 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,917 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,918 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,920 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,921 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,921 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,922 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,922 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:41:15,922 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,922 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,922 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,924 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,925 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,927 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,929 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,935 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 03:41:15,946 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 03:41:15,947 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 03:41:15,955 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 03:41:15,973 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 03:41:16,002 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 03:41:16,003 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 03:41:16,003 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 03:41:16,003 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 03:41:16,003 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 03:41:16,003 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 03:41:16,004 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 03:41:16,004 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 03:41:16,004 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 03:41:16,019 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2019-01-13 03:41:17,660 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2019-01-13 03:41:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2019-01-13 03:41:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 03:41:17,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:17,673 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] [2019-01-13 03:41:17,675 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:17,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2019-01-13 03:41:17,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:17,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:17,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:17,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:17,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:18,038 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:41:18,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:18,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:41:18,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:41:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:41:18,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:18,059 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2019-01-13 03:41:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:19,209 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2019-01-13 03:41:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:41:19,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-01-13 03:41:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:19,629 INFO L225 Difference]: With dead ends: 45389 [2019-01-13 03:41:19,629 INFO L226 Difference]: Without dead ends: 40629 [2019-01-13 03:41:19,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:41:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2019-01-13 03:41:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2019-01-13 03:41:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2019-01-13 03:41:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2019-01-13 03:41:21,267 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2019-01-13 03:41:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:21,269 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2019-01-13 03:41:21,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:41:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2019-01-13 03:41:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 03:41:21,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:21,283 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:41:21,283 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2019-01-13 03:41:21,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:21,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:21,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:21,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:21,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:21,485 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:41:21,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:21,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:21,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:21,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:21,489 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 5 states. [2019-01-13 03:41:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:24,103 INFO L93 Difference]: Finished difference Result 64831 states and 241370 transitions. [2019-01-13 03:41:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:41:24,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-13 03:41:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:24,434 INFO L225 Difference]: With dead ends: 64831 [2019-01-13 03:41:24,435 INFO L226 Difference]: Without dead ends: 64671 [2019-01-13 03:41:24,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2019-01-13 03:41:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2019-01-13 03:41:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2019-01-13 03:41:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 138285 transitions. [2019-01-13 03:41:26,371 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 138285 transitions. Word has length 45 [2019-01-13 03:41:26,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:26,375 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 138285 transitions. [2019-01-13 03:41:26,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 138285 transitions. [2019-01-13 03:41:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 03:41:26,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:26,386 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] [2019-01-13 03:41:26,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2019-01-13 03:41:26,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:26,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:26,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:26,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:26,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:41:26,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:26,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:26,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:26,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:26,558 INFO L87 Difference]: Start difference. First operand 37143 states and 138285 transitions. Second operand 5 states. [2019-01-13 03:41:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:27,455 INFO L93 Difference]: Finished difference Result 66627 states and 246624 transitions. [2019-01-13 03:41:27,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:41:27,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-01-13 03:41:27,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:27,739 INFO L225 Difference]: With dead ends: 66627 [2019-01-13 03:41:27,740 INFO L226 Difference]: Without dead ends: 66459 [2019-01-13 03:41:27,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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:41:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2019-01-13 03:41:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2019-01-13 03:41:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2019-01-13 03:41:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143993 transitions. [2019-01-13 03:41:29,837 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143993 transitions. Word has length 46 [2019-01-13 03:41:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:29,838 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143993 transitions. [2019-01-13 03:41:29,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143993 transitions. [2019-01-13 03:41:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 03:41:29,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:29,853 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] [2019-01-13 03:41:29,853 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash -921353383, now seen corresponding path program 1 times [2019-01-13 03:41:29,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:29,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:41:30,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:30,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:30,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:30,014 INFO L87 Difference]: Start difference. First operand 38835 states and 143993 transitions. Second operand 6 states. [2019-01-13 03:41:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:31,612 INFO L93 Difference]: Finished difference Result 68209 states and 246840 transitions. [2019-01-13 03:41:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 03:41:31,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 03:41:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:31,789 INFO L225 Difference]: With dead ends: 68209 [2019-01-13 03:41:31,789 INFO L226 Difference]: Without dead ends: 68049 [2019-01-13 03:41:31,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-01-13 03:41:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68049 states. [2019-01-13 03:41:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68049 to 37685. [2019-01-13 03:41:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37685 states. [2019-01-13 03:41:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37685 states to 37685 states and 139753 transitions. [2019-01-13 03:41:33,693 INFO L78 Accepts]: Start accepts. Automaton has 37685 states and 139753 transitions. Word has length 53 [2019-01-13 03:41:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:33,694 INFO L480 AbstractCegarLoop]: Abstraction has 37685 states and 139753 transitions. [2019-01-13 03:41:33,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 37685 states and 139753 transitions. [2019-01-13 03:41:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-13 03:41:33,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:33,732 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] [2019-01-13 03:41:33,733 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash 479415254, now seen corresponding path program 1 times [2019-01-13 03:41:33,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:33,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:33,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:33,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:34,044 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:41:34,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:34,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:34,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:34,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:34,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:34,046 INFO L87 Difference]: Start difference. First operand 37685 states and 139753 transitions. Second operand 6 states. [2019-01-13 03:41:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:35,084 INFO L93 Difference]: Finished difference Result 80345 states and 292574 transitions. [2019-01-13 03:41:35,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:41:35,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-13 03:41:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:35,316 INFO L225 Difference]: With dead ends: 80345 [2019-01-13 03:41:35,316 INFO L226 Difference]: Without dead ends: 80089 [2019-01-13 03:41:35,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:41:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80089 states. [2019-01-13 03:41:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80089 to 44758. [2019-01-13 03:41:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44758 states. [2019-01-13 03:41:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44758 states to 44758 states and 164072 transitions. [2019-01-13 03:41:39,939 INFO L78 Accepts]: Start accepts. Automaton has 44758 states and 164072 transitions. Word has length 60 [2019-01-13 03:41:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:39,939 INFO L480 AbstractCegarLoop]: Abstraction has 44758 states and 164072 transitions. [2019-01-13 03:41:39,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:41:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 44758 states and 164072 transitions. [2019-01-13 03:41:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-13 03:41:39,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:39,975 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] [2019-01-13 03:41:39,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1962483643, now seen corresponding path program 1 times [2019-01-13 03:41:39,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:39,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:39,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:39,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:40,074 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:41:40,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:40,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:41:40,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:41:40,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:41:40,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:41:40,077 INFO L87 Difference]: Start difference. First operand 44758 states and 164072 transitions. Second operand 3 states. [2019-01-13 03:41:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:40,495 INFO L93 Difference]: Finished difference Result 56320 states and 202934 transitions. [2019-01-13 03:41:40,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:41:40,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-01-13 03:41:40,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:40,642 INFO L225 Difference]: With dead ends: 56320 [2019-01-13 03:41:40,642 INFO L226 Difference]: Without dead ends: 56320 [2019-01-13 03:41:40,642 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:41:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56320 states. [2019-01-13 03:41:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56320 to 48991. [2019-01-13 03:41:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48991 states. [2019-01-13 03:41:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48991 states to 48991 states and 178474 transitions. [2019-01-13 03:41:41,734 INFO L78 Accepts]: Start accepts. Automaton has 48991 states and 178474 transitions. Word has length 62 [2019-01-13 03:41:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:41,734 INFO L480 AbstractCegarLoop]: Abstraction has 48991 states and 178474 transitions. [2019-01-13 03:41:41,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:41:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 48991 states and 178474 transitions. [2019-01-13 03:41:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:41:41,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:41,774 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] [2019-01-13 03:41:41,774 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:41,775 INFO L82 PathProgramCache]: Analyzing trace with hash 671786436, now seen corresponding path program 1 times [2019-01-13 03:41:41,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:41,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:41,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:41,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:41,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:42,306 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2019-01-13 03:41:42,322 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:41:42,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:42,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:41:42,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:41:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:41:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:41:42,326 INFO L87 Difference]: Start difference. First operand 48991 states and 178474 transitions. Second operand 5 states. [2019-01-13 03:41:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:44,516 INFO L93 Difference]: Finished difference Result 82728 states and 297581 transitions. [2019-01-13 03:41:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:41:44,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-13 03:41:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:44,752 INFO L225 Difference]: With dead ends: 82728 [2019-01-13 03:41:44,753 INFO L226 Difference]: Without dead ends: 82570 [2019-01-13 03:41:44,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82570 states. [2019-01-13 03:41:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82570 to 75015. [2019-01-13 03:41:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75015 states. [2019-01-13 03:41:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75015 states to 75015 states and 271535 transitions. [2019-01-13 03:41:46,467 INFO L78 Accepts]: Start accepts. Automaton has 75015 states and 271535 transitions. Word has length 66 [2019-01-13 03:41:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:46,467 INFO L480 AbstractCegarLoop]: Abstraction has 75015 states and 271535 transitions. [2019-01-13 03:41:46,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:41:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 75015 states and 271535 transitions. [2019-01-13 03:41:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 03:41:46,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:46,542 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] [2019-01-13 03:41:46,542 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:46,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash 817342501, now seen corresponding path program 1 times [2019-01-13 03:41:46,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:46,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:46,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:46,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:46,876 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:41:46,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:46,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:46,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:46,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:46,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:46,877 INFO L87 Difference]: Start difference. First operand 75015 states and 271535 transitions. Second operand 7 states. [2019-01-13 03:41:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:48,710 INFO L93 Difference]: Finished difference Result 134875 states and 481034 transitions. [2019-01-13 03:41:48,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:41:48,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-01-13 03:41:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:49,073 INFO L225 Difference]: With dead ends: 134875 [2019-01-13 03:41:49,073 INFO L226 Difference]: Without dead ends: 134619 [2019-01-13 03:41:49,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-01-13 03:41:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134619 states. [2019-01-13 03:41:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134619 to 77027. [2019-01-13 03:41:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77027 states. [2019-01-13 03:41:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77027 states to 77027 states and 278041 transitions. [2019-01-13 03:41:52,239 INFO L78 Accepts]: Start accepts. Automaton has 77027 states and 278041 transitions. Word has length 66 [2019-01-13 03:41:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:52,242 INFO L480 AbstractCegarLoop]: Abstraction has 77027 states and 278041 transitions. [2019-01-13 03:41:52,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 77027 states and 278041 transitions. [2019-01-13 03:41:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 03:41:52,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:52,319 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] [2019-01-13 03:41:52,319 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash -911785883, now seen corresponding path program 1 times [2019-01-13 03:41:52,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:52,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:52,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:52,684 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:41:52,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:52,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:41:52,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:41:52,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:41:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:41:52,686 INFO L87 Difference]: Start difference. First operand 77027 states and 278041 transitions. Second operand 7 states. [2019-01-13 03:41:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:54,291 INFO L93 Difference]: Finished difference Result 103020 states and 368719 transitions. [2019-01-13 03:41:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:41:54,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-01-13 03:41:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:54,571 INFO L225 Difference]: With dead ends: 103020 [2019-01-13 03:41:54,571 INFO L226 Difference]: Without dead ends: 102804 [2019-01-13 03:41:54,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-01-13 03:41:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102804 states. [2019-01-13 03:41:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102804 to 77796. [2019-01-13 03:41:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77796 states. [2019-01-13 03:41:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77796 states to 77796 states and 280572 transitions. [2019-01-13 03:41:57,357 INFO L78 Accepts]: Start accepts. Automaton has 77796 states and 280572 transitions. Word has length 67 [2019-01-13 03:41:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:41:57,358 INFO L480 AbstractCegarLoop]: Abstraction has 77796 states and 280572 transitions. [2019-01-13 03:41:57,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:41:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 77796 states and 280572 transitions. [2019-01-13 03:41:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 03:41:57,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:41:57,450 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] [2019-01-13 03:41:57,451 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:41:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:41:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash -140132620, now seen corresponding path program 1 times [2019-01-13 03:41:57,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:41:57,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:41:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:57,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:41:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:41:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:41:57,804 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:41:57,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:41:57,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:41:57,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:41:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:41:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:41:57,806 INFO L87 Difference]: Start difference. First operand 77796 states and 280572 transitions. Second operand 6 states. [2019-01-13 03:41:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:41:58,943 INFO L93 Difference]: Finished difference Result 101531 states and 363932 transitions. [2019-01-13 03:41:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:41:58,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-01-13 03:41:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:41:59,224 INFO L225 Difference]: With dead ends: 101531 [2019-01-13 03:41:59,224 INFO L226 Difference]: Without dead ends: 100339 [2019-01-13 03:41:59,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:41:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100339 states. [2019-01-13 03:42:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100339 to 87851. [2019-01-13 03:42:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87851 states. [2019-01-13 03:42:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87851 states to 87851 states and 317359 transitions. [2019-01-13 03:42:01,173 INFO L78 Accepts]: Start accepts. Automaton has 87851 states and 317359 transitions. Word has length 69 [2019-01-13 03:42:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:01,173 INFO L480 AbstractCegarLoop]: Abstraction has 87851 states and 317359 transitions. [2019-01-13 03:42:01,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 87851 states and 317359 transitions. [2019-01-13 03:42:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 03:42:01,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:01,261 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] [2019-01-13 03:42:01,262 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash -423283084, now seen corresponding path program 1 times [2019-01-13 03:42:01,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:01,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:01,539 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:42:01,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:01,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:01,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:01,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:01,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:01,540 INFO L87 Difference]: Start difference. First operand 87851 states and 317359 transitions. Second operand 7 states. [2019-01-13 03:42:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:03,236 INFO L93 Difference]: Finished difference Result 117958 states and 415823 transitions. [2019-01-13 03:42:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 03:42:03,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-01-13 03:42:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:03,588 INFO L225 Difference]: With dead ends: 117958 [2019-01-13 03:42:03,588 INFO L226 Difference]: Without dead ends: 117958 [2019-01-13 03:42:03,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:42:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117958 states. [2019-01-13 03:42:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117958 to 108488. [2019-01-13 03:42:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108488 states. [2019-01-13 03:42:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108488 states to 108488 states and 385701 transitions. [2019-01-13 03:42:06,687 INFO L78 Accepts]: Start accepts. Automaton has 108488 states and 385701 transitions. Word has length 69 [2019-01-13 03:42:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:06,688 INFO L480 AbstractCegarLoop]: Abstraction has 108488 states and 385701 transitions. [2019-01-13 03:42:06,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 108488 states and 385701 transitions. [2019-01-13 03:42:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-13 03:42:06,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:06,810 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] [2019-01-13 03:42:06,811 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash 821481397, now seen corresponding path program 1 times [2019-01-13 03:42:06,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:06,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:06,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:06,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:06,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:06,969 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:42:06,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:06,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:06,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:06,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:06,971 INFO L87 Difference]: Start difference. First operand 108488 states and 385701 transitions. Second operand 4 states. [2019-01-13 03:42:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:07,436 INFO L93 Difference]: Finished difference Result 33337 states and 107663 transitions. [2019-01-13 03:42:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:07,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-01-13 03:42:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:07,533 INFO L225 Difference]: With dead ends: 33337 [2019-01-13 03:42:07,533 INFO L226 Difference]: Without dead ends: 32796 [2019-01-13 03:42:07,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32796 states. [2019-01-13 03:42:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32796 to 32784. [2019-01-13 03:42:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32784 states. [2019-01-13 03:42:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32784 states to 32784 states and 106019 transitions. [2019-01-13 03:42:08,105 INFO L78 Accepts]: Start accepts. Automaton has 32784 states and 106019 transitions. Word has length 69 [2019-01-13 03:42:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:08,105 INFO L480 AbstractCegarLoop]: Abstraction has 32784 states and 106019 transitions. [2019-01-13 03:42:08,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 32784 states and 106019 transitions. [2019-01-13 03:42:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 03:42:08,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:08,140 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:42:08,140 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash -228550946, now seen corresponding path program 1 times [2019-01-13 03:42:08,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:08,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:08,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:08,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:08,300 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:42:08,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:08,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:08,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:08,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:08,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:08,301 INFO L87 Difference]: Start difference. First operand 32784 states and 106019 transitions. Second operand 4 states. [2019-01-13 03:42:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:08,717 INFO L93 Difference]: Finished difference Result 41168 states and 131730 transitions. [2019-01-13 03:42:08,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:08,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-01-13 03:42:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:08,804 INFO L225 Difference]: With dead ends: 41168 [2019-01-13 03:42:08,804 INFO L226 Difference]: Without dead ends: 41168 [2019-01-13 03:42:08,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41168 states. [2019-01-13 03:42:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41168 to 33984. [2019-01-13 03:42:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33984 states. [2019-01-13 03:42:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33984 states to 33984 states and 109618 transitions. [2019-01-13 03:42:09,385 INFO L78 Accepts]: Start accepts. Automaton has 33984 states and 109618 transitions. Word has length 79 [2019-01-13 03:42:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:09,385 INFO L480 AbstractCegarLoop]: Abstraction has 33984 states and 109618 transitions. [2019-01-13 03:42:09,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 33984 states and 109618 transitions. [2019-01-13 03:42:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-13 03:42:09,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:09,417 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:42:09,418 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -483287491, now seen corresponding path program 1 times [2019-01-13 03:42:09,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:09,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:09,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:09,764 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:42:09,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:09,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:42:09,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:42:09,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:42:09,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:42:09,766 INFO L87 Difference]: Start difference. First operand 33984 states and 109618 transitions. Second operand 10 states. [2019-01-13 03:42:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:12,871 INFO L93 Difference]: Finished difference Result 42536 states and 133856 transitions. [2019-01-13 03:42:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-13 03:42:12,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-01-13 03:42:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:12,946 INFO L225 Difference]: With dead ends: 42536 [2019-01-13 03:42:12,946 INFO L226 Difference]: Without dead ends: 42472 [2019-01-13 03:42:12,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 03:42:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42472 states. [2019-01-13 03:42:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42472 to 30432. [2019-01-13 03:42:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30432 states. [2019-01-13 03:42:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30432 states to 30432 states and 98034 transitions. [2019-01-13 03:42:13,884 INFO L78 Accepts]: Start accepts. Automaton has 30432 states and 98034 transitions. Word has length 79 [2019-01-13 03:42:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:13,884 INFO L480 AbstractCegarLoop]: Abstraction has 30432 states and 98034 transitions. [2019-01-13 03:42:13,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:42:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 30432 states and 98034 transitions. [2019-01-13 03:42:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 03:42:13,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:13,917 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:42:13,918 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash 509727806, now seen corresponding path program 1 times [2019-01-13 03:42:13,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:13,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:13,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:14,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:42:14,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:14,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:42:14,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:42:14,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:42:14,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:14,016 INFO L87 Difference]: Start difference. First operand 30432 states and 98034 transitions. Second operand 3 states. [2019-01-13 03:42:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:14,461 INFO L93 Difference]: Finished difference Result 32782 states and 105178 transitions. [2019-01-13 03:42:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:42:14,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-01-13 03:42:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:14,520 INFO L225 Difference]: With dead ends: 32782 [2019-01-13 03:42:14,520 INFO L226 Difference]: Without dead ends: 32782 [2019-01-13 03:42:14,521 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:42:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32782 states. [2019-01-13 03:42:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32782 to 31588. [2019-01-13 03:42:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31588 states. [2019-01-13 03:42:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31588 states to 31588 states and 101554 transitions. [2019-01-13 03:42:15,019 INFO L78 Accepts]: Start accepts. Automaton has 31588 states and 101554 transitions. Word has length 80 [2019-01-13 03:42:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:15,019 INFO L480 AbstractCegarLoop]: Abstraction has 31588 states and 101554 transitions. [2019-01-13 03:42:15,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:42:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31588 states and 101554 transitions. [2019-01-13 03:42:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:42:15,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:15,052 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:42:15,053 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:15,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:15,053 INFO L82 PathProgramCache]: Analyzing trace with hash 723145821, now seen corresponding path program 1 times [2019-01-13 03:42:15,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:15,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:15,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:15,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:15,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:15,308 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:42:15,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:15,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 03:42:15,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 03:42:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 03:42:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:15,309 INFO L87 Difference]: Start difference. First operand 31588 states and 101554 transitions. Second operand 4 states. [2019-01-13 03:42:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:15,808 INFO L93 Difference]: Finished difference Result 37254 states and 118412 transitions. [2019-01-13 03:42:15,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:42:15,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-01-13 03:42:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:15,879 INFO L225 Difference]: With dead ends: 37254 [2019-01-13 03:42:15,879 INFO L226 Difference]: Without dead ends: 37190 [2019-01-13 03:42:15,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 03:42:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37190 states. [2019-01-13 03:42:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37190 to 35586. [2019-01-13 03:42:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35586 states. [2019-01-13 03:42:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35586 states to 35586 states and 113597 transitions. [2019-01-13 03:42:16,476 INFO L78 Accepts]: Start accepts. Automaton has 35586 states and 113597 transitions. Word has length 81 [2019-01-13 03:42:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:16,477 INFO L480 AbstractCegarLoop]: Abstraction has 35586 states and 113597 transitions. [2019-01-13 03:42:16,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 03:42:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35586 states and 113597 transitions. [2019-01-13 03:42:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 03:42:16,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:16,515 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:42:16,516 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1212514466, now seen corresponding path program 1 times [2019-01-13 03:42:16,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:16,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:16,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:16,656 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:42:16,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 03:42:16,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 03:42:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 03:42:16,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:16,657 INFO L87 Difference]: Start difference. First operand 35586 states and 113597 transitions. Second operand 3 states. [2019-01-13 03:42:17,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:17,037 INFO L93 Difference]: Finished difference Result 38016 states and 120971 transitions. [2019-01-13 03:42:17,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 03:42:17,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-01-13 03:42:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:17,104 INFO L225 Difference]: With dead ends: 38016 [2019-01-13 03:42:17,104 INFO L226 Difference]: Without dead ends: 38016 [2019-01-13 03:42:17,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 03:42:17,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38016 states. [2019-01-13 03:42:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38016 to 36812. [2019-01-13 03:42:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36812 states. [2019-01-13 03:42:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36812 states to 36812 states and 117311 transitions. [2019-01-13 03:42:17,668 INFO L78 Accepts]: Start accepts. Automaton has 36812 states and 117311 transitions. Word has length 81 [2019-01-13 03:42:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:17,668 INFO L480 AbstractCegarLoop]: Abstraction has 36812 states and 117311 transitions. [2019-01-13 03:42:17,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 03:42:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36812 states and 117311 transitions. [2019-01-13 03:42:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:42:17,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:17,708 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] [2019-01-13 03:42:17,708 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1773086822, now seen corresponding path program 1 times [2019-01-13 03:42:17,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:17,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:17,909 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:42:17,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:17,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:17,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:17,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:17,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:17,910 INFO L87 Difference]: Start difference. First operand 36812 states and 117311 transitions. Second operand 6 states. [2019-01-13 03:42:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:18,906 INFO L93 Difference]: Finished difference Result 51980 states and 162835 transitions. [2019-01-13 03:42:18,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:42:18,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-01-13 03:42:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:19,005 INFO L225 Difference]: With dead ends: 51980 [2019-01-13 03:42:19,005 INFO L226 Difference]: Without dead ends: 51352 [2019-01-13 03:42:19,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:42:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51352 states. [2019-01-13 03:42:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51352 to 40520. [2019-01-13 03:42:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40520 states. [2019-01-13 03:42:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40520 states to 40520 states and 129212 transitions. [2019-01-13 03:42:19,722 INFO L78 Accepts]: Start accepts. Automaton has 40520 states and 129212 transitions. Word has length 82 [2019-01-13 03:42:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:19,723 INFO L480 AbstractCegarLoop]: Abstraction has 40520 states and 129212 transitions. [2019-01-13 03:42:19,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 40520 states and 129212 transitions. [2019-01-13 03:42:19,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:42:19,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:19,768 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] [2019-01-13 03:42:19,769 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1489936358, now seen corresponding path program 1 times [2019-01-13 03:42:19,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:19,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:19,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:19,949 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:42:19,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:19,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:19,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:19,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:19,951 INFO L87 Difference]: Start difference. First operand 40520 states and 129212 transitions. Second operand 7 states. [2019-01-13 03:42:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:21,333 INFO L93 Difference]: Finished difference Result 66300 states and 204819 transitions. [2019-01-13 03:42:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 03:42:21,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-01-13 03:42:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:21,487 INFO L225 Difference]: With dead ends: 66300 [2019-01-13 03:42:21,487 INFO L226 Difference]: Without dead ends: 66188 [2019-01-13 03:42:21,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-01-13 03:42:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66188 states. [2019-01-13 03:42:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66188 to 42493. [2019-01-13 03:42:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42493 states. [2019-01-13 03:42:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42493 states to 42493 states and 133441 transitions. [2019-01-13 03:42:22,697 INFO L78 Accepts]: Start accepts. Automaton has 42493 states and 133441 transitions. Word has length 82 [2019-01-13 03:42:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:22,697 INFO L480 AbstractCegarLoop]: Abstraction has 42493 states and 133441 transitions. [2019-01-13 03:42:22,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 42493 states and 133441 transitions. [2019-01-13 03:42:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:42:22,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:22,743 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] [2019-01-13 03:42:22,744 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1230500696, now seen corresponding path program 1 times [2019-01-13 03:42:22,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:22,930 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:42:22,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:22,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:22,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:22,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:22,931 INFO L87 Difference]: Start difference. First operand 42493 states and 133441 transitions. Second operand 7 states. [2019-01-13 03:42:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:24,270 INFO L93 Difference]: Finished difference Result 78553 states and 242987 transitions. [2019-01-13 03:42:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 03:42:24,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-01-13 03:42:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:24,437 INFO L225 Difference]: With dead ends: 78553 [2019-01-13 03:42:24,438 INFO L226 Difference]: Without dead ends: 77625 [2019-01-13 03:42:24,438 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:42:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77625 states. [2019-01-13 03:42:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77625 to 45654. [2019-01-13 03:42:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45654 states. [2019-01-13 03:42:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45654 states to 45654 states and 142939 transitions. [2019-01-13 03:42:25,373 INFO L78 Accepts]: Start accepts. Automaton has 45654 states and 142939 transitions. Word has length 82 [2019-01-13 03:42:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:25,373 INFO L480 AbstractCegarLoop]: Abstraction has 45654 states and 142939 transitions. [2019-01-13 03:42:25,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 45654 states and 142939 transitions. [2019-01-13 03:42:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:42:25,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:25,419 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] [2019-01-13 03:42:25,419 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1180169000, now seen corresponding path program 1 times [2019-01-13 03:42:25,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:25,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:25,651 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:42:25,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:25,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:42:25,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:42:25,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:42:25,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:25,652 INFO L87 Difference]: Start difference. First operand 45654 states and 142939 transitions. Second operand 8 states. [2019-01-13 03:42:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:27,906 INFO L93 Difference]: Finished difference Result 68585 states and 208881 transitions. [2019-01-13 03:42:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 03:42:27,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-13 03:42:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:28,060 INFO L225 Difference]: With dead ends: 68585 [2019-01-13 03:42:28,060 INFO L226 Difference]: Without dead ends: 67769 [2019-01-13 03:42:28,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-01-13 03:42:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67769 states. [2019-01-13 03:42:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67769 to 44212. [2019-01-13 03:42:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44212 states. [2019-01-13 03:42:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44212 states to 44212 states and 138022 transitions. [2019-01-13 03:42:28,996 INFO L78 Accepts]: Start accepts. Automaton has 44212 states and 138022 transitions. Word has length 82 [2019-01-13 03:42:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:28,997 INFO L480 AbstractCegarLoop]: Abstraction has 44212 states and 138022 transitions. [2019-01-13 03:42:28,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:42:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 44212 states and 138022 transitions. [2019-01-13 03:42:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:42:29,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:29,042 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] [2019-01-13 03:42:29,043 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2141783017, now seen corresponding path program 1 times [2019-01-13 03:42:29,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:29,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:29,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:29,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:29,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:30,221 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:42:30,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:30,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:42:30,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:42:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:42:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:30,225 INFO L87 Difference]: Start difference. First operand 44212 states and 138022 transitions. Second operand 8 states. [2019-01-13 03:42:30,859 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 03:42:31,242 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 03:42:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:33,056 INFO L93 Difference]: Finished difference Result 55748 states and 171883 transitions. [2019-01-13 03:42:33,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 03:42:33,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-01-13 03:42:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:33,164 INFO L225 Difference]: With dead ends: 55748 [2019-01-13 03:42:33,164 INFO L226 Difference]: Without dead ends: 55748 [2019-01-13 03:42:33,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:42:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55748 states. [2019-01-13 03:42:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55748 to 38956. [2019-01-13 03:42:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38956 states. [2019-01-13 03:42:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38956 states to 38956 states and 121772 transitions. [2019-01-13 03:42:34,224 INFO L78 Accepts]: Start accepts. Automaton has 38956 states and 121772 transitions. Word has length 82 [2019-01-13 03:42:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:34,225 INFO L480 AbstractCegarLoop]: Abstraction has 38956 states and 121772 transitions. [2019-01-13 03:42:34,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:42:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38956 states and 121772 transitions. [2019-01-13 03:42:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:42:34,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:34,264 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] [2019-01-13 03:42:34,264 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:34,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1672467863, now seen corresponding path program 1 times [2019-01-13 03:42:34,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:34,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:34,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:34,497 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:42:34,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:34,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 03:42:34,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 03:42:34,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 03:42:34,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 03:42:34,499 INFO L87 Difference]: Start difference. First operand 38956 states and 121772 transitions. Second operand 9 states. [2019-01-13 03:42:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:36,882 INFO L93 Difference]: Finished difference Result 56356 states and 171062 transitions. [2019-01-13 03:42:36,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:42:36,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-01-13 03:42:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:37,012 INFO L225 Difference]: With dead ends: 56356 [2019-01-13 03:42:37,012 INFO L226 Difference]: Without dead ends: 56356 [2019-01-13 03:42:37,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-01-13 03:42:37,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56356 states. [2019-01-13 03:42:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56356 to 42032. [2019-01-13 03:42:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42032 states. [2019-01-13 03:42:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42032 states to 42032 states and 130931 transitions. [2019-01-13 03:42:37,807 INFO L78 Accepts]: Start accepts. Automaton has 42032 states and 130931 transitions. Word has length 82 [2019-01-13 03:42:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:37,807 INFO L480 AbstractCegarLoop]: Abstraction has 42032 states and 130931 transitions. [2019-01-13 03:42:37,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 03:42:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 42032 states and 130931 transitions. [2019-01-13 03:42:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 03:42:37,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:37,848 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] [2019-01-13 03:42:37,848 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:37,848 INFO L82 PathProgramCache]: Analyzing trace with hash -427703382, now seen corresponding path program 1 times [2019-01-13 03:42:37,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:37,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:37,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:38,099 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:42:38,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:38,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:38,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:38,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:38,101 INFO L87 Difference]: Start difference. First operand 42032 states and 130931 transitions. Second operand 5 states. [2019-01-13 03:42:38,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:38,186 INFO L93 Difference]: Finished difference Result 5368 states and 13973 transitions. [2019-01-13 03:42:38,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:42:38,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-01-13 03:42:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:38,193 INFO L225 Difference]: With dead ends: 5368 [2019-01-13 03:42:38,194 INFO L226 Difference]: Without dead ends: 4792 [2019-01-13 03:42:38,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2019-01-13 03:42:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4628. [2019-01-13 03:42:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4628 states. [2019-01-13 03:42:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 12093 transitions. [2019-01-13 03:42:38,249 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 12093 transitions. Word has length 82 [2019-01-13 03:42:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:38,249 INFO L480 AbstractCegarLoop]: Abstraction has 4628 states and 12093 transitions. [2019-01-13 03:42:38,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 12093 transitions. [2019-01-13 03:42:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:42:38,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:38,258 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] [2019-01-13 03:42:38,258 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash -365297887, now seen corresponding path program 1 times [2019-01-13 03:42:38,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:38,441 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:42:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:38,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:38,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:38,442 INFO L87 Difference]: Start difference. First operand 4628 states and 12093 transitions. Second operand 5 states. [2019-01-13 03:42:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:38,676 INFO L93 Difference]: Finished difference Result 5272 states and 13634 transitions. [2019-01-13 03:42:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 03:42:38,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:42:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:38,685 INFO L225 Difference]: With dead ends: 5272 [2019-01-13 03:42:38,685 INFO L226 Difference]: Without dead ends: 5272 [2019-01-13 03:42:38,685 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:42:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2019-01-13 03:42:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 4680. [2019-01-13 03:42:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-01-13 03:42:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 12205 transitions. [2019-01-13 03:42:38,740 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 12205 transitions. Word has length 94 [2019-01-13 03:42:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:38,740 INFO L480 AbstractCegarLoop]: Abstraction has 4680 states and 12205 transitions. [2019-01-13 03:42:38,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 12205 transitions. [2019-01-13 03:42:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:42:38,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 03:42:38,746 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:38,746 INFO L82 PathProgramCache]: Analyzing trace with hash 804370255, now seen corresponding path program 1 times [2019-01-13 03:42:38,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:38,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:38,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:38,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:38,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 03:42:38,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:38,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:38,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:38,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:38,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:38,926 INFO L87 Difference]: Start difference. First operand 4680 states and 12205 transitions. Second operand 6 states. [2019-01-13 03:42:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:39,328 INFO L93 Difference]: Finished difference Result 4961 states and 12756 transitions. [2019-01-13 03:42:39,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:39,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:42:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:39,337 INFO L225 Difference]: With dead ends: 4961 [2019-01-13 03:42:39,337 INFO L226 Difference]: Without dead ends: 4924 [2019-01-13 03:42:39,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2019-01-13 03:42:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4854. [2019-01-13 03:42:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4854 states. [2019-01-13 03:42:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 12556 transitions. [2019-01-13 03:42:39,395 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 12556 transitions. Word has length 94 [2019-01-13 03:42:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:39,395 INFO L480 AbstractCegarLoop]: Abstraction has 4854 states and 12556 transitions. [2019-01-13 03:42:39,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 12556 transitions. [2019-01-13 03:42:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:42:39,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:39,401 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] [2019-01-13 03:42:39,401 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:39,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1789856562, now seen corresponding path program 1 times [2019-01-13 03:42:39,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:39,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:39,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:39,570 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:42:39,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:39,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 03:42:39,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 03:42:39,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 03:42:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:39,571 INFO L87 Difference]: Start difference. First operand 4854 states and 12556 transitions. Second operand 7 states. [2019-01-13 03:42:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:39,904 INFO L93 Difference]: Finished difference Result 5098 states and 13143 transitions. [2019-01-13 03:42:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:39,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-01-13 03:42:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:39,914 INFO L225 Difference]: With dead ends: 5098 [2019-01-13 03:42:39,914 INFO L226 Difference]: Without dead ends: 5098 [2019-01-13 03:42:39,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2019-01-13 03:42:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4836. [2019-01-13 03:42:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4836 states. [2019-01-13 03:42:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 12519 transitions. [2019-01-13 03:42:39,978 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 12519 transitions. Word has length 94 [2019-01-13 03:42:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:39,978 INFO L480 AbstractCegarLoop]: Abstraction has 4836 states and 12519 transitions. [2019-01-13 03:42:39,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 03:42:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 12519 transitions. [2019-01-13 03:42:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:42:39,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:39,985 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] [2019-01-13 03:42:39,985 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:39,986 INFO L82 PathProgramCache]: Analyzing trace with hash -378977042, now seen corresponding path program 1 times [2019-01-13 03:42:39,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:39,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:39,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:39,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:40,142 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:42:40,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:40,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:40,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:40,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:40,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:40,144 INFO L87 Difference]: Start difference. First operand 4836 states and 12519 transitions. Second operand 5 states. [2019-01-13 03:42:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:40,394 INFO L93 Difference]: Finished difference Result 9965 states and 25923 transitions. [2019-01-13 03:42:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:40,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:42:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:40,409 INFO L225 Difference]: With dead ends: 9965 [2019-01-13 03:42:40,409 INFO L226 Difference]: Without dead ends: 9965 [2019-01-13 03:42:40,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2019-01-13 03:42:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 4910. [2019-01-13 03:42:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2019-01-13 03:42:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 12681 transitions. [2019-01-13 03:42:40,489 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 12681 transitions. Word has length 94 [2019-01-13 03:42:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:40,489 INFO L480 AbstractCegarLoop]: Abstraction has 4910 states and 12681 transitions. [2019-01-13 03:42:40,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 12681 transitions. [2019-01-13 03:42:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:42:40,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:40,495 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] [2019-01-13 03:42:40,495 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash -984252051, now seen corresponding path program 1 times [2019-01-13 03:42:40,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:40,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:40,678 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:42:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:40,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:40,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:40,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:40,679 INFO L87 Difference]: Start difference. First operand 4910 states and 12681 transitions. Second operand 5 states. [2019-01-13 03:42:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:40,818 INFO L93 Difference]: Finished difference Result 4892 states and 12592 transitions. [2019-01-13 03:42:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 03:42:40,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-01-13 03:42:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:40,828 INFO L225 Difference]: With dead ends: 4892 [2019-01-13 03:42:40,828 INFO L226 Difference]: Without dead ends: 4892 [2019-01-13 03:42:40,828 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:42:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4892 states. [2019-01-13 03:42:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4892 to 4892. [2019-01-13 03:42:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4892 states. [2019-01-13 03:42:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 12592 transitions. [2019-01-13 03:42:40,886 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 12592 transitions. Word has length 94 [2019-01-13 03:42:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:40,886 INFO L480 AbstractCegarLoop]: Abstraction has 4892 states and 12592 transitions. [2019-01-13 03:42:40,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 12592 transitions. [2019-01-13 03:42:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 03:42:40,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:40,892 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] [2019-01-13 03:42:40,892 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2053095252, now seen corresponding path program 1 times [2019-01-13 03:42:40,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:41,060 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:42:41,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:41,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 03:42:41,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 03:42:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 03:42:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:41,062 INFO L87 Difference]: Start difference. First operand 4892 states and 12592 transitions. Second operand 6 states. [2019-01-13 03:42:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:41,269 INFO L93 Difference]: Finished difference Result 3980 states and 9848 transitions. [2019-01-13 03:42:41,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 03:42:41,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 03:42:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:41,277 INFO L225 Difference]: With dead ends: 3980 [2019-01-13 03:42:41,278 INFO L226 Difference]: Without dead ends: 3980 [2019-01-13 03:42:41,278 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:42:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3980 states. [2019-01-13 03:42:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3980 to 3058. [2019-01-13 03:42:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2019-01-13 03:42:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 7642 transitions. [2019-01-13 03:42:41,320 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 7642 transitions. Word has length 94 [2019-01-13 03:42:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:41,321 INFO L480 AbstractCegarLoop]: Abstraction has 3058 states and 7642 transitions. [2019-01-13 03:42:41,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 03:42:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 7642 transitions. [2019-01-13 03:42:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:42:41,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:41,325 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, 1] [2019-01-13 03:42:41,325 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:41,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:41,326 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2019-01-13 03:42:41,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:41,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:41,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:41,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:41,694 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:42:41,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:41,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 03:42:41,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 03:42:41,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 03:42:41,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 03:42:41,696 INFO L87 Difference]: Start difference. First operand 3058 states and 7642 transitions. Second operand 8 states. [2019-01-13 03:42:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:42,400 INFO L93 Difference]: Finished difference Result 7304 states and 18412 transitions. [2019-01-13 03:42:42,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 03:42:42,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-01-13 03:42:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:42,413 INFO L225 Difference]: With dead ends: 7304 [2019-01-13 03:42:42,413 INFO L226 Difference]: Without dead ends: 7272 [2019-01-13 03:42:42,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-01-13 03:42:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2019-01-13 03:42:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 3769. [2019-01-13 03:42:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2019-01-13 03:42:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 9361 transitions. [2019-01-13 03:42:42,481 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 9361 transitions. Word has length 96 [2019-01-13 03:42:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:42,481 INFO L480 AbstractCegarLoop]: Abstraction has 3769 states and 9361 transitions. [2019-01-13 03:42:42,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 03:42:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 9361 transitions. [2019-01-13 03:42:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:42:42,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:42,487 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, 1] [2019-01-13 03:42:42,487 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2019-01-13 03:42:42,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:42,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:42,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:42,992 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2019-01-13 03:42:43,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:42:43,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:43,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:43,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:43,079 INFO L87 Difference]: Start difference. First operand 3769 states and 9361 transitions. Second operand 5 states. [2019-01-13 03:42:43,400 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-13 03:42:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:43,438 INFO L93 Difference]: Finished difference Result 5639 states and 14350 transitions. [2019-01-13 03:42:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 03:42:43,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-13 03:42:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:43,446 INFO L225 Difference]: With dead ends: 5639 [2019-01-13 03:42:43,446 INFO L226 Difference]: Without dead ends: 5639 [2019-01-13 03:42:43,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 03:42:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2019-01-13 03:42:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 3550. [2019-01-13 03:42:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2019-01-13 03:42:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 8862 transitions. [2019-01-13 03:42:43,496 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 8862 transitions. Word has length 96 [2019-01-13 03:42:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:43,497 INFO L480 AbstractCegarLoop]: Abstraction has 3550 states and 8862 transitions. [2019-01-13 03:42:43,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 8862 transitions. [2019-01-13 03:42:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:42:43,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:43,501 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, 1] [2019-01-13 03:42:43,502 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:43,502 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2019-01-13 03:42:43,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:43,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:43,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:43,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:43,878 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:42:43,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:43,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 03:42:43,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 03:42:43,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 03:42:43,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 03:42:43,880 INFO L87 Difference]: Start difference. First operand 3550 states and 8862 transitions. Second operand 5 states. [2019-01-13 03:42:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:44,311 INFO L93 Difference]: Finished difference Result 3998 states and 9966 transitions. [2019-01-13 03:42:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 03:42:44,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-01-13 03:42:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:44,318 INFO L225 Difference]: With dead ends: 3998 [2019-01-13 03:42:44,318 INFO L226 Difference]: Without dead ends: 3966 [2019-01-13 03:42:44,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 03:42:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2019-01-13 03:42:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3046. [2019-01-13 03:42:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2019-01-13 03:42:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 7608 transitions. [2019-01-13 03:42:44,357 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 7608 transitions. Word has length 96 [2019-01-13 03:42:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:44,358 INFO L480 AbstractCegarLoop]: Abstraction has 3046 states and 7608 transitions. [2019-01-13 03:42:44,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 03:42:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 7608 transitions. [2019-01-13 03:42:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:42:44,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:44,362 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, 1] [2019-01-13 03:42:44,362 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2019-01-13 03:42:44,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:44,623 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 03:42:44,700 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:42:44,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:44,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 03:42:44,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 03:42:44,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 03:42:44,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 03:42:44,702 INFO L87 Difference]: Start difference. First operand 3046 states and 7608 transitions. Second operand 10 states. [2019-01-13 03:42:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:45,275 INFO L93 Difference]: Finished difference Result 5121 states and 12979 transitions. [2019-01-13 03:42:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 03:42:45,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-01-13 03:42:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:45,280 INFO L225 Difference]: With dead ends: 5121 [2019-01-13 03:42:45,280 INFO L226 Difference]: Without dead ends: 2051 [2019-01-13 03:42:45,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-13 03:42:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2019-01-13 03:42:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2051. [2019-01-13 03:42:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2019-01-13 03:42:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 5303 transitions. [2019-01-13 03:42:45,302 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 5303 transitions. Word has length 96 [2019-01-13 03:42:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:45,303 INFO L480 AbstractCegarLoop]: Abstraction has 2051 states and 5303 transitions. [2019-01-13 03:42:45,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 03:42:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 5303 transitions. [2019-01-13 03:42:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:42:45,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:45,306 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, 1] [2019-01-13 03:42:45,306 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2019-01-13 03:42:45,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:45,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:45,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 03:42:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 03:42:45,530 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:42:45,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 03:42:45,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 03:42:45,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 03:42:45,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 03:42:45,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-13 03:42:45,531 INFO L87 Difference]: Start difference. First operand 2051 states and 5303 transitions. Second operand 12 states. [2019-01-13 03:42:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 03:42:46,320 INFO L93 Difference]: Finished difference Result 3882 states and 10151 transitions. [2019-01-13 03:42:46,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-13 03:42:46,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-01-13 03:42:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 03:42:46,326 INFO L225 Difference]: With dead ends: 3882 [2019-01-13 03:42:46,326 INFO L226 Difference]: Without dead ends: 2746 [2019-01-13 03:42:46,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2019-01-13 03:42:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2019-01-13 03:42:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2580. [2019-01-13 03:42:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2019-01-13 03:42:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 6543 transitions. [2019-01-13 03:42:46,354 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 6543 transitions. Word has length 96 [2019-01-13 03:42:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 03:42:46,354 INFO L480 AbstractCegarLoop]: Abstraction has 2580 states and 6543 transitions. [2019-01-13 03:42:46,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 03:42:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 6543 transitions. [2019-01-13 03:42:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-13 03:42:46,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 03:42:46,357 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, 1] [2019-01-13 03:42:46,358 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 03:42:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 03:42:46,358 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2019-01-13 03:42:46,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 03:42:46,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 03:42:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:46,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 03:42:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 03:42:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:42:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 03:42:46,446 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 03:42:46,611 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 03:42:46,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 03:42:46 BasicIcfg [2019-01-13 03:42:46,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 03:42:46,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 03:42:46,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 03:42:46,615 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 03:42:46,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 03:41:15" (3/4) ... [2019-01-13 03:42:46,621 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 03:42:46,802 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 03:42:46,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 03:42:46,804 INFO L168 Benchmark]: Toolchain (without parser) took 93101.45 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 940.6 MB in the beginning and 1.6 GB in the end (delta: -622.7 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-01-13 03:42:46,806 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 03:42:46,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-13 03:42:46,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.56 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 03:42:46,807 INFO L168 Benchmark]: Boogie Preprocessor took 40.12 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:42:46,810 INFO L168 Benchmark]: RCFGBuilder took 1172.31 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2019-01-13 03:42:46,810 INFO L168 Benchmark]: TraceAbstraction took 90755.28 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -573.2 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-01-13 03:42:46,811 INFO L168 Benchmark]: Witness Printer took 188.65 ms. Allocated memory is still 5.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2019-01-13 03:42:46,815 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 856.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.56 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.12 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 1172.31 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 90755.28 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -573.2 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 188.65 ms. Allocated memory is still 5.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -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, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L698] -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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] -1 pthread_t t1613; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1613, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1614; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1614, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L786] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L787] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L788] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 90.6s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 41.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11109 SDtfs, 13175 SDslu, 30919 SDs, 0 SdLazy, 15359 SolverSat, 819 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 115 SyntacticMatches, 26 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108488occurred in iteration=11, 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: 35.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 415407 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 2824 NumberOfCodeBlocks, 2824 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2693 ConstructedInterpolants, 0 QuantifiedInterpolants, 513080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...