./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_pso.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_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/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 278d8bd7c1a97e577a985a40cd86e40d2394589b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 11:33:43,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:33:43,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:33:43,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:33:43,753 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:33:43,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:33:43,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:33:43,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:33:43,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:33:43,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:33:43,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:33:43,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:33:43,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:33:43,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:33:43,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:33:43,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:33:43,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:33:43,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:33:43,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:33:43,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:33:43,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:33:43,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:33:43,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:33:43,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:33:43,763 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:33:43,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:33:43,764 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:33:43,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:33:43,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:33:43,766 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:33:43,766 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:33:43,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:33:43,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:33:43,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:33:43,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:33:43,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:33:43,768 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 11:33:43,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:33:43,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:33:43,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 11:33:43,775 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 11:33:43,776 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 11:33:43,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 11:33:43,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 11:33:43,777 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 11:33:43,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 11:33:43,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:33:43,778 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 11:33:43,778 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 11:33:43,778 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 11:33:43,778 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 11:33:43,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 11:33:43,778 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_24b29b74-c10b-43be-b2be-812865822632/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 -> 278d8bd7c1a97e577a985a40cd86e40d2394589b [2018-12-08 11:33:43,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:33:43,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:33:43,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:33:43,809 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:33:43,809 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:33:43,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-12-08 11:33:43,854 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/data/b246b7eae/8e89530afc1f40b2987f1915fcde3ebf/FLAG1974710a5 [2018-12-08 11:33:44,312 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:33:44,312 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/sv-benchmarks/c/pthread-wmm/safe030_pso.opt_false-unreach-call.i [2018-12-08 11:33:44,320 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/data/b246b7eae/8e89530afc1f40b2987f1915fcde3ebf/FLAG1974710a5 [2018-12-08 11:33:44,329 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/data/b246b7eae/8e89530afc1f40b2987f1915fcde3ebf [2018-12-08 11:33:44,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:33:44,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 11:33:44,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:33:44,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:33:44,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:33:44,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44, skipping insertion in model container [2018-12-08 11:33:44,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:33:44,362 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:33:44,541 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:33:44,548 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:33:44,632 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:33:44,662 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:33:44,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44 WrapperNode [2018-12-08 11:33:44,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:33:44,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 11:33:44,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 11:33:44,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 11:33:44,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 11:33:44,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:33:44,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:33:44,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:33:44,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... [2018-12-08 11:33:44,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:33:44,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:33:44,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:33:44,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:33:44,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/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-08 11:33:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 11:33:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 11:33:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 11:33:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 11:33:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 11:33:44,752 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 11:33:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 11:33:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 11:33:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 11:33:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 11:33:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 11:33:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:33:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:33:44,755 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 11:33:45,080 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:33:45,081 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 11:33:45,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:33:45 BoogieIcfgContainer [2018-12-08 11:33:45,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:33:45,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 11:33:45,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 11:33:45,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 11:33:45,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:33:44" (1/3) ... [2018-12-08 11:33:45,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfeb976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:33:45, skipping insertion in model container [2018-12-08 11:33:45,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:33:44" (2/3) ... [2018-12-08 11:33:45,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfeb976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:33:45, skipping insertion in model container [2018-12-08 11:33:45,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:33:45" (3/3) ... [2018-12-08 11:33:45,087 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt_false-unreach-call.i [2018-12-08 11:33:45,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,117 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,117 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,117 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,118 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,119 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,119 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,119 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,119 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,119 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,119 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,119 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,120 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,121 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,122 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,122 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,122 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,122 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,122 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,122 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,122 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,123 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,123 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,123 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,123 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,123 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,123 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,123 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,124 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,124 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,125 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,125 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,126 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,127 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,128 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,129 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 11:33:45,139 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 11:33:45,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 11:33:45,146 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 11:33:45,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 11:33:45,169 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 11:33:45,169 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 11:33:45,170 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 11:33:45,170 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 11:33:45,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 11:33:45,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 11:33:45,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 11:33:45,170 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 11:33:45,170 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 11:33:45,176 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154places, 191 transitions [2018-12-08 11:34:00,284 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128911 states. [2018-12-08 11:34:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 128911 states. [2018-12-08 11:34:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 11:34:00,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:00,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] [2018-12-08 11:34:00,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:00,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791117, now seen corresponding path program 1 times [2018-12-08 11:34:00,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:00,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:00,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:00,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:00,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-08 11:34:00,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:00,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:34:00,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:34:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:34:00,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:34:00,457 INFO L87 Difference]: Start difference. First operand 128911 states. Second operand 4 states. [2018-12-08 11:34:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:01,976 INFO L93 Difference]: Finished difference Result 233471 states and 1098323 transitions. [2018-12-08 11:34:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:34:01,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-08 11:34:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:02,711 INFO L225 Difference]: With dead ends: 233471 [2018-12-08 11:34:02,711 INFO L226 Difference]: Without dead ends: 203721 [2018-12-08 11:34:02,712 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-08 11:34:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203721 states. [2018-12-08 11:34:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203721 to 118891. [2018-12-08 11:34:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-08 11:34:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559774 transitions. [2018-12-08 11:34:08,681 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559774 transitions. Word has length 42 [2018-12-08 11:34:08,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:08,682 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559774 transitions. [2018-12-08 11:34:08,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:34:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559774 transitions. [2018-12-08 11:34:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 11:34:08,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:08,691 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-08 11:34:08,691 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:08,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1696589112, now seen corresponding path program 1 times [2018-12-08 11:34:08,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:08,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:08,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:08,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:08,745 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-08 11:34:08,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:08,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:34:08,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:34:08,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:34:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:34:08,747 INFO L87 Difference]: Start difference. First operand 118891 states and 559774 transitions. Second operand 3 states. [2018-12-08 11:34:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:09,321 INFO L93 Difference]: Finished difference Result 118891 states and 559659 transitions. [2018-12-08 11:34:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:34:09,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-08 11:34:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:09,636 INFO L225 Difference]: With dead ends: 118891 [2018-12-08 11:34:09,636 INFO L226 Difference]: Without dead ends: 118891 [2018-12-08 11:34:09,637 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-08 11:34:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118891 states. [2018-12-08 11:34:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118891 to 118891. [2018-12-08 11:34:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118891 states. [2018-12-08 11:34:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118891 states to 118891 states and 559659 transitions. [2018-12-08 11:34:12,290 INFO L78 Accepts]: Start accepts. Automaton has 118891 states and 559659 transitions. Word has length 49 [2018-12-08 11:34:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:12,290 INFO L480 AbstractCegarLoop]: Abstraction has 118891 states and 559659 transitions. [2018-12-08 11:34:12,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:34:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 118891 states and 559659 transitions. [2018-12-08 11:34:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 11:34:12,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:12,294 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-08 11:34:12,294 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:12,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 46221223, now seen corresponding path program 1 times [2018-12-08 11:34:12,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:12,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:12,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:12,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:12,333 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-08 11:34:12,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:12,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:34:12,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:34:12,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:34:12,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:34:12,334 INFO L87 Difference]: Start difference. First operand 118891 states and 559659 transitions. Second operand 5 states. [2018-12-08 11:34:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:14,254 INFO L93 Difference]: Finished difference Result 325271 states and 1470363 transitions. [2018-12-08 11:34:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:34:14,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-08 11:34:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:15,123 INFO L225 Difference]: With dead ends: 325271 [2018-12-08 11:34:15,123 INFO L226 Difference]: Without dead ends: 324271 [2018-12-08 11:34:15,123 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-08 11:34:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324271 states. [2018-12-08 11:34:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324271 to 186421. [2018-12-08 11:34:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186421 states. [2018-12-08 11:34:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186421 states to 186421 states and 842758 transitions. [2018-12-08 11:34:22,413 INFO L78 Accepts]: Start accepts. Automaton has 186421 states and 842758 transitions. Word has length 49 [2018-12-08 11:34:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:22,414 INFO L480 AbstractCegarLoop]: Abstraction has 186421 states and 842758 transitions. [2018-12-08 11:34:22,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:34:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 186421 states and 842758 transitions. [2018-12-08 11:34:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 11:34:22,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:22,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:34:22,418 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:22,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 764594298, now seen corresponding path program 1 times [2018-12-08 11:34:22,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:22,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:22,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:22,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:22,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:22,451 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-08 11:34:22,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:22,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:34:22,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:34:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:34:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:34:22,452 INFO L87 Difference]: Start difference. First operand 186421 states and 842758 transitions. Second operand 4 states. [2018-12-08 11:34:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:23,500 INFO L93 Difference]: Finished difference Result 163597 states and 726959 transitions. [2018-12-08 11:34:23,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:34:23,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-08 11:34:23,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:23,887 INFO L225 Difference]: With dead ends: 163597 [2018-12-08 11:34:23,887 INFO L226 Difference]: Without dead ends: 160992 [2018-12-08 11:34:23,887 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-08 11:34:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160992 states. [2018-12-08 11:34:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160992 to 160992. [2018-12-08 11:34:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160992 states. [2018-12-08 11:34:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160992 states to 160992 states and 718277 transitions. [2018-12-08 11:34:29,174 INFO L78 Accepts]: Start accepts. Automaton has 160992 states and 718277 transitions. Word has length 50 [2018-12-08 11:34:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:29,175 INFO L480 AbstractCegarLoop]: Abstraction has 160992 states and 718277 transitions. [2018-12-08 11:34:29,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:34:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 160992 states and 718277 transitions. [2018-12-08 11:34:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 11:34:29,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:29,180 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-08 11:34:29,180 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:29,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash 315183364, now seen corresponding path program 1 times [2018-12-08 11:34:29,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:29,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:29,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:29,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:29,222 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-08 11:34:29,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:29,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:34:29,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:34:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:34:29,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:34:29,223 INFO L87 Difference]: Start difference. First operand 160992 states and 718277 transitions. Second operand 5 states. [2018-12-08 11:34:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:31,017 INFO L93 Difference]: Finished difference Result 289848 states and 1287330 transitions. [2018-12-08 11:34:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:34:31,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-08 11:34:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:31,752 INFO L225 Difference]: With dead ends: 289848 [2018-12-08 11:34:31,752 INFO L226 Difference]: Without dead ends: 289008 [2018-12-08 11:34:31,753 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-08 11:34:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289008 states. [2018-12-08 11:34:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289008 to 169612. [2018-12-08 11:34:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169612 states. [2018-12-08 11:34:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169612 states to 169612 states and 753930 transitions. [2018-12-08 11:34:38,399 INFO L78 Accepts]: Start accepts. Automaton has 169612 states and 753930 transitions. Word has length 51 [2018-12-08 11:34:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:38,399 INFO L480 AbstractCegarLoop]: Abstraction has 169612 states and 753930 transitions. [2018-12-08 11:34:38,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:34:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 169612 states and 753930 transitions. [2018-12-08 11:34:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 11:34:38,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:38,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:34:38,419 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:38,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:38,419 INFO L82 PathProgramCache]: Analyzing trace with hash 336759908, now seen corresponding path program 1 times [2018-12-08 11:34:38,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:38,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:38,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:38,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:38,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:38,469 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-08 11:34:38,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:38,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:34:38,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:34:38,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:34:38,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:34:38,470 INFO L87 Difference]: Start difference. First operand 169612 states and 753930 transitions. Second operand 6 states. [2018-12-08 11:34:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:40,445 INFO L93 Difference]: Finished difference Result 292568 states and 1275883 transitions. [2018-12-08 11:34:40,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 11:34:40,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-08 11:34:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:41,200 INFO L225 Difference]: With dead ends: 292568 [2018-12-08 11:34:41,200 INFO L226 Difference]: Without dead ends: 291728 [2018-12-08 11:34:41,200 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-08 11:34:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291728 states. [2018-12-08 11:34:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291728 to 164644. [2018-12-08 11:34:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164644 states. [2018-12-08 11:34:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164644 states to 164644 states and 731936 transitions. [2018-12-08 11:34:45,503 INFO L78 Accepts]: Start accepts. Automaton has 164644 states and 731936 transitions. Word has length 58 [2018-12-08 11:34:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:45,504 INFO L480 AbstractCegarLoop]: Abstraction has 164644 states and 731936 transitions. [2018-12-08 11:34:45,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:34:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 164644 states and 731936 transitions. [2018-12-08 11:34:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 11:34:45,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:45,563 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-08 11:34:45,563 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:45,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:45,564 INFO L82 PathProgramCache]: Analyzing trace with hash 655738884, now seen corresponding path program 1 times [2018-12-08 11:34:45,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:45,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:45,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:45,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:45,605 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-08 11:34:45,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:45,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:34:45,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:34:45,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:34:45,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:34:45,606 INFO L87 Difference]: Start difference. First operand 164644 states and 731936 transitions. Second operand 4 states. [2018-12-08 11:34:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:47,258 INFO L93 Difference]: Finished difference Result 264420 states and 1161188 transitions. [2018-12-08 11:34:47,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:34:47,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-08 11:34:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:47,926 INFO L225 Difference]: With dead ends: 264420 [2018-12-08 11:34:47,927 INFO L226 Difference]: Without dead ends: 263060 [2018-12-08 11:34:47,927 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-08 11:34:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263060 states. [2018-12-08 11:34:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263060 to 220276. [2018-12-08 11:34:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220276 states. [2018-12-08 11:34:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220276 states to 220276 states and 976572 transitions. [2018-12-08 11:34:55,003 INFO L78 Accepts]: Start accepts. Automaton has 220276 states and 976572 transitions. Word has length 65 [2018-12-08 11:34:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:55,004 INFO L480 AbstractCegarLoop]: Abstraction has 220276 states and 976572 transitions. [2018-12-08 11:34:55,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:34:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 220276 states and 976572 transitions. [2018-12-08 11:34:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 11:34:55,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:55,088 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-08 11:34:55,089 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:55,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2009048581, now seen corresponding path program 1 times [2018-12-08 11:34:55,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:55,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:55,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:55,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:55,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:55,132 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-08 11:34:55,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:55,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:34:55,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:34:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:34:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:34:55,133 INFO L87 Difference]: Start difference. First operand 220276 states and 976572 transitions. Second operand 5 states. [2018-12-08 11:34:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:55,435 INFO L93 Difference]: Finished difference Result 78044 states and 314282 transitions. [2018-12-08 11:34:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:34:55,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-08 11:34:55,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:55,585 INFO L225 Difference]: With dead ends: 78044 [2018-12-08 11:34:55,586 INFO L226 Difference]: Without dead ends: 75732 [2018-12-08 11:34:55,586 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-08 11:34:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75732 states. [2018-12-08 11:34:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75732 to 75732. [2018-12-08 11:34:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75732 states. [2018-12-08 11:34:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75732 states to 75732 states and 305620 transitions. [2018-12-08 11:34:57,023 INFO L78 Accepts]: Start accepts. Automaton has 75732 states and 305620 transitions. Word has length 65 [2018-12-08 11:34:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:57,023 INFO L480 AbstractCegarLoop]: Abstraction has 75732 states and 305620 transitions. [2018-12-08 11:34:57,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:34:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 75732 states and 305620 transitions. [2018-12-08 11:34:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 11:34:57,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:57,070 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-08 11:34:57,070 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:57,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 493391520, now seen corresponding path program 1 times [2018-12-08 11:34:57,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:57,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:57,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:57,119 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-08 11:34:57,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:57,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:34:57,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:34:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:34:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:34:57,121 INFO L87 Difference]: Start difference. First operand 75732 states and 305620 transitions. Second operand 4 states. [2018-12-08 11:34:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:34:57,599 INFO L93 Difference]: Finished difference Result 105528 states and 420009 transitions. [2018-12-08 11:34:57,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:34:57,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 11:34:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:34:57,820 INFO L225 Difference]: With dead ends: 105528 [2018-12-08 11:34:57,820 INFO L226 Difference]: Without dead ends: 105528 [2018-12-08 11:34:57,821 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-08 11:34:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105528 states. [2018-12-08 11:34:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105528 to 81080. [2018-12-08 11:34:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81080 states. [2018-12-08 11:34:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81080 states to 81080 states and 325641 transitions. [2018-12-08 11:34:59,283 INFO L78 Accepts]: Start accepts. Automaton has 81080 states and 325641 transitions. Word has length 78 [2018-12-08 11:34:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:34:59,283 INFO L480 AbstractCegarLoop]: Abstraction has 81080 states and 325641 transitions. [2018-12-08 11:34:59,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:34:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 81080 states and 325641 transitions. [2018-12-08 11:34:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 11:34:59,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:34:59,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-08 11:34:59,339 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:34:59,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:34:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash -191355072, now seen corresponding path program 1 times [2018-12-08 11:34:59,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:34:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:34:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:59,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:34:59,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:34:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:34:59,385 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-08 11:34:59,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:34:59,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:34:59,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:34:59,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:34:59,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:34:59,386 INFO L87 Difference]: Start difference. First operand 81080 states and 325641 transitions. Second operand 4 states. [2018-12-08 11:35:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:00,141 INFO L93 Difference]: Finished difference Result 113667 states and 450915 transitions. [2018-12-08 11:35:00,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:35:00,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 11:35:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:00,371 INFO L225 Difference]: With dead ends: 113667 [2018-12-08 11:35:00,372 INFO L226 Difference]: Without dead ends: 113667 [2018-12-08 11:35:00,372 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-08 11:35:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113667 states. [2018-12-08 11:35:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113667 to 102372. [2018-12-08 11:35:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102372 states. [2018-12-08 11:35:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102372 states to 102372 states and 408718 transitions. [2018-12-08 11:35:02,118 INFO L78 Accepts]: Start accepts. Automaton has 102372 states and 408718 transitions. Word has length 78 [2018-12-08 11:35:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:02,118 INFO L480 AbstractCegarLoop]: Abstraction has 102372 states and 408718 transitions. [2018-12-08 11:35:02,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:35:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 102372 states and 408718 transitions. [2018-12-08 11:35:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 11:35:02,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:02,193 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-08 11:35:02,193 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:02,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 159444865, now seen corresponding path program 1 times [2018-12-08 11:35:02,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:02,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:02,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:02,295 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-08 11:35:02,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:02,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:35:02,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:35:02,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:35:02,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:35:02,296 INFO L87 Difference]: Start difference. First operand 102372 states and 408718 transitions. Second operand 8 states. [2018-12-08 11:35:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:03,598 INFO L93 Difference]: Finished difference Result 155234 states and 603182 transitions. [2018-12-08 11:35:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 11:35:03,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-08 11:35:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:03,904 INFO L225 Difference]: With dead ends: 155234 [2018-12-08 11:35:03,904 INFO L226 Difference]: Without dead ends: 154210 [2018-12-08 11:35:03,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-08 11:35:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154210 states. [2018-12-08 11:35:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154210 to 113269. [2018-12-08 11:35:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113269 states. [2018-12-08 11:35:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113269 states to 113269 states and 449340 transitions. [2018-12-08 11:35:06,037 INFO L78 Accepts]: Start accepts. Automaton has 113269 states and 449340 transitions. Word has length 78 [2018-12-08 11:35:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:06,037 INFO L480 AbstractCegarLoop]: Abstraction has 113269 states and 449340 transitions. [2018-12-08 11:35:06,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:35:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 113269 states and 449340 transitions. [2018-12-08 11:35:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 11:35:06,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:06,121 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-08 11:35:06,121 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:06,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash -133958142, now seen corresponding path program 1 times [2018-12-08 11:35:06,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:06,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:06,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:06,198 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-08 11:35:06,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:06,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:35:06,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:35:06,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:35:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:35:06,199 INFO L87 Difference]: Start difference. First operand 113269 states and 449340 transitions. Second operand 6 states. [2018-12-08 11:35:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:06,832 INFO L93 Difference]: Finished difference Result 124463 states and 488873 transitions. [2018-12-08 11:35:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:35:06,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-08 11:35:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:07,096 INFO L225 Difference]: With dead ends: 124463 [2018-12-08 11:35:07,096 INFO L226 Difference]: Without dead ends: 124463 [2018-12-08 11:35:07,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:35:07,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124463 states. [2018-12-08 11:35:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124463 to 116556. [2018-12-08 11:35:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116556 states. [2018-12-08 11:35:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116556 states to 116556 states and 460918 transitions. [2018-12-08 11:35:08,983 INFO L78 Accepts]: Start accepts. Automaton has 116556 states and 460918 transitions. Word has length 78 [2018-12-08 11:35:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:08,984 INFO L480 AbstractCegarLoop]: Abstraction has 116556 states and 460918 transitions. [2018-12-08 11:35:08,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:35:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 116556 states and 460918 transitions. [2018-12-08 11:35:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 11:35:09,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:09,074 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-08 11:35:09,075 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:09,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 827655875, now seen corresponding path program 1 times [2018-12-08 11:35:09,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:09,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:09,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:09,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:09,121 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-08 11:35:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:09,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:35:09,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:35:09,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:35:09,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:35:09,122 INFO L87 Difference]: Start difference. First operand 116556 states and 460918 transitions. Second operand 6 states. [2018-12-08 11:35:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:09,206 INFO L93 Difference]: Finished difference Result 20396 states and 68134 transitions. [2018-12-08 11:35:09,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:35:09,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-12-08 11:35:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:09,227 INFO L225 Difference]: With dead ends: 20396 [2018-12-08 11:35:09,227 INFO L226 Difference]: Without dead ends: 17062 [2018-12-08 11:35:09,227 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-08 11:35:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17062 states. [2018-12-08 11:35:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17062 to 15577. [2018-12-08 11:35:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15577 states. [2018-12-08 11:35:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15577 states to 15577 states and 52276 transitions. [2018-12-08 11:35:09,387 INFO L78 Accepts]: Start accepts. Automaton has 15577 states and 52276 transitions. Word has length 78 [2018-12-08 11:35:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:09,388 INFO L480 AbstractCegarLoop]: Abstraction has 15577 states and 52276 transitions. [2018-12-08 11:35:09,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:35:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 15577 states and 52276 transitions. [2018-12-08 11:35:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 11:35:09,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:09,402 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-08 11:35:09,402 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:09,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:09,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1270884801, now seen corresponding path program 1 times [2018-12-08 11:35:09,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:09,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:09,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:09,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:09,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:09,439 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-08 11:35:09,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:09,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:35:09,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:35:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:35:09,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:35:09,440 INFO L87 Difference]: Start difference. First operand 15577 states and 52276 transitions. Second operand 5 states. [2018-12-08 11:35:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:09,570 INFO L93 Difference]: Finished difference Result 17227 states and 57291 transitions. [2018-12-08 11:35:09,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:35:09,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-08 11:35:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:09,589 INFO L225 Difference]: With dead ends: 17227 [2018-12-08 11:35:09,589 INFO L226 Difference]: Without dead ends: 17227 [2018-12-08 11:35:09,590 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-08 11:35:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17227 states. [2018-12-08 11:35:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17227 to 15767. [2018-12-08 11:35:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15767 states. [2018-12-08 11:35:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15767 states to 15767 states and 52948 transitions. [2018-12-08 11:35:09,814 INFO L78 Accepts]: Start accepts. Automaton has 15767 states and 52948 transitions. Word has length 97 [2018-12-08 11:35:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:09,814 INFO L480 AbstractCegarLoop]: Abstraction has 15767 states and 52948 transitions. [2018-12-08 11:35:09,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:35:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 15767 states and 52948 transitions. [2018-12-08 11:35:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 11:35:09,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:09,829 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-08 11:35:09,829 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:09,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash 87537504, now seen corresponding path program 1 times [2018-12-08 11:35:09,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:09,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:09,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:09,892 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-08 11:35:09,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:09,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:35:09,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:35:09,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:35:09,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:35:09,893 INFO L87 Difference]: Start difference. First operand 15767 states and 52948 transitions. Second operand 6 states. [2018-12-08 11:35:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:10,202 INFO L93 Difference]: Finished difference Result 18487 states and 61234 transitions. [2018-12-08 11:35:10,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:35:10,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-08 11:35:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:10,222 INFO L225 Difference]: With dead ends: 18487 [2018-12-08 11:35:10,223 INFO L226 Difference]: Without dead ends: 18127 [2018-12-08 11:35:10,223 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-08 11:35:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2018-12-08 11:35:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17597. [2018-12-08 11:35:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17597 states. [2018-12-08 11:35:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 58832 transitions. [2018-12-08 11:35:10,402 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 58832 transitions. Word has length 97 [2018-12-08 11:35:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:10,402 INFO L480 AbstractCegarLoop]: Abstraction has 17597 states and 58832 transitions. [2018-12-08 11:35:10,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:35:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 58832 transitions. [2018-12-08 11:35:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 11:35:10,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:10,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:35:10,419 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:10,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1232273469, now seen corresponding path program 2 times [2018-12-08 11:35:10,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:10,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:10,466 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-08 11:35:10,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:10,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:35:10,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:35:10,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:35:10,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:35:10,467 INFO L87 Difference]: Start difference. First operand 17597 states and 58832 transitions. Second operand 5 states. [2018-12-08 11:35:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:10,622 INFO L93 Difference]: Finished difference Result 23304 states and 76607 transitions. [2018-12-08 11:35:10,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:35:10,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-08 11:35:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:10,647 INFO L225 Difference]: With dead ends: 23304 [2018-12-08 11:35:10,647 INFO L226 Difference]: Without dead ends: 23144 [2018-12-08 11:35:10,647 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-08 11:35:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23144 states. [2018-12-08 11:35:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23144 to 19330. [2018-12-08 11:35:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19330 states. [2018-12-08 11:35:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 64347 transitions. [2018-12-08 11:35:10,862 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 64347 transitions. Word has length 97 [2018-12-08 11:35:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:10,862 INFO L480 AbstractCegarLoop]: Abstraction has 19330 states and 64347 transitions. [2018-12-08 11:35:10,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:35:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 64347 transitions. [2018-12-08 11:35:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 11:35:10,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:10,879 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-08 11:35:10,879 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:10,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:10,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1908320027, now seen corresponding path program 3 times [2018-12-08 11:35:10,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:10,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:10,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:10,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:35:10,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:10,948 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-08 11:35:10,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:10,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:35:10,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:35:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:35:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:35:10,949 INFO L87 Difference]: Start difference. First operand 19330 states and 64347 transitions. Second operand 7 states. [2018-12-08 11:35:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:11,221 INFO L93 Difference]: Finished difference Result 23210 states and 76033 transitions. [2018-12-08 11:35:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:35:11,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-08 11:35:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:11,245 INFO L225 Difference]: With dead ends: 23210 [2018-12-08 11:35:11,245 INFO L226 Difference]: Without dead ends: 22835 [2018-12-08 11:35:11,246 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-08 11:35:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22835 states. [2018-12-08 11:35:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22835 to 19315. [2018-12-08 11:35:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19315 states. [2018-12-08 11:35:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19315 states to 19315 states and 64230 transitions. [2018-12-08 11:35:11,455 INFO L78 Accepts]: Start accepts. Automaton has 19315 states and 64230 transitions. Word has length 97 [2018-12-08 11:35:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:11,455 INFO L480 AbstractCegarLoop]: Abstraction has 19315 states and 64230 transitions. [2018-12-08 11:35:11,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:35:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 19315 states and 64230 transitions. [2018-12-08 11:35:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 11:35:11,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:11,471 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-08 11:35:11,472 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:11,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1057118527, now seen corresponding path program 1 times [2018-12-08 11:35:11,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:11,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:35:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:11,533 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-08 11:35:11,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:11,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:35:11,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:35:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:35:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:35:11,533 INFO L87 Difference]: Start difference. First operand 19315 states and 64230 transitions. Second operand 6 states. [2018-12-08 11:35:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:11,691 INFO L93 Difference]: Finished difference Result 22820 states and 73489 transitions. [2018-12-08 11:35:11,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:35:11,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-12-08 11:35:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:11,715 INFO L225 Difference]: With dead ends: 22820 [2018-12-08 11:35:11,715 INFO L226 Difference]: Without dead ends: 22745 [2018-12-08 11:35:11,715 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-08 11:35:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22745 states. [2018-12-08 11:35:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22745 to 20185. [2018-12-08 11:35:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20185 states. [2018-12-08 11:35:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20185 states to 20185 states and 66021 transitions. [2018-12-08 11:35:11,925 INFO L78 Accepts]: Start accepts. Automaton has 20185 states and 66021 transitions. Word has length 97 [2018-12-08 11:35:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:11,925 INFO L480 AbstractCegarLoop]: Abstraction has 20185 states and 66021 transitions. [2018-12-08 11:35:11,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:35:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 20185 states and 66021 transitions. [2018-12-08 11:35:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 11:35:11,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:11,942 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-08 11:35:11,942 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:11,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 32424606, now seen corresponding path program 1 times [2018-12-08 11:35:11,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:11,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:11,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:11,993 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-08 11:35:11,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:11,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:35:11,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:35:11,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:35:11,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:35:11,993 INFO L87 Difference]: Start difference. First operand 20185 states and 66021 transitions. Second operand 5 states. [2018-12-08 11:35:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:12,225 INFO L93 Difference]: Finished difference Result 25977 states and 83364 transitions. [2018-12-08 11:35:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:35:12,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2018-12-08 11:35:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:12,250 INFO L225 Difference]: With dead ends: 25977 [2018-12-08 11:35:12,250 INFO L226 Difference]: Without dead ends: 25442 [2018-12-08 11:35:12,251 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-08 11:35:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25442 states. [2018-12-08 11:35:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25442 to 20955. [2018-12-08 11:35:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20955 states. [2018-12-08 11:35:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20955 states to 20955 states and 68022 transitions. [2018-12-08 11:35:12,472 INFO L78 Accepts]: Start accepts. Automaton has 20955 states and 68022 transitions. Word has length 97 [2018-12-08 11:35:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:12,472 INFO L480 AbstractCegarLoop]: Abstraction has 20955 states and 68022 transitions. [2018-12-08 11:35:12,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:35:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 20955 states and 68022 transitions. [2018-12-08 11:35:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:12,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:12,489 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-08 11:35:12,489 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:12,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1707260212, now seen corresponding path program 1 times [2018-12-08 11:35:12,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:12,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:12,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:35:12,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:12,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 11:35:12,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:35:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:35:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:35:12,556 INFO L87 Difference]: Start difference. First operand 20955 states and 68022 transitions. Second operand 9 states. [2018-12-08 11:35:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:13,335 INFO L93 Difference]: Finished difference Result 35170 states and 112670 transitions. [2018-12-08 11:35:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 11:35:13,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-08 11:35:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:13,375 INFO L225 Difference]: With dead ends: 35170 [2018-12-08 11:35:13,375 INFO L226 Difference]: Without dead ends: 35042 [2018-12-08 11:35:13,376 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-08 11:35:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35042 states. [2018-12-08 11:35:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35042 to 23768. [2018-12-08 11:35:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23768 states. [2018-12-08 11:35:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23768 states to 23768 states and 77120 transitions. [2018-12-08 11:35:13,685 INFO L78 Accepts]: Start accepts. Automaton has 23768 states and 77120 transitions. Word has length 99 [2018-12-08 11:35:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:13,685 INFO L480 AbstractCegarLoop]: Abstraction has 23768 states and 77120 transitions. [2018-12-08 11:35:13,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:35:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23768 states and 77120 transitions. [2018-12-08 11:35:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:13,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:13,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:35:13,708 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:13,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash -462495731, now seen corresponding path program 1 times [2018-12-08 11:35:13,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:13,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:13,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:13,772 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-08 11:35:13,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:13,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:35:13,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:35:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:35:13,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:35:13,772 INFO L87 Difference]: Start difference. First operand 23768 states and 77120 transitions. Second operand 7 states. [2018-12-08 11:35:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:14,238 INFO L93 Difference]: Finished difference Result 37316 states and 120409 transitions. [2018-12-08 11:35:14,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 11:35:14,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 11:35:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:14,279 INFO L225 Difference]: With dead ends: 37316 [2018-12-08 11:35:14,279 INFO L226 Difference]: Without dead ends: 36421 [2018-12-08 11:35:14,279 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-08 11:35:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36421 states. [2018-12-08 11:35:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36421 to 23258. [2018-12-08 11:35:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23258 states. [2018-12-08 11:35:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23258 states to 23258 states and 75202 transitions. [2018-12-08 11:35:14,589 INFO L78 Accepts]: Start accepts. Automaton has 23258 states and 75202 transitions. Word has length 99 [2018-12-08 11:35:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:14,590 INFO L480 AbstractCegarLoop]: Abstraction has 23258 states and 75202 transitions. [2018-12-08 11:35:14,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:35:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 23258 states and 75202 transitions. [2018-12-08 11:35:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:14,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:14,611 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-08 11:35:14,611 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:14,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1632816658, now seen corresponding path program 1 times [2018-12-08 11:35:14,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:14,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:14,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:14,684 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-08 11:35:14,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:14,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:35:14,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:35:14,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:35:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:35:14,685 INFO L87 Difference]: Start difference. First operand 23258 states and 75202 transitions. Second operand 6 states. [2018-12-08 11:35:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:14,814 INFO L93 Difference]: Finished difference Result 18999 states and 61501 transitions. [2018-12-08 11:35:14,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:35:14,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 11:35:14,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:14,834 INFO L225 Difference]: With dead ends: 18999 [2018-12-08 11:35:14,834 INFO L226 Difference]: Without dead ends: 18999 [2018-12-08 11:35:14,834 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-08 11:35:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18999 states. [2018-12-08 11:35:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18999 to 17499. [2018-12-08 11:35:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17499 states. [2018-12-08 11:35:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17499 states to 17499 states and 57066 transitions. [2018-12-08 11:35:15,059 INFO L78 Accepts]: Start accepts. Automaton has 17499 states and 57066 transitions. Word has length 99 [2018-12-08 11:35:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:15,059 INFO L480 AbstractCegarLoop]: Abstraction has 17499 states and 57066 transitions. [2018-12-08 11:35:15,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:35:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 17499 states and 57066 transitions. [2018-12-08 11:35:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:15,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:15,074 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-08 11:35:15,074 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:15,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash -456422671, now seen corresponding path program 1 times [2018-12-08 11:35:15,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:15,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:15,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:15,119 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-08 11:35:15,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:15,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:35:15,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:35:15,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:35:15,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:35:15,120 INFO L87 Difference]: Start difference. First operand 17499 states and 57066 transitions. Second operand 7 states. [2018-12-08 11:35:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:15,385 INFO L93 Difference]: Finished difference Result 19038 states and 61795 transitions. [2018-12-08 11:35:15,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:35:15,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 11:35:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:15,406 INFO L225 Difference]: With dead ends: 19038 [2018-12-08 11:35:15,406 INFO L226 Difference]: Without dead ends: 19038 [2018-12-08 11:35:15,406 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-08 11:35:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19038 states. [2018-12-08 11:35:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19038 to 17409. [2018-12-08 11:35:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17409 states. [2018-12-08 11:35:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17409 states to 17409 states and 56814 transitions. [2018-12-08 11:35:15,584 INFO L78 Accepts]: Start accepts. Automaton has 17409 states and 56814 transitions. Word has length 99 [2018-12-08 11:35:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:15,584 INFO L480 AbstractCegarLoop]: Abstraction has 17409 states and 56814 transitions. [2018-12-08 11:35:15,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:35:15,584 INFO L276 IsEmpty]: Start isEmpty. Operand 17409 states and 56814 transitions. [2018-12-08 11:35:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:15,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:15,600 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-08 11:35:15,600 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:15,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 954456849, now seen corresponding path program 1 times [2018-12-08 11:35:15,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:15,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:15,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:15,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:15,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:35:15,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:15,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:35:15,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:35:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:35:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:35:15,690 INFO L87 Difference]: Start difference. First operand 17409 states and 56814 transitions. Second operand 8 states. [2018-12-08 11:35:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:15,966 INFO L93 Difference]: Finished difference Result 22228 states and 71934 transitions. [2018-12-08 11:35:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 11:35:15,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-08 11:35:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:15,990 INFO L225 Difference]: With dead ends: 22228 [2018-12-08 11:35:15,990 INFO L226 Difference]: Without dead ends: 22100 [2018-12-08 11:35:15,990 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-08 11:35:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22100 states. [2018-12-08 11:35:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22100 to 17738. [2018-12-08 11:35:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17738 states. [2018-12-08 11:35:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17738 states to 17738 states and 57613 transitions. [2018-12-08 11:35:16,194 INFO L78 Accepts]: Start accepts. Automaton has 17738 states and 57613 transitions. Word has length 99 [2018-12-08 11:35:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:16,194 INFO L480 AbstractCegarLoop]: Abstraction has 17738 states and 57613 transitions. [2018-12-08 11:35:16,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:35:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 17738 states and 57613 transitions. [2018-12-08 11:35:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:16,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:16,210 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-08 11:35:16,210 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:16,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1916070866, now seen corresponding path program 1 times [2018-12-08 11:35:16,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:16,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:16,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:16,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:16,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:35:16,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:16,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:35:16,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:35:16,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:35:16,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:35:16,264 INFO L87 Difference]: Start difference. First operand 17738 states and 57613 transitions. Second operand 7 states. [2018-12-08 11:35:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:16,513 INFO L93 Difference]: Finished difference Result 23099 states and 74558 transitions. [2018-12-08 11:35:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:35:16,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 11:35:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:16,536 INFO L225 Difference]: With dead ends: 23099 [2018-12-08 11:35:16,537 INFO L226 Difference]: Without dead ends: 23099 [2018-12-08 11:35:16,537 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-08 11:35:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23099 states. [2018-12-08 11:35:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23099 to 19145. [2018-12-08 11:35:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19145 states. [2018-12-08 11:35:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19145 states to 19145 states and 62246 transitions. [2018-12-08 11:35:16,739 INFO L78 Accepts]: Start accepts. Automaton has 19145 states and 62246 transitions. Word has length 99 [2018-12-08 11:35:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:16,739 INFO L480 AbstractCegarLoop]: Abstraction has 19145 states and 62246 transitions. [2018-12-08 11:35:16,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:35:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 19145 states and 62246 transitions. [2018-12-08 11:35:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:16,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:16,755 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-08 11:35:16,755 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:16,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1134131949, now seen corresponding path program 1 times [2018-12-08 11:35:16,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:16,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:16,826 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-08 11:35:16,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:16,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:35:16,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 11:35:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 11:35:16,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:35:16,827 INFO L87 Difference]: Start difference. First operand 19145 states and 62246 transitions. Second operand 8 states. [2018-12-08 11:35:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:17,115 INFO L93 Difference]: Finished difference Result 31920 states and 105860 transitions. [2018-12-08 11:35:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 11:35:17,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-12-08 11:35:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:17,153 INFO L225 Difference]: With dead ends: 31920 [2018-12-08 11:35:17,153 INFO L226 Difference]: Without dead ends: 31920 [2018-12-08 11:35:17,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-08 11:35:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31920 states. [2018-12-08 11:35:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31920 to 19025. [2018-12-08 11:35:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19025 states. [2018-12-08 11:35:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19025 states to 19025 states and 61810 transitions. [2018-12-08 11:35:17,404 INFO L78 Accepts]: Start accepts. Automaton has 19025 states and 61810 transitions. Word has length 99 [2018-12-08 11:35:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:17,404 INFO L480 AbstractCegarLoop]: Abstraction has 19025 states and 61810 transitions. [2018-12-08 11:35:17,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 11:35:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 19025 states and 61810 transitions. [2018-12-08 11:35:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:35:17,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:17,484 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-08 11:35:17,484 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:17,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash -653415533, now seen corresponding path program 1 times [2018-12-08 11:35:17,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:17,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:17,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:17,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:17,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:17,542 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-08 11:35:17,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:17,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:35:17,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:35:17,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:35:17,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:35:17,543 INFO L87 Difference]: Start difference. First operand 19025 states and 61810 transitions. Second operand 6 states. [2018-12-08 11:35:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:17,680 INFO L93 Difference]: Finished difference Result 17297 states and 55106 transitions. [2018-12-08 11:35:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:35:17,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 11:35:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:17,697 INFO L225 Difference]: With dead ends: 17297 [2018-12-08 11:35:17,697 INFO L226 Difference]: Without dead ends: 17297 [2018-12-08 11:35:17,697 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-08 11:35:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17297 states. [2018-12-08 11:35:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17297 to 13220. [2018-12-08 11:35:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13220 states. [2018-12-08 11:35:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13220 states to 13220 states and 42833 transitions. [2018-12-08 11:35:17,847 INFO L78 Accepts]: Start accepts. Automaton has 13220 states and 42833 transitions. Word has length 99 [2018-12-08 11:35:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:17,847 INFO L480 AbstractCegarLoop]: Abstraction has 13220 states and 42833 transitions. [2018-12-08 11:35:17,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:35:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 13220 states and 42833 transitions. [2018-12-08 11:35:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 11:35:17,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:17,858 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-08 11:35:17,858 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:17,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1543607272, now seen corresponding path program 1 times [2018-12-08 11:35:17,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:17,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:17,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:17,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:17,903 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-08 11:35:17,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:17,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:35:17,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:35:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:35:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:35:17,904 INFO L87 Difference]: Start difference. First operand 13220 states and 42833 transitions. Second operand 5 states. [2018-12-08 11:35:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:18,038 INFO L93 Difference]: Finished difference Result 14628 states and 47345 transitions. [2018-12-08 11:35:18,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:35:18,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 11:35:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:18,054 INFO L225 Difference]: With dead ends: 14628 [2018-12-08 11:35:18,054 INFO L226 Difference]: Without dead ends: 14500 [2018-12-08 11:35:18,054 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-08 11:35:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14500 states. [2018-12-08 11:35:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14500 to 12444. [2018-12-08 11:35:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12444 states. [2018-12-08 11:35:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12444 states to 12444 states and 40338 transitions. [2018-12-08 11:35:18,187 INFO L78 Accepts]: Start accepts. Automaton has 12444 states and 40338 transitions. Word has length 101 [2018-12-08 11:35:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:18,187 INFO L480 AbstractCegarLoop]: Abstraction has 12444 states and 40338 transitions. [2018-12-08 11:35:18,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:35:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 12444 states and 40338 transitions. [2018-12-08 11:35:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 11:35:18,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:18,198 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-08 11:35:18,198 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:18,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1506595543, now seen corresponding path program 1 times [2018-12-08 11:35:18,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:18,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:18,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:18,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:18,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:18,265 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-08 11:35:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:35:18,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:35:18,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:35:18,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:35:18,266 INFO L87 Difference]: Start difference. First operand 12444 states and 40338 transitions. Second operand 7 states. [2018-12-08 11:35:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:18,466 INFO L93 Difference]: Finished difference Result 23340 states and 76112 transitions. [2018-12-08 11:35:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:35:18,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-08 11:35:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:18,479 INFO L225 Difference]: With dead ends: 23340 [2018-12-08 11:35:18,479 INFO L226 Difference]: Without dead ends: 11944 [2018-12-08 11:35:18,479 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-08 11:35:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11944 states. [2018-12-08 11:35:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11944 to 11744. [2018-12-08 11:35:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11744 states. [2018-12-08 11:35:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11744 states to 11744 states and 38274 transitions. [2018-12-08 11:35:18,592 INFO L78 Accepts]: Start accepts. Automaton has 11744 states and 38274 transitions. Word has length 101 [2018-12-08 11:35:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:18,592 INFO L480 AbstractCegarLoop]: Abstraction has 11744 states and 38274 transitions. [2018-12-08 11:35:18,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:35:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11744 states and 38274 transitions. [2018-12-08 11:35:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 11:35:18,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:18,602 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-08 11:35:18,603 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:18,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:18,603 INFO L82 PathProgramCache]: Analyzing trace with hash -321724473, now seen corresponding path program 2 times [2018-12-08 11:35:18,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:18,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:18,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:18,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:35:18,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:18,669 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-08 11:35:18,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:18,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:35:18,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:35:18,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:35:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:35:18,669 INFO L87 Difference]: Start difference. First operand 11744 states and 38274 transitions. Second operand 7 states. [2018-12-08 11:35:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:18,883 INFO L93 Difference]: Finished difference Result 19260 states and 63505 transitions. [2018-12-08 11:35:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:35:18,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-12-08 11:35:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:18,892 INFO L225 Difference]: With dead ends: 19260 [2018-12-08 11:35:18,892 INFO L226 Difference]: Without dead ends: 7616 [2018-12-08 11:35:18,892 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-08 11:35:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2018-12-08 11:35:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7616. [2018-12-08 11:35:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-12-08 11:35:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 25482 transitions. [2018-12-08 11:35:18,969 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 25482 transitions. Word has length 101 [2018-12-08 11:35:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:18,969 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 25482 transitions. [2018-12-08 11:35:18,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:35:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 25482 transitions. [2018-12-08 11:35:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 11:35:18,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:18,976 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-08 11:35:18,976 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:18,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash 773161459, now seen corresponding path program 3 times [2018-12-08 11:35:18,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:18,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:18,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:35:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:35:19,061 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-08 11:35:19,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:35:19,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 11:35:19,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 11:35:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 11:35:19,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:35:19,061 INFO L87 Difference]: Start difference. First operand 7616 states and 25482 transitions. Second operand 12 states. [2018-12-08 11:35:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:35:19,438 INFO L93 Difference]: Finished difference Result 14444 states and 48675 transitions. [2018-12-08 11:35:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 11:35:19,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-12-08 11:35:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:35:19,450 INFO L225 Difference]: With dead ends: 14444 [2018-12-08 11:35:19,450 INFO L226 Difference]: Without dead ends: 10540 [2018-12-08 11:35:19,450 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-08 11:35:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2018-12-08 11:35:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 9860. [2018-12-08 11:35:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2018-12-08 11:35:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 32373 transitions. [2018-12-08 11:35:19,546 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 32373 transitions. Word has length 101 [2018-12-08 11:35:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:35:19,546 INFO L480 AbstractCegarLoop]: Abstraction has 9860 states and 32373 transitions. [2018-12-08 11:35:19,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 11:35:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 32373 transitions. [2018-12-08 11:35:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 11:35:19,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:35:19,555 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-08 11:35:19,555 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 11:35:19,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:35:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash -350606857, now seen corresponding path program 4 times [2018-12-08 11:35:19,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:35:19,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:35:19,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:19,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:35:19,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:35:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:35:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 11:35:19,591 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 11:35:19,663 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 11:35:19,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:35:19 BasicIcfg [2018-12-08 11:35:19,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 11:35:19,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 11:35:19,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 11:35:19,664 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 11:35:19,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:33:45" (3/4) ... [2018-12-08 11:35:19,666 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 11:35:19,739 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_24b29b74-c10b-43be-b2be-812865822632/bin-2019/uautomizer/witness.graphml [2018-12-08 11:35:19,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 11:35:19,739 INFO L168 Benchmark]: Toolchain (without parser) took 95408.39 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.9 GB). Free memory was 951.7 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-08 11:35:19,740 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:35:19,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-08 11:35:19,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 11:35:19,741 INFO L168 Benchmark]: Boogie Preprocessor took 19.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:35:19,741 INFO L168 Benchmark]: RCFGBuilder took 364.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:35:19,741 INFO L168 Benchmark]: TraceAbstraction took 94582.24 ms. Allocated memory was 1.2 GB in the beginning and 6.9 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-12-08 11:35:19,741 INFO L168 Benchmark]: Witness Printer took 74.54 ms. Allocated memory is still 6.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-08 11:35:19,742 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 364.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 94582.24 ms. Allocated memory was 1.2 GB in the beginning and 6.9 GB in the end (delta: 5.7 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 74.54 ms. Allocated memory is still 6.9 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 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 t2500; 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(&t2500, ((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 t2501; 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(&t2501, ((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 t2502; 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(&t2502, ((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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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, 94.4s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 24.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8018 SDtfs, 8231 SDslu, 20546 SDs, 0 SdLazy, 8409 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 107 SyntacticMatches, 22 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.6s 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: 51.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 670181 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2698 NumberOfCodeBlocks, 2698 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2566 ConstructedInterpolants, 0 QuantifiedInterpolants, 601437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...