./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer --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 38746a35588728e2d7ff474f85640a9981680619 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-02 12:35:44,946 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:35:44,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:35:44,955 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:35:44,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:35:44,956 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:35:44,957 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:35:44,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:35:44,960 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:35:44,961 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:35:44,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:35:44,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:35:44,962 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:35:44,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:35:44,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:35:44,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:35:44,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:35:44,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:35:44,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:35:44,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:35:44,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:35:44,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:35:44,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:35:44,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:35:44,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:35:44,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:35:44,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:35:44,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:35:44,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:35:44,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:35:44,975 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:35:44,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:35:44,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:35:44,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:35:44,976 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:35:44,976 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:35:44,977 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 12:35:44,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:35:44,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:35:44,984 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:35:44,984 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:35:44,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 12:35:44,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:35:44,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:35:44,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:35:44,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:35:44,986 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 12:35:44,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:35:44,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:35:44,987 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer 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 -> 38746a35588728e2d7ff474f85640a9981680619 [2018-12-02 12:35:45,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:35:45,013 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:35:45,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:35:45,016 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:35:45,016 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:35:45,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix042_power.opt_false-unreach-call.i [2018-12-02 12:35:45,056 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/data/8905bb700/fed981bcffca4cc88a3a610ac4a7d8eb/FLAG2606437a6 [2018-12-02 12:35:45,509 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:35:45,509 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/sv-benchmarks/c/pthread-wmm/mix042_power.opt_false-unreach-call.i [2018-12-02 12:35:45,516 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/data/8905bb700/fed981bcffca4cc88a3a610ac4a7d8eb/FLAG2606437a6 [2018-12-02 12:35:45,524 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/data/8905bb700/fed981bcffca4cc88a3a610ac4a7d8eb [2018-12-02 12:35:45,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:35:45,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:35:45,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:35:45,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:35:45,529 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:35:45,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45, skipping insertion in model container [2018-12-02 12:35:45,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:35:45,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:35:45,734 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:35:45,742 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:35:45,815 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:35:45,846 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:35:45,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45 WrapperNode [2018-12-02 12:35:45,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:35:45,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:35:45,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:35:45,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:35:45,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:35:45,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:35:45,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:35:45,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:35:45,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... [2018-12-02 12:35:45,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:35:45,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:35:45,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:35:45,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:35:45,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/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 [2018-12-02 12:35:45,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:35:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:35:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:35:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:35:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:35:45,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:35:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:35:45,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:35:45,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 12:35:45,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 12:35:45,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:35:45,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:35:45,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:35:45,937 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 12:35:46,258 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:35:46,258 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:35:46,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:35:46 BoogieIcfgContainer [2018-12-02 12:35:46,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:35:46,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:35:46,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:35:46,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:35:46,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:35:45" (1/3) ... [2018-12-02 12:35:46,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c378619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:35:46, skipping insertion in model container [2018-12-02 12:35:46,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:45" (2/3) ... [2018-12-02 12:35:46,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c378619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:35:46, skipping insertion in model container [2018-12-02 12:35:46,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:35:46" (3/3) ... [2018-12-02 12:35:46,265 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_power.opt_false-unreach-call.i [2018-12-02 12:35:46,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,288 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,288 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,288 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,289 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,289 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,290 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,290 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,290 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,291 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,292 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,293 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,294 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,295 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,295 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,295 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,295 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,295 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,296 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,296 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,297 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,298 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,299 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,300 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:46,306 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:35:46,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:35:46,312 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:35:46,321 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:35:46,340 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:35:46,341 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:35:46,341 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:35:46,341 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:35:46,341 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:35:46,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:35:46,342 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:35:46,342 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:35:46,342 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:35:46,352 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-02 12:35:59,432 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-02 12:35:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-02 12:35:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 12:35:59,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:35:59,441 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] [2018-12-02 12:35:59,442 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:35:59,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:35:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-02 12:35:59,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:35:59,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:35:59,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:35:59,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:35:59,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:35:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:35:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:35:59,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:35:59,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:35:59,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:35:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:35:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:35:59,610 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-02 12:36:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:02,323 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-02 12:36:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:36:02,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 12:36:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:03,036 INFO L225 Difference]: With dead ends: 233475 [2018-12-02 12:36:03,036 INFO L226 Difference]: Without dead ends: 203725 [2018-12-02 12:36:03,038 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 [2018-12-02 12:36:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-02 12:36:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-02 12:36:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 12:36:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-02 12:36:06,317 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-02 12:36:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:06,318 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-02 12:36:06,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-02 12:36:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:36:06,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:06,324 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] [2018-12-02 12:36:06,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:06,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-02 12:36:06,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:06,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:06,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:06,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:06,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:36:06,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:36:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:36:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:06,370 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-12-02 12:36:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:07,172 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-12-02 12:36:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:36:07,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 12:36:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:07,487 INFO L225 Difference]: With dead ends: 118895 [2018-12-02 12:36:07,487 INFO L226 Difference]: Without dead ends: 118895 [2018-12-02 12:36:07,488 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 [2018-12-02 12:36:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-12-02 12:36:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-12-02 12:36:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 12:36:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-12-02 12:36:09,940 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-12-02 12:36:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:09,940 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-12-02 12:36:09,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:36:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-12-02 12:36:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:36:09,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:09,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:09,944 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:09,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:09,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-12-02 12:36:09,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:09,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:10,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:10,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:10,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:10,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:10,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:10,004 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-12-02 12:36:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:11,566 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-12-02 12:36:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:36:11,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 12:36:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:15,015 INFO L225 Difference]: With dead ends: 325275 [2018-12-02 12:36:15,015 INFO L226 Difference]: Without dead ends: 324275 [2018-12-02 12:36:15,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:36:16,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-02 12:36:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-02 12:36:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-02 12:36:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-12-02 12:36:19,528 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-12-02 12:36:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:19,528 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-12-02 12:36:19,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-12-02 12:36:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 12:36:19,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:19,533 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] [2018-12-02 12:36:19,533 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:19,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-02 12:36:19,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:19,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:19,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:19,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:19,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:19,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:19,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:19,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:19,580 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 5 states. [2018-12-02 12:36:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:21,452 INFO L93 Difference]: Finished difference Result 334055 states and 1500996 transitions. [2018-12-02 12:36:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:36:21,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 12:36:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:22,361 INFO L225 Difference]: With dead ends: 334055 [2018-12-02 12:36:22,361 INFO L226 Difference]: Without dead ends: 333005 [2018-12-02 12:36:22,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:36:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333005 states. [2018-12-02 12:36:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333005 to 194885. [2018-12-02 12:36:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-02 12:36:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876475 transitions. [2018-12-02 12:36:30,042 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876475 transitions. Word has length 54 [2018-12-02 12:36:30,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:30,042 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876475 transitions. [2018-12-02 12:36:30,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876475 transitions. [2018-12-02 12:36:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 12:36:30,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:30,064 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] [2018-12-02 12:36:30,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:30,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1926060511, now seen corresponding path program 1 times [2018-12-02 12:36:30,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:30,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:30,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:30,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:30,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:30,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:36:30,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:36:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:36:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:30,116 INFO L87 Difference]: Start difference. First operand 194885 states and 876475 transitions. Second operand 3 states. [2018-12-02 12:36:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:30,915 INFO L93 Difference]: Finished difference Result 194885 states and 876430 transitions. [2018-12-02 12:36:30,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:36:30,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-02 12:36:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:31,399 INFO L225 Difference]: With dead ends: 194885 [2018-12-02 12:36:31,399 INFO L226 Difference]: Without dead ends: 194885 [2018-12-02 12:36:31,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194885 states. [2018-12-02 12:36:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194885 to 194885. [2018-12-02 12:36:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-02 12:36:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876430 transitions. [2018-12-02 12:36:37,544 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876430 transitions. Word has length 61 [2018-12-02 12:36:37,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:37,545 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876430 transitions. [2018-12-02 12:36:37,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:36:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876430 transitions. [2018-12-02 12:36:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 12:36:37,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:37,566 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] [2018-12-02 12:36:37,566 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:37,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:37,567 INFO L82 PathProgramCache]: Analyzing trace with hash -183250176, now seen corresponding path program 1 times [2018-12-02 12:36:37,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:37,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:37,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:37,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:37,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:37,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:37,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:37,612 INFO L87 Difference]: Start difference. First operand 194885 states and 876430 transitions. Second operand 4 states. [2018-12-02 12:36:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:38,556 INFO L93 Difference]: Finished difference Result 172221 states and 761292 transitions. [2018-12-02 12:36:38,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:36:38,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 12:36:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:38,964 INFO L225 Difference]: With dead ends: 172221 [2018-12-02 12:36:38,965 INFO L226 Difference]: Without dead ends: 169616 [2018-12-02 12:36:38,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169616 states. [2018-12-02 12:36:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169616 to 169616. [2018-12-02 12:36:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169616 states. [2018-12-02 12:36:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169616 states to 169616 states and 752620 transitions. [2018-12-02 12:36:42,462 INFO L78 Accepts]: Start accepts. Automaton has 169616 states and 752620 transitions. Word has length 61 [2018-12-02 12:36:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:42,463 INFO L480 AbstractCegarLoop]: Abstraction has 169616 states and 752620 transitions. [2018-12-02 12:36:42,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 169616 states and 752620 transitions. [2018-12-02 12:36:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 12:36:42,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:42,481 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] [2018-12-02 12:36:42,481 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:42,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 771366836, now seen corresponding path program 1 times [2018-12-02 12:36:42,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:42,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:42,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:42,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:42,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:42,532 INFO L87 Difference]: Start difference. First operand 169616 states and 752620 transitions. Second operand 6 states. [2018-12-02 12:36:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:46,111 INFO L93 Difference]: Finished difference Result 292572 states and 1274469 transitions. [2018-12-02 12:36:46,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:36:46,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 12:36:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:46,844 INFO L225 Difference]: With dead ends: 292572 [2018-12-02 12:36:46,844 INFO L226 Difference]: Without dead ends: 291732 [2018-12-02 12:36:46,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:36:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291732 states. [2018-12-02 12:36:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291732 to 164648. [2018-12-02 12:36:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164648 states. [2018-12-02 12:36:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164648 states to 164648 states and 730626 transitions. [2018-12-02 12:36:50,983 INFO L78 Accepts]: Start accepts. Automaton has 164648 states and 730626 transitions. Word has length 62 [2018-12-02 12:36:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:50,983 INFO L480 AbstractCegarLoop]: Abstraction has 164648 states and 730626 transitions. [2018-12-02 12:36:50,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 164648 states and 730626 transitions. [2018-12-02 12:36:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 12:36:51,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:51,036 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] [2018-12-02 12:36:51,036 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:51,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:51,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1183833779, now seen corresponding path program 1 times [2018-12-02 12:36:51,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:51,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:51,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:51,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:51,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:51,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:51,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:51,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:51,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:51,126 INFO L87 Difference]: Start difference. First operand 164648 states and 730626 transitions. Second operand 6 states. [2018-12-02 12:36:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:52,970 INFO L93 Difference]: Finished difference Result 300884 states and 1315139 transitions. [2018-12-02 12:36:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:36:52,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 12:36:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:53,723 INFO L225 Difference]: With dead ends: 300884 [2018-12-02 12:36:53,723 INFO L226 Difference]: Without dead ends: 297668 [2018-12-02 12:36:53,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:36:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297668 states. [2018-12-02 12:36:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297668 to 251560. [2018-12-02 12:36:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251560 states. [2018-12-02 12:36:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251560 states to 251560 states and 1109866 transitions. [2018-12-02 12:36:59,115 INFO L78 Accepts]: Start accepts. Automaton has 251560 states and 1109866 transitions. Word has length 69 [2018-12-02 12:36:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:59,115 INFO L480 AbstractCegarLoop]: Abstraction has 251560 states and 1109866 transitions. [2018-12-02 12:36:59,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 251560 states and 1109866 transitions. [2018-12-02 12:36:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 12:36:59,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:59,212 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] [2018-12-02 12:36:59,213 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:59,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2051226827, now seen corresponding path program 1 times [2018-12-02 12:36:59,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:36:59,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:36:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:59,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:59,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:59,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:59,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:59,269 INFO L87 Difference]: Start difference. First operand 251560 states and 1109866 transitions. Second operand 6 states. [2018-12-02 12:37:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:04,065 INFO L93 Difference]: Finished difference Result 494808 states and 2157825 transitions. [2018-12-02 12:37:04,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:37:04,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 12:37:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:05,636 INFO L225 Difference]: With dead ends: 494808 [2018-12-02 12:37:05,637 INFO L226 Difference]: Without dead ends: 493528 [2018-12-02 12:37:05,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:37:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493528 states. [2018-12-02 12:37:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493528 to 289128. [2018-12-02 12:37:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289128 states. [2018-12-02 12:37:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289128 states to 289128 states and 1266394 transitions. [2018-12-02 12:37:12,773 INFO L78 Accepts]: Start accepts. Automaton has 289128 states and 1266394 transitions. Word has length 69 [2018-12-02 12:37:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:12,773 INFO L480 AbstractCegarLoop]: Abstraction has 289128 states and 1266394 transitions. [2018-12-02 12:37:12,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:37:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 289128 states and 1266394 transitions. [2018-12-02 12:37:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 12:37:12,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:12,915 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] [2018-12-02 12:37:12,915 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:12,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1168168357, now seen corresponding path program 1 times [2018-12-02 12:37:12,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:37:12,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:37:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:12,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:12,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:12,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:37:12,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:37:12,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:37:12,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:37:12,946 INFO L87 Difference]: Start difference. First operand 289128 states and 1266394 transitions. Second operand 3 states. [2018-12-02 12:37:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:14,859 INFO L93 Difference]: Finished difference Result 345308 states and 1496961 transitions. [2018-12-02 12:37:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:37:14,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-02 12:37:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:16,414 INFO L225 Difference]: With dead ends: 345308 [2018-12-02 12:37:16,414 INFO L226 Difference]: Without dead ends: 345308 [2018-12-02 12:37:16,414 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 [2018-12-02 12:37:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345308 states. [2018-12-02 12:37:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345308 to 304840. [2018-12-02 12:37:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304840 states. [2018-12-02 12:37:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304840 states to 304840 states and 1331906 transitions. [2018-12-02 12:37:25,679 INFO L78 Accepts]: Start accepts. Automaton has 304840 states and 1331906 transitions. Word has length 71 [2018-12-02 12:37:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:25,680 INFO L480 AbstractCegarLoop]: Abstraction has 304840 states and 1331906 transitions. [2018-12-02 12:37:25,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:37:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 304840 states and 1331906 transitions. [2018-12-02 12:37:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 12:37:25,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:25,908 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] [2018-12-02 12:37:25,908 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:25,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:25,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1509216195, now seen corresponding path program 1 times [2018-12-02 12:37:25,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:37:25,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:37:25,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:25,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:25,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:25,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:25,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:25,957 INFO L87 Difference]: Start difference. First operand 304840 states and 1331906 transitions. Second operand 7 states. [2018-12-02 12:37:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:29,183 INFO L93 Difference]: Finished difference Result 534372 states and 2306534 transitions. [2018-12-02 12:37:29,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:37:29,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-02 12:37:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:31,108 INFO L225 Difference]: With dead ends: 534372 [2018-12-02 12:37:31,108 INFO L226 Difference]: Without dead ends: 533092 [2018-12-02 12:37:31,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-02 12:37:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533092 states. [2018-12-02 12:37:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533092 to 314072. [2018-12-02 12:37:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314072 states. [2018-12-02 12:37:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314072 states to 314072 states and 1369866 transitions. [2018-12-02 12:37:42,974 INFO L78 Accepts]: Start accepts. Automaton has 314072 states and 1369866 transitions. Word has length 75 [2018-12-02 12:37:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:42,974 INFO L480 AbstractCegarLoop]: Abstraction has 314072 states and 1369866 transitions. [2018-12-02 12:37:42,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 314072 states and 1369866 transitions. [2018-12-02 12:37:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 12:37:43,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:43,223 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] [2018-12-02 12:37:43,223 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:43,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1845742857, now seen corresponding path program 1 times [2018-12-02 12:37:43,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:37:43,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:37:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:43,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:43,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:37:43,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:37:43,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:37:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:37:43,264 INFO L87 Difference]: Start difference. First operand 314072 states and 1369866 transitions. Second operand 5 states. [2018-12-02 12:37:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:43,727 INFO L93 Difference]: Finished difference Result 115104 states and 456668 transitions. [2018-12-02 12:37:43,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:37:43,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-02 12:37:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:43,971 INFO L225 Difference]: With dead ends: 115104 [2018-12-02 12:37:43,971 INFO L226 Difference]: Without dead ends: 112792 [2018-12-02 12:37:43,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112792 states. [2018-12-02 12:37:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112792 to 112792. [2018-12-02 12:37:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112792 states. [2018-12-02 12:37:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112792 states to 112792 states and 448014 transitions. [2018-12-02 12:37:45,866 INFO L78 Accepts]: Start accepts. Automaton has 112792 states and 448014 transitions. Word has length 76 [2018-12-02 12:37:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:45,867 INFO L480 AbstractCegarLoop]: Abstraction has 112792 states and 448014 transitions. [2018-12-02 12:37:45,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:37:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 112792 states and 448014 transitions. [2018-12-02 12:37:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:37:45,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:45,937 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] [2018-12-02 12:37:45,937 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:45,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash -408653916, now seen corresponding path program 1 times [2018-12-02 12:37:45,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:37:45,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:37:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:45,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:45,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:45,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:45,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:37:45,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:37:45,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:37:45,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:37:45,973 INFO L87 Difference]: Start difference. First operand 112792 states and 448014 transitions. Second operand 4 states. [2018-12-02 12:37:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:46,810 INFO L93 Difference]: Finished difference Result 152977 states and 600861 transitions. [2018-12-02 12:37:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:37:46,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 12:37:46,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:47,393 INFO L225 Difference]: With dead ends: 152977 [2018-12-02 12:37:47,393 INFO L226 Difference]: Without dead ends: 152977 [2018-12-02 12:37:47,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:37:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152977 states. [2018-12-02 12:37:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152977 to 138716. [2018-12-02 12:37:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138716 states. [2018-12-02 12:37:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138716 states to 138716 states and 547833 transitions. [2018-12-02 12:37:49,672 INFO L78 Accepts]: Start accepts. Automaton has 138716 states and 547833 transitions. Word has length 82 [2018-12-02 12:37:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:49,672 INFO L480 AbstractCegarLoop]: Abstraction has 138716 states and 547833 transitions. [2018-12-02 12:37:49,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:37:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 138716 states and 547833 transitions. [2018-12-02 12:37:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:37:49,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:49,751 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] [2018-12-02 12:37:49,751 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:49,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:49,751 INFO L82 PathProgramCache]: Analyzing trace with hash -57853979, now seen corresponding path program 1 times [2018-12-02 12:37:49,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:37:49,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:37:49,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:49,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:49,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:49,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:49,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:37:49,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:37:49,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:37:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:37:49,834 INFO L87 Difference]: Start difference. First operand 138716 states and 547833 transitions. Second operand 6 states. [2018-12-02 12:37:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:50,555 INFO L93 Difference]: Finished difference Result 146264 states and 574325 transitions. [2018-12-02 12:37:50,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:37:50,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 12:37:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:50,869 INFO L225 Difference]: With dead ends: 146264 [2018-12-02 12:37:50,870 INFO L226 Difference]: Without dead ends: 146264 [2018-12-02 12:37:50,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:37:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146264 states. [2018-12-02 12:37:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146264 to 142096. [2018-12-02 12:37:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142096 states. [2018-12-02 12:37:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142096 states to 142096 states and 559493 transitions. [2018-12-02 12:37:55,334 INFO L78 Accepts]: Start accepts. Automaton has 142096 states and 559493 transitions. Word has length 82 [2018-12-02 12:37:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:55,334 INFO L480 AbstractCegarLoop]: Abstraction has 142096 states and 559493 transitions. [2018-12-02 12:37:55,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:37:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 142096 states and 559493 transitions. [2018-12-02 12:37:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:37:55,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:55,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:55,420 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:55,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 903760038, now seen corresponding path program 1 times [2018-12-02 12:37:55,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:37:55,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:37:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:55,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:55,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:55,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:55,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:55,475 INFO L87 Difference]: Start difference. First operand 142096 states and 559493 transitions. Second operand 7 states. [2018-12-02 12:37:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:56,455 INFO L93 Difference]: Finished difference Result 170048 states and 665197 transitions. [2018-12-02 12:37:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 12:37:56,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 12:37:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:56,828 INFO L225 Difference]: With dead ends: 170048 [2018-12-02 12:37:56,828 INFO L226 Difference]: Without dead ends: 169728 [2018-12-02 12:37:56,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-02 12:37:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169728 states. [2018-12-02 12:37:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169728 to 143120. [2018-12-02 12:37:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143120 states. [2018-12-02 12:37:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143120 states to 143120 states and 563173 transitions. [2018-12-02 12:37:59,461 INFO L78 Accepts]: Start accepts. Automaton has 143120 states and 563173 transitions. Word has length 82 [2018-12-02 12:37:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:59,461 INFO L480 AbstractCegarLoop]: Abstraction has 143120 states and 563173 transitions. [2018-12-02 12:37:59,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 143120 states and 563173 transitions. [2018-12-02 12:37:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 12:37:59,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:59,587 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] [2018-12-02 12:37:59,587 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:59,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1547781004, now seen corresponding path program 1 times [2018-12-02 12:37:59,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:37:59,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:37:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:59,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:59,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 12:37:59,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 12:37:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 12:37:59,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:37:59,672 INFO L87 Difference]: Start difference. First operand 143120 states and 563173 transitions. Second operand 10 states. [2018-12-02 12:38:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:01,340 INFO L93 Difference]: Finished difference Result 180672 states and 697501 transitions. [2018-12-02 12:38:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 12:38:01,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-02 12:38:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:01,720 INFO L225 Difference]: With dead ends: 180672 [2018-12-02 12:38:01,720 INFO L226 Difference]: Without dead ends: 180352 [2018-12-02 12:38:01,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 12:38:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180352 states. [2018-12-02 12:38:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180352 to 134400. [2018-12-02 12:38:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134400 states. [2018-12-02 12:38:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134400 states to 134400 states and 527629 transitions. [2018-12-02 12:38:04,589 INFO L78 Accepts]: Start accepts. Automaton has 134400 states and 527629 transitions. Word has length 88 [2018-12-02 12:38:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:04,589 INFO L480 AbstractCegarLoop]: Abstraction has 134400 states and 527629 transitions. [2018-12-02 12:38:04,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 12:38:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 134400 states and 527629 transitions. [2018-12-02 12:38:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 12:38:04,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:04,716 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] [2018-12-02 12:38:04,716 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:04,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash -857926826, now seen corresponding path program 1 times [2018-12-02 12:38:04,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:04,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:04,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:04,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:04,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:04,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:04,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:38:04,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:38:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:38:04,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:38:04,753 INFO L87 Difference]: Start difference. First operand 134400 states and 527629 transitions. Second operand 4 states. [2018-12-02 12:38:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:05,479 INFO L93 Difference]: Finished difference Result 158034 states and 614319 transitions. [2018-12-02 12:38:05,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:38:05,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-02 12:38:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:05,814 INFO L225 Difference]: With dead ends: 158034 [2018-12-02 12:38:05,814 INFO L226 Difference]: Without dead ends: 157074 [2018-12-02 12:38:05,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:38:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157074 states. [2018-12-02 12:38:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157074 to 150402. [2018-12-02 12:38:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150402 states. [2018-12-02 12:38:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150402 states to 150402 states and 586759 transitions. [2018-12-02 12:38:08,504 INFO L78 Accepts]: Start accepts. Automaton has 150402 states and 586759 transitions. Word has length 90 [2018-12-02 12:38:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:08,505 INFO L480 AbstractCegarLoop]: Abstraction has 150402 states and 586759 transitions. [2018-12-02 12:38:08,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:38:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 150402 states and 586759 transitions. [2018-12-02 12:38:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 12:38:08,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:08,661 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] [2018-12-02 12:38:08,661 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:08,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1501380183, now seen corresponding path program 1 times [2018-12-02 12:38:08,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:08,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:08,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:08,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:08,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:38:08,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:38:08,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:38:08,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:38:08,691 INFO L87 Difference]: Start difference. First operand 150402 states and 586759 transitions. Second operand 3 states. [2018-12-02 12:38:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:09,404 INFO L93 Difference]: Finished difference Result 158257 states and 616249 transitions. [2018-12-02 12:38:09,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:38:09,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-02 12:38:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:09,748 INFO L225 Difference]: With dead ends: 158257 [2018-12-02 12:38:09,748 INFO L226 Difference]: Without dead ends: 158257 [2018-12-02 12:38:09,748 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 [2018-12-02 12:38:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158257 states. [2018-12-02 12:38:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158257 to 154244. [2018-12-02 12:38:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154244 states. [2018-12-02 12:38:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154244 states to 154244 states and 601129 transitions. [2018-12-02 12:38:12,152 INFO L78 Accepts]: Start accepts. Automaton has 154244 states and 601129 transitions. Word has length 90 [2018-12-02 12:38:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:12,152 INFO L480 AbstractCegarLoop]: Abstraction has 154244 states and 601129 transitions. [2018-12-02 12:38:12,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:38:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 154244 states and 601129 transitions. [2018-12-02 12:38:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 12:38:12,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:12,536 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] [2018-12-02 12:38:12,536 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:12,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1760831503, now seen corresponding path program 1 times [2018-12-02 12:38:12,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:12,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:12,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:38:12,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:38:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:38:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:38:12,567 INFO L87 Difference]: Start difference. First operand 154244 states and 601129 transitions. Second operand 3 states. [2018-12-02 12:38:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:13,098 INFO L93 Difference]: Finished difference Result 141076 states and 547729 transitions. [2018-12-02 12:38:13,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:38:13,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-02 12:38:13,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:13,388 INFO L225 Difference]: With dead ends: 141076 [2018-12-02 12:38:13,388 INFO L226 Difference]: Without dead ends: 139940 [2018-12-02 12:38:13,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:38:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139940 states. [2018-12-02 12:38:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139940 to 137094. [2018-12-02 12:38:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137094 states. [2018-12-02 12:38:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137094 states to 137094 states and 533157 transitions. [2018-12-02 12:38:15,448 INFO L78 Accepts]: Start accepts. Automaton has 137094 states and 533157 transitions. Word has length 91 [2018-12-02 12:38:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:15,448 INFO L480 AbstractCegarLoop]: Abstraction has 137094 states and 533157 transitions. [2018-12-02 12:38:15,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:38:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 137094 states and 533157 transitions. [2018-12-02 12:38:15,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 12:38:15,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:15,573 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] [2018-12-02 12:38:15,573 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:15,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1422955889, now seen corresponding path program 1 times [2018-12-02 12:38:15,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:15,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:15,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:38:15,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:38:15,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:38:15,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:38:15,623 INFO L87 Difference]: Start difference. First operand 137094 states and 533157 transitions. Second operand 6 states. [2018-12-02 12:38:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:16,362 INFO L93 Difference]: Finished difference Result 145597 states and 562700 transitions. [2018-12-02 12:38:16,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:38:16,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 12:38:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:16,905 INFO L225 Difference]: With dead ends: 145597 [2018-12-02 12:38:16,905 INFO L226 Difference]: Without dead ends: 145597 [2018-12-02 12:38:16,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:38:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145597 states. [2018-12-02 12:38:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145597 to 137839. [2018-12-02 12:38:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137839 states. [2018-12-02 12:38:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137839 states to 137839 states and 535478 transitions. [2018-12-02 12:38:19,161 INFO L78 Accepts]: Start accepts. Automaton has 137839 states and 535478 transitions. Word has length 91 [2018-12-02 12:38:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:19,161 INFO L480 AbstractCegarLoop]: Abstraction has 137839 states and 535478 transitions. [2018-12-02 12:38:19,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:38:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 137839 states and 535478 transitions. [2018-12-02 12:38:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 12:38:19,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:19,286 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] [2018-12-02 12:38:19,286 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:19,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash -512704398, now seen corresponding path program 1 times [2018-12-02 12:38:19,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:19,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:19,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:19,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:19,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:19,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:38:19,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:38:19,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:38:19,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:38:19,332 INFO L87 Difference]: Start difference. First operand 137839 states and 535478 transitions. Second operand 7 states. [2018-12-02 12:38:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:20,140 INFO L93 Difference]: Finished difference Result 147747 states and 570216 transitions. [2018-12-02 12:38:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:38:20,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 12:38:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:20,452 INFO L225 Difference]: With dead ends: 147747 [2018-12-02 12:38:20,452 INFO L226 Difference]: Without dead ends: 147747 [2018-12-02 12:38:20,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:38:20,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147747 states. [2018-12-02 12:38:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147747 to 139330. [2018-12-02 12:38:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139330 states. [2018-12-02 12:38:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139330 states to 139330 states and 539931 transitions. [2018-12-02 12:38:22,972 INFO L78 Accepts]: Start accepts. Automaton has 139330 states and 539931 transitions. Word has length 91 [2018-12-02 12:38:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:22,972 INFO L480 AbstractCegarLoop]: Abstraction has 139330 states and 539931 transitions. [2018-12-02 12:38:22,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:38:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 139330 states and 539931 transitions. [2018-12-02 12:38:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 12:38:23,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:23,100 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] [2018-12-02 12:38:23,100 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:23,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash -182938637, now seen corresponding path program 1 times [2018-12-02 12:38:23,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:23,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:23,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:23,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:38:23,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:38:23,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:38:23,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:38:23,140 INFO L87 Difference]: Start difference. First operand 139330 states and 539931 transitions. Second operand 6 states. [2018-12-02 12:38:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:23,216 INFO L93 Difference]: Finished difference Result 18690 states and 61579 transitions. [2018-12-02 12:38:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:38:23,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 12:38:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:23,236 INFO L225 Difference]: With dead ends: 18690 [2018-12-02 12:38:23,236 INFO L226 Difference]: Without dead ends: 16038 [2018-12-02 12:38:23,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:38:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2018-12-02 12:38:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 15533. [2018-12-02 12:38:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15533 states. [2018-12-02 12:38:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15533 states to 15533 states and 51148 transitions. [2018-12-02 12:38:23,397 INFO L78 Accepts]: Start accepts. Automaton has 15533 states and 51148 transitions. Word has length 91 [2018-12-02 12:38:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:23,397 INFO L480 AbstractCegarLoop]: Abstraction has 15533 states and 51148 transitions. [2018-12-02 12:38:23,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:38:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 15533 states and 51148 transitions. [2018-12-02 12:38:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:38:23,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:23,409 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:23,409 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:23,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash 638002360, now seen corresponding path program 1 times [2018-12-02 12:38:23,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:23,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:23,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:23,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:38:23,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:38:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:38:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:38:23,484 INFO L87 Difference]: Start difference. First operand 15533 states and 51148 transitions. Second operand 7 states. [2018-12-02 12:38:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:23,691 INFO L93 Difference]: Finished difference Result 17432 states and 57040 transitions. [2018-12-02 12:38:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:38:23,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-02 12:38:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:23,711 INFO L225 Difference]: With dead ends: 17432 [2018-12-02 12:38:23,711 INFO L226 Difference]: Without dead ends: 17432 [2018-12-02 12:38:23,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:38:23,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17432 states. [2018-12-02 12:38:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17432 to 15898. [2018-12-02 12:38:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15898 states. [2018-12-02 12:38:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15898 states to 15898 states and 52215 transitions. [2018-12-02 12:38:23,873 INFO L78 Accepts]: Start accepts. Automaton has 15898 states and 52215 transitions. Word has length 103 [2018-12-02 12:38:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:23,873 INFO L480 AbstractCegarLoop]: Abstraction has 15898 states and 52215 transitions. [2018-12-02 12:38:23,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:38:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 15898 states and 52215 transitions. [2018-12-02 12:38:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:38:23,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:23,885 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:23,886 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:23,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:23,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1607583383, now seen corresponding path program 1 times [2018-12-02 12:38:23,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:23,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:23,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:23,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:23,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:23,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:23,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:38:23,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:38:23,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:38:23,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:38:23,961 INFO L87 Difference]: Start difference. First operand 15898 states and 52215 transitions. Second operand 7 states. [2018-12-02 12:38:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:24,205 INFO L93 Difference]: Finished difference Result 21554 states and 68742 transitions. [2018-12-02 12:38:24,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:38:24,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-02 12:38:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:24,228 INFO L225 Difference]: With dead ends: 21554 [2018-12-02 12:38:24,228 INFO L226 Difference]: Without dead ends: 21394 [2018-12-02 12:38:24,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:38:24,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21394 states. [2018-12-02 12:38:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21394 to 16653. [2018-12-02 12:38:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16653 states. [2018-12-02 12:38:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16653 states to 16653 states and 54159 transitions. [2018-12-02 12:38:24,406 INFO L78 Accepts]: Start accepts. Automaton has 16653 states and 54159 transitions. Word has length 103 [2018-12-02 12:38:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:24,406 INFO L480 AbstractCegarLoop]: Abstraction has 16653 states and 54159 transitions. [2018-12-02 12:38:24,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:38:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 16653 states and 54159 transitions. [2018-12-02 12:38:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 12:38:24,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:24,418 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:24,418 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:24,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash -328076904, now seen corresponding path program 1 times [2018-12-02 12:38:24,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:24,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:24,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:24,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:24,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:38:24,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:38:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:38:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:38:24,474 INFO L87 Difference]: Start difference. First operand 16653 states and 54159 transitions. Second operand 6 states. [2018-12-02 12:38:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:24,640 INFO L93 Difference]: Finished difference Result 16793 states and 53916 transitions. [2018-12-02 12:38:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:38:24,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-02 12:38:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:24,658 INFO L225 Difference]: With dead ends: 16793 [2018-12-02 12:38:24,658 INFO L226 Difference]: Without dead ends: 16793 [2018-12-02 12:38:24,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:38:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2018-12-02 12:38:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 15578. [2018-12-02 12:38:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15578 states. [2018-12-02 12:38:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15578 states to 15578 states and 50519 transitions. [2018-12-02 12:38:24,814 INFO L78 Accepts]: Start accepts. Automaton has 15578 states and 50519 transitions. Word has length 103 [2018-12-02 12:38:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:24,814 INFO L480 AbstractCegarLoop]: Abstraction has 15578 states and 50519 transitions. [2018-12-02 12:38:24,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:38:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15578 states and 50519 transitions. [2018-12-02 12:38:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:24,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:24,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:24,826 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:24,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:24,826 INFO L82 PathProgramCache]: Analyzing trace with hash -110554694, now seen corresponding path program 1 times [2018-12-02 12:38:24,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:24,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:24,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:24,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:24,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:24,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:24,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:38:24,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:38:24,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:38:24,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:38:24,865 INFO L87 Difference]: Start difference. First operand 15578 states and 50519 transitions. Second operand 6 states. [2018-12-02 12:38:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:25,103 INFO L93 Difference]: Finished difference Result 19767 states and 63270 transitions. [2018-12-02 12:38:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:38:25,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 12:38:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:25,122 INFO L225 Difference]: With dead ends: 19767 [2018-12-02 12:38:25,122 INFO L226 Difference]: Without dead ends: 19767 [2018-12-02 12:38:25,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:38:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19767 states. [2018-12-02 12:38:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19767 to 16718. [2018-12-02 12:38:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16718 states. [2018-12-02 12:38:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16718 states to 16718 states and 54136 transitions. [2018-12-02 12:38:25,285 INFO L78 Accepts]: Start accepts. Automaton has 16718 states and 54136 transitions. Word has length 105 [2018-12-02 12:38:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:25,285 INFO L480 AbstractCegarLoop]: Abstraction has 16718 states and 54136 transitions. [2018-12-02 12:38:25,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:38:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 16718 states and 54136 transitions. [2018-12-02 12:38:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:25,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:25,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:25,299 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:25,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1159044518, now seen corresponding path program 1 times [2018-12-02 12:38:25,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:25,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:25,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:25,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:25,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:25,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:25,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:38:25,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:38:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:38:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:38:25,384 INFO L87 Difference]: Start difference. First operand 16718 states and 54136 transitions. Second operand 6 states. [2018-12-02 12:38:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:25,463 INFO L93 Difference]: Finished difference Result 16233 states and 52193 transitions. [2018-12-02 12:38:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:38:25,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 12:38:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:25,480 INFO L225 Difference]: With dead ends: 16233 [2018-12-02 12:38:25,480 INFO L226 Difference]: Without dead ends: 16143 [2018-12-02 12:38:25,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:38:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16143 states. [2018-12-02 12:38:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16143 to 15343. [2018-12-02 12:38:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15343 states. [2018-12-02 12:38:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15343 states to 15343 states and 49681 transitions. [2018-12-02 12:38:25,631 INFO L78 Accepts]: Start accepts. Automaton has 15343 states and 49681 transitions. Word has length 105 [2018-12-02 12:38:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:25,631 INFO L480 AbstractCegarLoop]: Abstraction has 15343 states and 49681 transitions. [2018-12-02 12:38:25,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:38:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 15343 states and 49681 transitions. [2018-12-02 12:38:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:25,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:25,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:25,643 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:25,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2046214981, now seen corresponding path program 1 times [2018-12-02 12:38:25,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:25,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:25,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:25,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:25,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:25,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:25,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:38:25,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:38:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:38:25,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:38:25,683 INFO L87 Difference]: Start difference. First operand 15343 states and 49681 transitions. Second operand 4 states. [2018-12-02 12:38:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:25,760 INFO L93 Difference]: Finished difference Result 14703 states and 47345 transitions. [2018-12-02 12:38:25,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:38:25,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 12:38:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:25,777 INFO L225 Difference]: With dead ends: 14703 [2018-12-02 12:38:25,778 INFO L226 Difference]: Without dead ends: 14703 [2018-12-02 12:38:25,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:38:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14703 states. [2018-12-02 12:38:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14703 to 13649. [2018-12-02 12:38:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13649 states. [2018-12-02 12:38:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13649 states to 13649 states and 44178 transitions. [2018-12-02 12:38:25,910 INFO L78 Accepts]: Start accepts. Automaton has 13649 states and 44178 transitions. Word has length 105 [2018-12-02 12:38:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:25,910 INFO L480 AbstractCegarLoop]: Abstraction has 13649 states and 44178 transitions. [2018-12-02 12:38:25,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:38:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 13649 states and 44178 transitions. [2018-12-02 12:38:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:25,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:25,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:25,920 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:25,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1200262491, now seen corresponding path program 1 times [2018-12-02 12:38:25,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:25,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:25,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:38:25,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:38:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:38:25,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:38:25,974 INFO L87 Difference]: Start difference. First operand 13649 states and 44178 transitions. Second operand 5 states. [2018-12-02 12:38:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:26,105 INFO L93 Difference]: Finished difference Result 15441 states and 49938 transitions. [2018-12-02 12:38:26,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:38:26,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 12:38:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:26,122 INFO L225 Difference]: With dead ends: 15441 [2018-12-02 12:38:26,122 INFO L226 Difference]: Without dead ends: 15313 [2018-12-02 12:38:26,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:38:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2018-12-02 12:38:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 13841. [2018-12-02 12:38:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2018-12-02 12:38:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 44738 transitions. [2018-12-02 12:38:26,263 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 44738 transitions. Word has length 105 [2018-12-02 12:38:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:26,263 INFO L480 AbstractCegarLoop]: Abstraction has 13841 states and 44738 transitions. [2018-12-02 12:38:26,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:38:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 44738 transitions. [2018-12-02 12:38:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:26,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:26,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:26,273 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:26,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1849940324, now seen corresponding path program 1 times [2018-12-02 12:38:26,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:26,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:26,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:26,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:38:26,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:38:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:38:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:38:26,329 INFO L87 Difference]: Start difference. First operand 13841 states and 44738 transitions. Second operand 5 states. [2018-12-02 12:38:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:26,384 INFO L93 Difference]: Finished difference Result 20629 states and 67822 transitions. [2018-12-02 12:38:26,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:38:26,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 12:38:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:26,408 INFO L225 Difference]: With dead ends: 20629 [2018-12-02 12:38:26,408 INFO L226 Difference]: Without dead ends: 20629 [2018-12-02 12:38:26,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:38:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20629 states. [2018-12-02 12:38:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20629 to 13201. [2018-12-02 12:38:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13201 states. [2018-12-02 12:38:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13201 states to 13201 states and 42611 transitions. [2018-12-02 12:38:26,571 INFO L78 Accepts]: Start accepts. Automaton has 13201 states and 42611 transitions. Word has length 105 [2018-12-02 12:38:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:26,571 INFO L480 AbstractCegarLoop]: Abstraction has 13201 states and 42611 transitions. [2018-12-02 12:38:26,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:38:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 13201 states and 42611 transitions. [2018-12-02 12:38:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:26,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:26,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:26,581 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:26,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -880359301, now seen corresponding path program 1 times [2018-12-02 12:38:26,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:26,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:26,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:38:26,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:38:26,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:38:26,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:38:26,648 INFO L87 Difference]: Start difference. First operand 13201 states and 42611 transitions. Second operand 9 states. [2018-12-02 12:38:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:26,786 INFO L93 Difference]: Finished difference Result 24725 states and 80418 transitions. [2018-12-02 12:38:26,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:38:26,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 12:38:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:26,800 INFO L225 Difference]: With dead ends: 24725 [2018-12-02 12:38:26,800 INFO L226 Difference]: Without dead ends: 12605 [2018-12-02 12:38:26,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:38:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12605 states. [2018-12-02 12:38:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12605 to 12605. [2018-12-02 12:38:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12605 states. [2018-12-02 12:38:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12605 states to 12605 states and 40875 transitions. [2018-12-02 12:38:26,940 INFO L78 Accepts]: Start accepts. Automaton has 12605 states and 40875 transitions. Word has length 105 [2018-12-02 12:38:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:26,941 INFO L480 AbstractCegarLoop]: Abstraction has 12605 states and 40875 transitions. [2018-12-02 12:38:26,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:38:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 12605 states and 40875 transitions. [2018-12-02 12:38:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:26,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:26,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:26,950 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:26,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash -287902169, now seen corresponding path program 2 times [2018-12-02 12:38:26,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:26,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:27,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:27,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:38:27,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:38:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:38:27,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:38:27,010 INFO L87 Difference]: Start difference. First operand 12605 states and 40875 transitions. Second operand 9 states. [2018-12-02 12:38:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:27,141 INFO L93 Difference]: Finished difference Result 20589 states and 67655 transitions. [2018-12-02 12:38:27,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:38:27,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 12:38:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:27,151 INFO L225 Difference]: With dead ends: 20589 [2018-12-02 12:38:27,151 INFO L226 Difference]: Without dead ends: 8278 [2018-12-02 12:38:27,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:38:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2018-12-02 12:38:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 8278. [2018-12-02 12:38:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8278 states. [2018-12-02 12:38:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 27564 transitions. [2018-12-02 12:38:27,230 INFO L78 Accepts]: Start accepts. Automaton has 8278 states and 27564 transitions. Word has length 105 [2018-12-02 12:38:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:27,231 INFO L480 AbstractCegarLoop]: Abstraction has 8278 states and 27564 transitions. [2018-12-02 12:38:27,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:38:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8278 states and 27564 transitions. [2018-12-02 12:38:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:27,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:27,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:27,237 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:27,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash -817088528, now seen corresponding path program 1 times [2018-12-02 12:38:27,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:27,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:27,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:38:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:27,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:27,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:38:27,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:38:27,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:38:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:38:27,282 INFO L87 Difference]: Start difference. First operand 8278 states and 27564 transitions. Second operand 5 states. [2018-12-02 12:38:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:27,375 INFO L93 Difference]: Finished difference Result 9715 states and 31700 transitions. [2018-12-02 12:38:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:38:27,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 12:38:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:27,387 INFO L225 Difference]: With dead ends: 9715 [2018-12-02 12:38:27,387 INFO L226 Difference]: Without dead ends: 9635 [2018-12-02 12:38:27,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:38:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2018-12-02 12:38:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 8340. [2018-12-02 12:38:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8340 states. [2018-12-02 12:38:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8340 states to 8340 states and 27733 transitions. [2018-12-02 12:38:27,468 INFO L78 Accepts]: Start accepts. Automaton has 8340 states and 27733 transitions. Word has length 105 [2018-12-02 12:38:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:27,468 INFO L480 AbstractCegarLoop]: Abstraction has 8340 states and 27733 transitions. [2018-12-02 12:38:27,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:38:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8340 states and 27733 transitions. [2018-12-02 12:38:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:27,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:27,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:27,475 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:27,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:27,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1777138289, now seen corresponding path program 3 times [2018-12-02 12:38:27,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:27,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:27,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:38:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:38:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:38:27,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:38:27,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 12:38:27,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:38:27,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:38:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:38:27,555 INFO L87 Difference]: Start difference. First operand 8340 states and 27733 transitions. Second operand 12 states. [2018-12-02 12:38:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:38:27,948 INFO L93 Difference]: Finished difference Result 15960 states and 53352 transitions. [2018-12-02 12:38:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:38:27,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-02 12:38:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:38:27,960 INFO L225 Difference]: With dead ends: 15960 [2018-12-02 12:38:27,960 INFO L226 Difference]: Without dead ends: 11416 [2018-12-02 12:38:27,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 12:38:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11416 states. [2018-12-02 12:38:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11416 to 10736. [2018-12-02 12:38:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10736 states. [2018-12-02 12:38:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10736 states to 10736 states and 34978 transitions. [2018-12-02 12:38:28,063 INFO L78 Accepts]: Start accepts. Automaton has 10736 states and 34978 transitions. Word has length 105 [2018-12-02 12:38:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:38:28,064 INFO L480 AbstractCegarLoop]: Abstraction has 10736 states and 34978 transitions. [2018-12-02 12:38:28,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:38:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 10736 states and 34978 transitions. [2018-12-02 12:38:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 12:38:28,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:38:28,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:38:28,072 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:38:28,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:38:28,072 INFO L82 PathProgramCache]: Analyzing trace with hash 653369973, now seen corresponding path program 4 times [2018-12-02 12:38:28,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:38:28,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:38:28,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:28,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:38:28,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:38:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:38:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:38:28,124 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:38:28,228 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:38:28,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:38:28 BasicIcfg [2018-12-02 12:38:28,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:38:28,230 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:38:28,230 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:38:28,230 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:38:28,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:35:46" (3/4) ... [2018-12-02 12:38:28,233 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:38:28,346 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_40bee373-18b3-4f95-b196-45022fbb412f/bin-2019/uautomizer/witness.graphml [2018-12-02 12:38:28,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:38:28,347 INFO L168 Benchmark]: Toolchain (without parser) took 162821.04 ms. Allocated memory was 1.0 GB in the beginning and 8.9 GB in the end (delta: 7.9 GB). Free memory was 950.6 MB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2018-12-02 12:38:28,349 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:38:28,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:38:28,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.97 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-02 12:38:28,349 INFO L168 Benchmark]: Boogie Preprocessor took 21.44 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. [2018-12-02 12:38:28,349 INFO L168 Benchmark]: RCFGBuilder took 356.50 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:38:28,350 INFO L168 Benchmark]: TraceAbstraction took 161970.60 ms. Allocated memory was 1.2 GB in the beginning and 8.9 GB in the end (delta: 7.7 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2018-12-02 12:38:28,350 INFO L168 Benchmark]: Witness Printer took 116.73 ms. Allocated memory is still 8.9 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:38:28,351 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.8 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.97 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.44 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 356.50 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 161970.60 ms. Allocated memory was 1.2 GB in the beginning and 8.9 GB in the end (delta: 7.7 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. * Witness Printer took 116.73 ms. Allocated memory is still 8.9 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1110, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1111; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1111, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1112; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1112, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 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 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -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 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -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) [L811] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -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)) [L812] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -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)) [L813] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -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)) [L814] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -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)) [L815] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -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)) [L816] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -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)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 161.8s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 51.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9281 SDtfs, 10699 SDslu, 23912 SDs, 0 SdLazy, 8438 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 100 SyntacticMatches, 22 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314072occurred 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: 93.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 1142348 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2987 NumberOfCodeBlocks, 2987 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2848 ConstructedInterpolants, 0 QuantifiedInterpolants, 593611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...