./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_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_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/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 691fab8578b36371b4449c4d855bdbbbbb6262cc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 15:47:27,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:47:27,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:47:27,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:47:27,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:47:27,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:47:27,554 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:47:27,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:47:27,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:47:27,556 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:47:27,557 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:47:27,557 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:47:27,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:47:27,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:47:27,558 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:47:27,559 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:47:27,559 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:47:27,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:47:27,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:47:27,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:47:27,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:47:27,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:47:27,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:47:27,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:47:27,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:47:27,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:47:27,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:47:27,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:47:27,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:47:27,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:47:27,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:47:27,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:47:27,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:47:27,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:47:27,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:47:27,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:47:27,568 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 15:47:27,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:47:27,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:47:27,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:47:27,576 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:47:27,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:47:27,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:47:27,576 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:47:27,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:47:27,576 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:47:27,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:47:27,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:47:27,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:47:27,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:47:27,578 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_415089cb-e037-45ff-9a30-cd41d59050e3/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 -> 691fab8578b36371b4449c4d855bdbbbbb6262cc [2018-12-09 15:47:27,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:47:27,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:47:27,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:47:27,609 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:47:27,609 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:47:27,610 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i [2018-12-09 15:47:27,647 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/data/046c5aa98/e580353342db483d977875513386b13c/FLAG02ead6216 [2018-12-09 15:47:27,988 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:47:27,988 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/sv-benchmarks/c/pthread-wmm/safe030_power.opt_false-unreach-call.i [2018-12-09 15:47:27,996 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/data/046c5aa98/e580353342db483d977875513386b13c/FLAG02ead6216 [2018-12-09 15:47:28,380 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/data/046c5aa98/e580353342db483d977875513386b13c [2018-12-09 15:47:28,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:47:28,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:47:28,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:47:28,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:47:28,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:47:28,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28, skipping insertion in model container [2018-12-09 15:47:28,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:47:28,425 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:47:28,636 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:47:28,645 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:47:28,727 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:47:28,757 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:47:28,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28 WrapperNode [2018-12-09 15:47:28,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:47:28,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:47:28,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:47:28,758 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:47:28,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:47:28,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:47:28,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:47:28,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:47:28,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... [2018-12-09 15:47:28,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:47:28,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:47:28,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:47:28,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:47:28,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/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-09 15:47:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:47:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:47:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 15:47:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:47:28,855 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 15:47:28,855 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 15:47:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 15:47:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 15:47:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 15:47:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 15:47:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 15:47:28,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:47:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:47:28,857 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 15:47:29,161 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:47:29,162 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 15:47:29,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:47:29 BoogieIcfgContainer [2018-12-09 15:47:29,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:47:29,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:47:29,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:47:29,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:47:29,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:47:28" (1/3) ... [2018-12-09 15:47:29,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba87fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:47:29, skipping insertion in model container [2018-12-09 15:47:29,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:47:28" (2/3) ... [2018-12-09 15:47:29,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba87fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:47:29, skipping insertion in model container [2018-12-09 15:47:29,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:47:29" (3/3) ... [2018-12-09 15:47:29,166 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_false-unreach-call.i [2018-12-09 15:47:29,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,191 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,191 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,191 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,192 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,193 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,193 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,193 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,193 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,193 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,193 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,193 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,194 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,194 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,194 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,194 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,194 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,194 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,195 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,195 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,195 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,195 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,195 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,195 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,195 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,196 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,196 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,196 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,196 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,196 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,196 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,196 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,197 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,197 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,197 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,197 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,198 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,198 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,198 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,198 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,198 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,198 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,199 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,200 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,201 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,202 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 15:47:29,208 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 15:47:29,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:47:29,215 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 15:47:29,227 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 15:47:29,241 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:47:29,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:47:29,241 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:47:29,241 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:47:29,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:47:29,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:47:29,242 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:47:29,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:47:29,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:47:29,248 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-09 15:47:44,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-09 15:47:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-09 15:47:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:47:44,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:47:44,817 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] [2018-12-09 15:47:44,818 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:47:44,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:47:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-09 15:47:44,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:47:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:47:44,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:47:44,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:47:44,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:47:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:47:44,974 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-09 15:47:44,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:47:44,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:47:44,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:47:44,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:47:44,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:47:44,988 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-09 15:47:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:47:46,423 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-09 15:47:46,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:47:46,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-09 15:47:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:47:47,179 INFO L225 Difference]: With dead ends: 233471 [2018-12-09 15:47:47,179 INFO L226 Difference]: Without dead ends: 203721 [2018-12-09 15:47:47,181 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-09 15:47:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-09 15:47:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-09 15:47:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-09 15:47:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-09 15:47:52,577 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-09 15:47:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:47:52,578 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-09 15:47:52,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:47:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-09 15:47:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 15:47:52,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:47:52,588 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] [2018-12-09 15:47:52,588 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:47:52,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:47:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-09 15:47:52,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:47:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:47:52,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:47:52,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:47:52,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:47:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:47:52,636 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-09 15:47:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:47:52,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:47:52,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:47:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:47:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:47:52,639 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-09 15:47:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:47:53,216 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-09 15:47:53,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:47:53,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 15:47:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:47:53,534 INFO L225 Difference]: With dead ends: 118891 [2018-12-09 15:47:53,534 INFO L226 Difference]: Without dead ends: 118891 [2018-12-09 15:47:53,535 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-09 15:47:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-09 15:47:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-09 15:47:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-09 15:47:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-09 15:47:56,080 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-09 15:47:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:47:56,081 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-09 15:47:56,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:47:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-09 15:47:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 15:47:56,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:47:56,084 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] [2018-12-09 15:47:56,085 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:47:56,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:47:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-09 15:47:56,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:47:56,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:47:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:47:56,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:47:56,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:47:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:47:56,137 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-09 15:47:56,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:47:56,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:47:56,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:47:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:47:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:47:56,138 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-09 15:47:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:47:59,427 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-09 15:47:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:47:59,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-09 15:47:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:00,282 INFO L225 Difference]: With dead ends: 325271 [2018-12-09 15:48:00,282 INFO L226 Difference]: Without dead ends: 324271 [2018-12-09 15:48:00,282 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-09 15:48:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-09 15:48:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-09 15:48:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-09 15:48:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-09 15:48:05,530 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-09 15:48:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:05,531 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-09 15:48:05,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-09 15:48:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 15:48:05,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:05,535 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] [2018-12-09 15:48:05,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:05,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:05,535 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-09 15:48:05,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:05,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:05,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:05,575 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-09 15:48:05,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:05,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:48:05,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:48:05,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:48:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:48:05,576 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-09 15:48:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:06,269 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-09 15:48:06,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:06,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-09 15:48:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:06,659 INFO L225 Difference]: With dead ends: 163597 [2018-12-09 15:48:06,659 INFO L226 Difference]: Without dead ends: 160992 [2018-12-09 15:48:06,659 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-09 15:48:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-09 15:48:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-09 15:48:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-09 15:48:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-09 15:48:11,950 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-09 15:48:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:11,950 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-09 15:48:11,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:48:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-09 15:48:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 15:48:11,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:11,956 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] [2018-12-09 15:48:11,957 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:11,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-09 15:48:11,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:11,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:12,004 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-09 15:48:12,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:12,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:12,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:12,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:12,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:12,005 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-09 15:48:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:13,848 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-09 15:48:13,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:48:13,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 15:48:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:14,593 INFO L225 Difference]: With dead ends: 289848 [2018-12-09 15:48:14,594 INFO L226 Difference]: Without dead ends: 289008 [2018-12-09 15:48:14,594 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-09 15:48:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-09 15:48:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-09 15:48:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-09 15:48:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-09 15:48:21,244 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-09 15:48:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:21,245 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-09 15:48:21,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-09 15:48:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 15:48:21,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:21,265 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] [2018-12-09 15:48:21,266 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:21,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -252934140, now seen corresponding path program 1 times [2018-12-09 15:48:21,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:21,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:21,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:21,327 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-09 15:48:21,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:21,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:21,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:21,328 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-09 15:48:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:23,198 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-09 15:48:23,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 15:48:23,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 15:48:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:23,956 INFO L225 Difference]: With dead ends: 292568 [2018-12-09 15:48:23,956 INFO L226 Difference]: Without dead ends: 291728 [2018-12-09 15:48:23,956 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-09 15:48:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-09 15:48:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-09 15:48:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-09 15:48:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-09 15:48:28,537 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-09 15:48:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:28,537 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-09 15:48:28,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-09 15:48:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 15:48:28,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:28,597 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] [2018-12-09 15:48:28,597 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:28,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-09 15:48:28,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:28,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:28,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:28,637 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-09 15:48:28,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:28,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:48:28,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:48:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:48:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:48:28,638 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-09 15:48:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:30,315 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-09 15:48:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:30,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 15:48:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:30,992 INFO L225 Difference]: With dead ends: 264420 [2018-12-09 15:48:30,992 INFO L226 Difference]: Without dead ends: 263060 [2018-12-09 15:48:30,992 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-09 15:48:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-09 15:48:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-09 15:48:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-09 15:48:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-09 15:48:38,017 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-09 15:48:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:38,017 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-09 15:48:38,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:48:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-09 15:48:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 15:48:38,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:38,101 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] [2018-12-09 15:48:38,102 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:38,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-09 15:48:38,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:38,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:38,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:38,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:38,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:38,137 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-09 15:48:38,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:38,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:38,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:38,138 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-09 15:48:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:38,453 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-09 15:48:38,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:48:38,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 15:48:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:38,608 INFO L225 Difference]: With dead ends: 78044 [2018-12-09 15:48:38,608 INFO L226 Difference]: Without dead ends: 75732 [2018-12-09 15:48:38,609 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-09 15:48:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-09 15:48:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-09 15:48:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-09 15:48:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-09 15:48:39,989 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-09 15:48:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:39,989 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-09 15:48:39,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-09 15:48:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 15:48:40,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:40,039 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] [2018-12-09 15:48:40,039 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:40,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-09 15:48:40,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:40,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:40,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:40,080 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-09 15:48:40,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:40,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:48:40,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:48:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:48:40,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:48:40,080 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-09 15:48:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:40,552 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-09 15:48:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:40,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 15:48:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:40,773 INFO L225 Difference]: With dead ends: 105528 [2018-12-09 15:48:40,773 INFO L226 Difference]: Without dead ends: 105528 [2018-12-09 15:48:40,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-09 15:48:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-09 15:48:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-09 15:48:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-09 15:48:42,283 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-09 15:48:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:42,283 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-09 15:48:42,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:48:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-09 15:48:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 15:48:42,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:42,339 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] [2018-12-09 15:48:42,339 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:42,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-09 15:48:42,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:42,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:42,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:42,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:42,378 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-09 15:48:42,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:42,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:48:42,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:48:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:48:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:48:42,379 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-09 15:48:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:43,121 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-09 15:48:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:43,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 15:48:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:43,358 INFO L225 Difference]: With dead ends: 113667 [2018-12-09 15:48:43,358 INFO L226 Difference]: Without dead ends: 113667 [2018-12-09 15:48:43,358 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-09 15:48:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-09 15:48:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-09 15:48:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-09 15:48:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-09 15:48:45,065 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-09 15:48:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:45,066 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-09 15:48:45,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:48:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-09 15:48:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 15:48:45,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:45,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:45,140 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:45,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:45,140 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-09 15:48:45,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:45,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:45,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:45,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:45,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:45,187 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-09 15:48:45,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:45,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:45,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:45,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:45,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:45,187 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 6 states. [2018-12-09 15:48:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:45,250 INFO L93 Difference]: Finished difference Result 16164 states and 54990 transitions. [2018-12-09 15:48:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:48:45,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-09 15:48:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:45,267 INFO L225 Difference]: With dead ends: 16164 [2018-12-09 15:48:45,267 INFO L226 Difference]: Without dead ends: 14072 [2018-12-09 15:48:45,268 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-09 15:48:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2018-12-09 15:48:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 13537. [2018-12-09 15:48:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13537 states. [2018-12-09 15:48:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13537 states to 13537 states and 46015 transitions. [2018-12-09 15:48:45,563 INFO L78 Accepts]: Start accepts. Automaton has 13537 states and 46015 transitions. Word has length 78 [2018-12-09 15:48:45,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:45,563 INFO L480 AbstractCegarLoop]: Abstraction has 13537 states and 46015 transitions. [2018-12-09 15:48:45,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 13537 states and 46015 transitions. [2018-12-09 15:48:45,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:48:45,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:45,574 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] [2018-12-09 15:48:45,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:45,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2014372351, now seen corresponding path program 1 times [2018-12-09 15:48:45,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:45,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:45,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:45,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:45,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:45,612 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-09 15:48:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:45,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:45,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:45,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:45,612 INFO L87 Difference]: Start difference. First operand 13537 states and 46015 transitions. Second operand 5 states. [2018-12-09 15:48:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:45,777 INFO L93 Difference]: Finished difference Result 15422 states and 51828 transitions. [2018-12-09 15:48:45,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:45,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 15:48:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:45,795 INFO L225 Difference]: With dead ends: 15422 [2018-12-09 15:48:45,795 INFO L226 Difference]: Without dead ends: 15422 [2018-12-09 15:48:45,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15422 states. [2018-12-09 15:48:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15422 to 13947. [2018-12-09 15:48:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13947 states. [2018-12-09 15:48:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13947 states to 13947 states and 47378 transitions. [2018-12-09 15:48:45,943 INFO L78 Accepts]: Start accepts. Automaton has 13947 states and 47378 transitions. Word has length 97 [2018-12-09 15:48:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:45,943 INFO L480 AbstractCegarLoop]: Abstraction has 13947 states and 47378 transitions. [2018-12-09 15:48:45,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 13947 states and 47378 transitions. [2018-12-09 15:48:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:48:45,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:45,956 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] [2018-12-09 15:48:45,956 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:45,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:45,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1097247648, now seen corresponding path program 1 times [2018-12-09 15:48:45,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:45,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:45,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:45,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:45,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:45,997 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-09 15:48:45,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:45,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:45,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:45,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:45,998 INFO L87 Difference]: Start difference. First operand 13947 states and 47378 transitions. Second operand 6 states. [2018-12-09 15:48:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:46,222 INFO L93 Difference]: Finished difference Result 16687 states and 55800 transitions. [2018-12-09 15:48:46,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:48:46,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-09 15:48:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:46,241 INFO L225 Difference]: With dead ends: 16687 [2018-12-09 15:48:46,241 INFO L226 Difference]: Without dead ends: 16357 [2018-12-09 15:48:46,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-09 15:48:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16357 states. [2018-12-09 15:48:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16357 to 15837. [2018-12-09 15:48:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15837 states. [2018-12-09 15:48:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15837 states to 15837 states and 53450 transitions. [2018-12-09 15:48:46,401 INFO L78 Accepts]: Start accepts. Automaton has 15837 states and 53450 transitions. Word has length 97 [2018-12-09 15:48:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:46,401 INFO L480 AbstractCegarLoop]: Abstraction has 15837 states and 53450 transitions. [2018-12-09 15:48:46,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 15837 states and 53450 transitions. [2018-12-09 15:48:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:48:46,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:46,415 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] [2018-12-09 15:48:46,415 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:46,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2052983683, now seen corresponding path program 2 times [2018-12-09 15:48:46,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:46,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:46,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:46,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:46,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:46,443 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-09 15:48:46,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:46,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:46,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:46,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:46,444 INFO L87 Difference]: Start difference. First operand 15837 states and 53450 transitions. Second operand 5 states. [2018-12-09 15:48:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:46,637 INFO L93 Difference]: Finished difference Result 20664 states and 68496 transitions. [2018-12-09 15:48:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:46,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 15:48:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:46,660 INFO L225 Difference]: With dead ends: 20664 [2018-12-09 15:48:46,660 INFO L226 Difference]: Without dead ends: 20504 [2018-12-09 15:48:46,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20504 states. [2018-12-09 15:48:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20504 to 17570. [2018-12-09 15:48:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17570 states. [2018-12-09 15:48:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17570 states to 17570 states and 58965 transitions. [2018-12-09 15:48:46,857 INFO L78 Accepts]: Start accepts. Automaton has 17570 states and 58965 transitions. Word has length 97 [2018-12-09 15:48:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:46,857 INFO L480 AbstractCegarLoop]: Abstraction has 17570 states and 58965 transitions. [2018-12-09 15:48:46,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 17570 states and 58965 transitions. [2018-12-09 15:48:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:48:46,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:46,874 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] [2018-12-09 15:48:46,874 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:46,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1376937125, now seen corresponding path program 3 times [2018-12-09 15:48:46,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:46,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:46,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:48:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:46,928 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-09 15:48:46,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:46,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:48:46,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:48:46,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:48:46,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:46,929 INFO L87 Difference]: Start difference. First operand 17570 states and 58965 transitions. Second operand 7 states. [2018-12-09 15:48:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:47,204 INFO L93 Difference]: Finished difference Result 21535 states and 71009 transitions. [2018-12-09 15:48:47,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:48:47,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-09 15:48:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:47,227 INFO L225 Difference]: With dead ends: 21535 [2018-12-09 15:48:47,227 INFO L226 Difference]: Without dead ends: 21210 [2018-12-09 15:48:47,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:48:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21210 states. [2018-12-09 15:48:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21210 to 17585. [2018-12-09 15:48:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17585 states. [2018-12-09 15:48:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17585 states to 17585 states and 58942 transitions. [2018-12-09 15:48:47,425 INFO L78 Accepts]: Start accepts. Automaton has 17585 states and 58942 transitions. Word has length 97 [2018-12-09 15:48:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:47,425 INFO L480 AbstractCegarLoop]: Abstraction has 17585 states and 58942 transitions. [2018-12-09 15:48:47,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:48:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17585 states and 58942 transitions. [2018-12-09 15:48:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:48:47,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:48:47,442 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:47,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2066828671, now seen corresponding path program 1 times [2018-12-09 15:48:47,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:47,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:47,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:47,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:48:47,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:47,504 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-09 15:48:47,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:47,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:47,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:47,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:47,505 INFO L87 Difference]: Start difference. First operand 17585 states and 58942 transitions. Second operand 6 states. [2018-12-09 15:48:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:47,631 INFO L93 Difference]: Finished difference Result 20760 states and 67307 transitions. [2018-12-09 15:48:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:48:47,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-09 15:48:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:47,655 INFO L225 Difference]: With dead ends: 20760 [2018-12-09 15:48:47,655 INFO L226 Difference]: Without dead ends: 20685 [2018-12-09 15:48:47,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:48:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20685 states. [2018-12-09 15:48:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20685 to 18285. [2018-12-09 15:48:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18285 states. [2018-12-09 15:48:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18285 states to 18285 states and 60187 transitions. [2018-12-09 15:48:47,893 INFO L78 Accepts]: Start accepts. Automaton has 18285 states and 60187 transitions. Word has length 97 [2018-12-09 15:48:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:47,893 INFO L480 AbstractCegarLoop]: Abstraction has 18285 states and 60187 transitions. [2018-12-09 15:48:47,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 18285 states and 60187 transitions. [2018-12-09 15:48:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 15:48:47,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:48:47,908 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:47,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:47,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1042134750, now seen corresponding path program 1 times [2018-12-09 15:48:47,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:47,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:47,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:47,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:47,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:47,950 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-09 15:48:47,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:47,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:47,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:47,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:47,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:47,951 INFO L87 Difference]: Start difference. First operand 18285 states and 60187 transitions. Second operand 5 states. [2018-12-09 15:48:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:48,104 INFO L93 Difference]: Finished difference Result 24187 states and 77863 transitions. [2018-12-09 15:48:48,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:48:48,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-09 15:48:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:48,129 INFO L225 Difference]: With dead ends: 24187 [2018-12-09 15:48:48,129 INFO L226 Difference]: Without dead ends: 23652 [2018-12-09 15:48:48,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:48:48,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23652 states. [2018-12-09 15:48:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23652 to 18930. [2018-12-09 15:48:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18930 states. [2018-12-09 15:48:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18930 states to 18930 states and 61813 transitions. [2018-12-09 15:48:48,344 INFO L78 Accepts]: Start accepts. Automaton has 18930 states and 61813 transitions. Word has length 97 [2018-12-09 15:48:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:48,344 INFO L480 AbstractCegarLoop]: Abstraction has 18930 states and 61813 transitions. [2018-12-09 15:48:48,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18930 states and 61813 transitions. [2018-12-09 15:48:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:48,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:48,361 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] [2018-12-09 15:48:48,362 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:48,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2038420724, now seen corresponding path program 1 times [2018-12-09 15:48:48,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:48,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:48,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:48,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:48,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:48,433 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-09 15:48:48,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:48,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 15:48:48,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 15:48:48,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 15:48:48,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 15:48:48,434 INFO L87 Difference]: Start difference. First operand 18930 states and 61813 transitions. Second operand 9 states. [2018-12-09 15:48:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:49,049 INFO L93 Difference]: Finished difference Result 32666 states and 104934 transitions. [2018-12-09 15:48:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 15:48:49,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-09 15:48:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:49,086 INFO L225 Difference]: With dead ends: 32666 [2018-12-09 15:48:49,086 INFO L226 Difference]: Without dead ends: 32538 [2018-12-09 15:48:49,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-09 15:48:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32538 states. [2018-12-09 15:48:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32538 to 24258. [2018-12-09 15:48:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24258 states. [2018-12-09 15:48:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24258 states to 24258 states and 78782 transitions. [2018-12-09 15:48:49,393 INFO L78 Accepts]: Start accepts. Automaton has 24258 states and 78782 transitions. Word has length 99 [2018-12-09 15:48:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:49,393 INFO L480 AbstractCegarLoop]: Abstraction has 24258 states and 78782 transitions. [2018-12-09 15:48:49,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 15:48:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 24258 states and 78782 transitions. [2018-12-09 15:48:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:49,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:49,416 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] [2018-12-09 15:48:49,416 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:49,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash -793656243, now seen corresponding path program 1 times [2018-12-09 15:48:49,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:49,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:49,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:49,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:49,479 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-09 15:48:49,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:49,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:48:49,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:48:49,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:48:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:49,480 INFO L87 Difference]: Start difference. First operand 24258 states and 78782 transitions. Second operand 7 states. [2018-12-09 15:48:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:49,916 INFO L93 Difference]: Finished difference Result 38026 states and 122512 transitions. [2018-12-09 15:48:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 15:48:49,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 15:48:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:49,958 INFO L225 Difference]: With dead ends: 38026 [2018-12-09 15:48:49,958 INFO L226 Difference]: Without dead ends: 36926 [2018-12-09 15:48:49,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36926 states. [2018-12-09 15:48:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36926 to 23748. [2018-12-09 15:48:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23748 states. [2018-12-09 15:48:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23748 states to 23748 states and 76819 transitions. [2018-12-09 15:48:50,271 INFO L78 Accepts]: Start accepts. Automaton has 23748 states and 76819 transitions. Word has length 99 [2018-12-09 15:48:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:50,272 INFO L480 AbstractCegarLoop]: Abstraction has 23748 states and 76819 transitions. [2018-12-09 15:48:50,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:48:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23748 states and 76819 transitions. [2018-12-09 15:48:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:50,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:50,293 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] [2018-12-09 15:48:50,293 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:50,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1963977170, now seen corresponding path program 1 times [2018-12-09 15:48:50,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:50,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:50,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:50,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:50,359 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-09 15:48:50,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:50,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:50,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:50,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:50,360 INFO L87 Difference]: Start difference. First operand 23748 states and 76819 transitions. Second operand 6 states. [2018-12-09 15:48:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:50,450 INFO L93 Difference]: Finished difference Result 17635 states and 57458 transitions. [2018-12-09 15:48:50,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:48:50,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 15:48:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:50,469 INFO L225 Difference]: With dead ends: 17635 [2018-12-09 15:48:50,469 INFO L226 Difference]: Without dead ends: 17635 [2018-12-09 15:48:50,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:48:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17635 states. [2018-12-09 15:48:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17635 to 16060. [2018-12-09 15:48:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16060 states. [2018-12-09 15:48:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16060 states to 16060 states and 52773 transitions. [2018-12-09 15:48:50,682 INFO L78 Accepts]: Start accepts. Automaton has 16060 states and 52773 transitions. Word has length 99 [2018-12-09 15:48:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:50,682 INFO L480 AbstractCegarLoop]: Abstraction has 16060 states and 52773 transitions. [2018-12-09 15:48:50,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 16060 states and 52773 transitions. [2018-12-09 15:48:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:50,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:50,695 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] [2018-12-09 15:48:50,695 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:50,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash 881084081, now seen corresponding path program 1 times [2018-12-09 15:48:50,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:50,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:50,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:50,751 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-09 15:48:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:48:50,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:48:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:48:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:50,752 INFO L87 Difference]: Start difference. First operand 16060 states and 52773 transitions. Second operand 7 states. [2018-12-09 15:48:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:50,941 INFO L93 Difference]: Finished difference Result 17589 states and 57474 transitions. [2018-12-09 15:48:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:48:50,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 15:48:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:50,960 INFO L225 Difference]: With dead ends: 17589 [2018-12-09 15:48:50,961 INFO L226 Difference]: Without dead ends: 17589 [2018-12-09 15:48:50,961 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-09 15:48:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17589 states. [2018-12-09 15:48:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17589 to 15970. [2018-12-09 15:48:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15970 states. [2018-12-09 15:48:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15970 states to 15970 states and 52521 transitions. [2018-12-09 15:48:51,127 INFO L78 Accepts]: Start accepts. Automaton has 15970 states and 52521 transitions. Word has length 99 [2018-12-09 15:48:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:51,127 INFO L480 AbstractCegarLoop]: Abstraction has 15970 states and 52521 transitions. [2018-12-09 15:48:51,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:48:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 15970 states and 52521 transitions. [2018-12-09 15:48:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:51,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:51,141 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] [2018-12-09 15:48:51,141 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:51,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -302263216, now seen corresponding path program 1 times [2018-12-09 15:48:51,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:51,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:51,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:51,225 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-09 15:48:51,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:51,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 15:48:51,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:48:51,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:48:51,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:48:51,226 INFO L87 Difference]: Start difference. First operand 15970 states and 52521 transitions. Second operand 8 states. [2018-12-09 15:48:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:51,508 INFO L93 Difference]: Finished difference Result 20725 states and 67497 transitions. [2018-12-09 15:48:51,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 15:48:51,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-09 15:48:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:51,531 INFO L225 Difference]: With dead ends: 20725 [2018-12-09 15:48:51,532 INFO L226 Difference]: Without dead ends: 20597 [2018-12-09 15:48:51,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-09 15:48:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20597 states. [2018-12-09 15:48:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20597 to 16691. [2018-12-09 15:48:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16691 states. [2018-12-09 15:48:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16691 states to 16691 states and 54567 transitions. [2018-12-09 15:48:51,722 INFO L78 Accepts]: Start accepts. Automaton has 16691 states and 54567 transitions. Word has length 99 [2018-12-09 15:48:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:51,722 INFO L480 AbstractCegarLoop]: Abstraction has 16691 states and 54567 transitions. [2018-12-09 15:48:51,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:48:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16691 states and 54567 transitions. [2018-12-09 15:48:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:51,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:51,736 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] [2018-12-09 15:48:51,736 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:51,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash 659350801, now seen corresponding path program 1 times [2018-12-09 15:48:51,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:51,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:51,791 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-09 15:48:51,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:51,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:48:51,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:48:51,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:48:51,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:51,792 INFO L87 Difference]: Start difference. First operand 16691 states and 54567 transitions. Second operand 7 states. [2018-12-09 15:48:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:52,057 INFO L93 Difference]: Finished difference Result 22271 states and 71965 transitions. [2018-12-09 15:48:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:48:52,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-09 15:48:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:52,082 INFO L225 Difference]: With dead ends: 22271 [2018-12-09 15:48:52,082 INFO L226 Difference]: Without dead ends: 22271 [2018-12-09 15:48:52,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22271 states. [2018-12-09 15:48:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22271 to 18226. [2018-12-09 15:48:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18226 states. [2018-12-09 15:48:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18226 states to 18226 states and 59616 transitions. [2018-12-09 15:48:52,277 INFO L78 Accepts]: Start accepts. Automaton has 18226 states and 59616 transitions. Word has length 99 [2018-12-09 15:48:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:52,277 INFO L480 AbstractCegarLoop]: Abstraction has 18226 states and 59616 transitions. [2018-12-09 15:48:52,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:48:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 18226 states and 59616 transitions. [2018-12-09 15:48:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:52,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:52,292 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] [2018-12-09 15:48:52,292 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:52,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:52,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1904115282, now seen corresponding path program 1 times [2018-12-09 15:48:52,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:52,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:52,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:52,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:52,343 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-09 15:48:52,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:52,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:52,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:52,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:52,343 INFO L87 Difference]: Start difference. First operand 18226 states and 59616 transitions. Second operand 6 states. [2018-12-09 15:48:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:52,437 INFO L93 Difference]: Finished difference Result 29443 states and 98225 transitions. [2018-12-09 15:48:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:48:52,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 15:48:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:52,473 INFO L225 Difference]: With dead ends: 29443 [2018-12-09 15:48:52,474 INFO L226 Difference]: Without dead ends: 29443 [2018-12-09 15:48:52,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29443 states. [2018-12-09 15:48:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29443 to 18086. [2018-12-09 15:48:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18086 states. [2018-12-09 15:48:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18086 states to 18086 states and 59124 transitions. [2018-12-09 15:48:52,716 INFO L78 Accepts]: Start accepts. Automaton has 18086 states and 59124 transitions. Word has length 99 [2018-12-09 15:48:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:52,717 INFO L480 AbstractCegarLoop]: Abstraction has 18086 states and 59124 transitions. [2018-12-09 15:48:52,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 18086 states and 59124 transitions. [2018-12-09 15:48:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:52,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:52,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:48:52,732 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:52,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 83704689, now seen corresponding path program 1 times [2018-12-09 15:48:52,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:52,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:52,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:52,780 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-09 15:48:52,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:52,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:52,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:52,781 INFO L87 Difference]: Start difference. First operand 18086 states and 59124 transitions. Second operand 5 states. [2018-12-09 15:48:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:52,849 INFO L93 Difference]: Finished difference Result 27217 states and 90251 transitions. [2018-12-09 15:48:52,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:48:52,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-09 15:48:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:52,882 INFO L225 Difference]: With dead ends: 27217 [2018-12-09 15:48:52,882 INFO L226 Difference]: Without dead ends: 27217 [2018-12-09 15:48:52,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27217 states. [2018-12-09 15:48:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27217 to 16586. [2018-12-09 15:48:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16586 states. [2018-12-09 15:48:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16586 states to 16586 states and 53663 transitions. [2018-12-09 15:48:53,145 INFO L78 Accepts]: Start accepts. Automaton has 16586 states and 53663 transitions. Word has length 99 [2018-12-09 15:48:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:53,145 INFO L480 AbstractCegarLoop]: Abstraction has 16586 states and 53663 transitions. [2018-12-09 15:48:53,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 16586 states and 53663 transitions. [2018-12-09 15:48:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 15:48:53,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:53,157 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] [2018-12-09 15:48:53,157 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:53,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash 564421105, now seen corresponding path program 1 times [2018-12-09 15:48:53,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:53,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:53,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:53,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:53,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:53,214 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-09 15:48:53,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:53,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 15:48:53,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:48:53,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:48:53,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:48:53,214 INFO L87 Difference]: Start difference. First operand 16586 states and 53663 transitions. Second operand 6 states. [2018-12-09 15:48:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:53,314 INFO L93 Difference]: Finished difference Result 14858 states and 47215 transitions. [2018-12-09 15:48:53,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:48:53,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-09 15:48:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:53,328 INFO L225 Difference]: With dead ends: 14858 [2018-12-09 15:48:53,329 INFO L226 Difference]: Without dead ends: 14858 [2018-12-09 15:48:53,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:48:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14858 states. [2018-12-09 15:48:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14858 to 11537. [2018-12-09 15:48:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11537 states. [2018-12-09 15:48:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 37486 transitions. [2018-12-09 15:48:53,453 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 37486 transitions. Word has length 99 [2018-12-09 15:48:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:53,454 INFO L480 AbstractCegarLoop]: Abstraction has 11537 states and 37486 transitions. [2018-12-09 15:48:53,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:48:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 37486 transitions. [2018-12-09 15:48:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:48:53,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:53,464 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] [2018-12-09 15:48:53,464 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:53,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-09 15:48:53,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:53,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:53,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:53,515 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-09 15:48:53,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:53,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:48:53,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:48:53,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:48:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:48:53,515 INFO L87 Difference]: Start difference. First operand 11537 states and 37486 transitions. Second operand 5 states. [2018-12-09 15:48:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:53,642 INFO L93 Difference]: Finished difference Result 12945 states and 41998 transitions. [2018-12-09 15:48:53,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:48:53,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-09 15:48:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:53,655 INFO L225 Difference]: With dead ends: 12945 [2018-12-09 15:48:53,656 INFO L226 Difference]: Without dead ends: 12817 [2018-12-09 15:48:53,656 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-09 15:48:53,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12817 states. [2018-12-09 15:48:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12817 to 11729. [2018-12-09 15:48:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11729 states. [2018-12-09 15:48:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11729 states to 11729 states and 38046 transitions. [2018-12-09 15:48:53,776 INFO L78 Accepts]: Start accepts. Automaton has 11729 states and 38046 transitions. Word has length 101 [2018-12-09 15:48:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:53,776 INFO L480 AbstractCegarLoop]: Abstraction has 11729 states and 38046 transitions. [2018-12-09 15:48:53,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:48:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11729 states and 38046 transitions. [2018-12-09 15:48:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:48:53,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:53,787 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] [2018-12-09 15:48:53,787 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:53,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:53,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-09 15:48:53,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:53,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:53,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:53,852 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-09 15:48:53,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:53,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:48:53,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:48:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:48:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:53,853 INFO L87 Difference]: Start difference. First operand 11729 states and 38046 transitions. Second operand 7 states. [2018-12-09 15:48:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:54,045 INFO L93 Difference]: Finished difference Result 22201 states and 72404 transitions. [2018-12-09 15:48:54,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:48:54,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-09 15:48:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:54,057 INFO L225 Difference]: With dead ends: 22201 [2018-12-09 15:48:54,057 INFO L226 Difference]: Without dead ends: 11329 [2018-12-09 15:48:54,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:48:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11329 states. [2018-12-09 15:48:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11329 to 11069. [2018-12-09 15:48:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11069 states. [2018-12-09 15:48:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11069 states to 11069 states and 36126 transitions. [2018-12-09 15:48:54,161 INFO L78 Accepts]: Start accepts. Automaton has 11069 states and 36126 transitions. Word has length 101 [2018-12-09 15:48:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:54,162 INFO L480 AbstractCegarLoop]: Abstraction has 11069 states and 36126 transitions. [2018-12-09 15:48:54,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:48:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 11069 states and 36126 transitions. [2018-12-09 15:48:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:48:54,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:54,171 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] [2018-12-09 15:48:54,171 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:54,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-12-09 15:48:54,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:54,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:54,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:48:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:54,242 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-09 15:48:54,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:54,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 15:48:54,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:48:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:48:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:48:54,243 INFO L87 Difference]: Start difference. First operand 11069 states and 36126 transitions. Second operand 7 states. [2018-12-09 15:48:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:54,443 INFO L93 Difference]: Finished difference Result 18645 states and 61476 transitions. [2018-12-09 15:48:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:48:54,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-09 15:48:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:54,452 INFO L225 Difference]: With dead ends: 18645 [2018-12-09 15:48:54,452 INFO L226 Difference]: Without dead ends: 7616 [2018-12-09 15:48:54,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:48:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2018-12-09 15:48:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7616. [2018-12-09 15:48:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-12-09 15:48:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 25453 transitions. [2018-12-09 15:48:54,526 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 25453 transitions. Word has length 101 [2018-12-09 15:48:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:54,526 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 25453 transitions. [2018-12-09 15:48:54,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:48:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 25453 transitions. [2018-12-09 15:48:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:48:54,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 15:48:54,533 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:54,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-12-09 15:48:54,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:54,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:54,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:54,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:48:54,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:48:54,626 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-09 15:48:54,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:48:54,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 15:48:54,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 15:48:54,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 15:48:54,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:48:54,627 INFO L87 Difference]: Start difference. First operand 7616 states and 25453 transitions. Second operand 12 states. [2018-12-09 15:48:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:48:55,035 INFO L93 Difference]: Finished difference Result 14444 states and 48614 transitions. [2018-12-09 15:48:55,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 15:48:55,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-09 15:48:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:48:55,047 INFO L225 Difference]: With dead ends: 14444 [2018-12-09 15:48:55,047 INFO L226 Difference]: Without dead ends: 10540 [2018-12-09 15:48:55,047 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-09 15:48:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2018-12-09 15:48:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 9860. [2018-12-09 15:48:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-12-09 15:48:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 32320 transitions. [2018-12-09 15:48:55,141 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 32320 transitions. Word has length 101 [2018-12-09 15:48:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:48:55,141 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 32320 transitions. [2018-12-09 15:48:55,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 15:48:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 32320 transitions. [2018-12-09 15:48:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 15:48:55,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:48:55,149 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] [2018-12-09 15:48:55,149 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:48:55,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:48:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-12-09 15:48:55,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:48:55,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:48:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:55,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:48:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:48:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:48:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:48:55,201 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 15:48:55,272 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 15:48:55,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:48:55 BasicIcfg [2018-12-09 15:48:55,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:48:55,274 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:48:55,274 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:48:55,274 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:48:55,274 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:47:29" (3/4) ... [2018-12-09 15:48:55,276 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 15:48:55,350 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_415089cb-e037-45ff-9a30-cd41d59050e3/bin-2019/uautomizer/witness.graphml [2018-12-09 15:48:55,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:48:55,351 INFO L168 Benchmark]: Toolchain (without parser) took 86968.38 ms. Allocated memory was 1.0 GB in the beginning and 8.3 GB in the end (delta: 7.2 GB). Free memory was 949.5 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-12-09 15:48:55,351 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:48:55,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:55,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:55,352 INFO L168 Benchmark]: Boogie Preprocessor took 27.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:55,352 INFO L168 Benchmark]: RCFGBuilder took 344.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:55,352 INFO L168 Benchmark]: TraceAbstraction took 86110.89 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.1 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-09 15:48:55,353 INFO L168 Benchmark]: Witness Printer took 76.24 ms. Allocated memory is still 8.3 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-12-09 15:48:55,354 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86110.89 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.1 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 76.24 ms. Allocated memory is still 8.3 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 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] [L673] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L674] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L676] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L678] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L679] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L680] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L681] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L682] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L683] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L684] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L690] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L691] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L692] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L693] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L694] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L696] -1 int z = 0; VAL [__unbuffered_cnt=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] [L697] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L698] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L774] -1 pthread_t t2494; VAL [__unbuffered_cnt=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] [L775] FCALL, FORK -1 pthread_create(&t2494, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L776] -1 pthread_t t2495; VAL [__unbuffered_cnt=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] [L777] FCALL, FORK -1 pthread_create(&t2495, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L778] -1 pthread_t t2496; VAL [__unbuffered_cnt=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] [L779] FCALL, FORK -1 pthread_create(&t2496, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L737] 0 y$w_buff1 = y$w_buff0 [L738] 0 y$w_buff0 = 2 [L739] 0 y$w_buff1_used = y$w_buff0_used [L740] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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] [L742] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L743] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L744] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L745] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L746] 0 y$r_buff0_thd3 = (_Bool)1 [L749] 0 z = 1 VAL [__unbuffered_cnt=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] [L702] 1 z = 2 [L705] 1 x = 1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=1, 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=2] [L752] 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, 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=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=2] [L717] 2 x = 2 [L720] 2 y = 1 VAL [__unbuffered_cnt=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=2, 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=2] [L752] 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) [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=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=2, 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=2] [L753] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L754] 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, 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=2, 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=2] [L754] 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 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=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=2, 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=2] [L755] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L756] 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, 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=2, 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=2] [L756] 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 [L759] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2, 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=2] [L723] 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=2, 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=2, 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=2] [L723] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, 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=2, 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=2] [L723] 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=2, 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=2, 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=2] [L723] 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) [L724] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, 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=2, 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=2] [L724] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L725] 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, 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=2, 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=2] [L725] 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 [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, 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=2, 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=2] [L726] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L727] 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, 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=2, 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=2] [L727] 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 [L730] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=2, 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=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, 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=2, 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=2] [L785] 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, 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=2, 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=2] [L785] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, 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=2, 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=2] [L785] 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, 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=2, 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=2] [L785] -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) [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, 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=2, 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=2] [L786] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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, 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=2, 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=2] [L787] -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 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, 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=2, 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=2] [L788] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 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, 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=2, 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=2] [L789] -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 [L792] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L793] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L794] -1 y$flush_delayed = weak$$choice2 [L795] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L796] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L796] -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) [L797] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L797] -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)) [L798] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L798] -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)) [L799] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L799] -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)) [L800] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L800] -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)) [L801] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L801] -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)) [L802] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L802] -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)) [L803] -1 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L804] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L804] -1 y = y$flush_delayed ? y$mem_tmp : y [L805] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 197 locations, 3 error locations. UNSAFE Result, 86.0s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 22.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7507 SDtfs, 7648 SDslu, 17699 SDs, 0 SdLazy, 6429 SolverSat, 444 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 104 SyntacticMatches, 14 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220276occurred in iteration=7, 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: 45.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 623838 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2641 NumberOfCodeBlocks, 2641 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2510 ConstructedInterpolants, 0 QuantifiedInterpolants, 565828 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...