./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_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_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/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 2704334a5f5c65f6107547c60b5bde5e46cdf374 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-01 15:32:48,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:32:48,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:32:48,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:32:48,123 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:32:48,124 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:32:48,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:32:48,126 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:32:48,127 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:32:48,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:32:48,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:32:48,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:32:48,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:32:48,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:32:48,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:32:48,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:32:48,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:32:48,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:32:48,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:32:48,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:32:48,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:32:48,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:32:48,136 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:32:48,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:32:48,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:32:48,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:32:48,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:32:48,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:32:48,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:32:48,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:32:48,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:32:48,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:32:48,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:32:48,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:32:48,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:32:48,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:32:48,141 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 15:32:48,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:32:48,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:32:48,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 15:32:48,152 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 15:32:48,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:32:48,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:32:48,153 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:32:48,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:32:48,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:32:48,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:32:48,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:32:48,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:32:48,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 15:32:48,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 15:32:48,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 15:32:48,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:32:48,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 15:32:48,155 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:32:48,155 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 15:32:48,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:32:48,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:32:48,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 15:32:48,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 15:32:48,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 15:32:48,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:32:48,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 15:32:48,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 15:32:48,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:32:48,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 15:32:48,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 15:32:48,157 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_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/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 -> 2704334a5f5c65f6107547c60b5bde5e46cdf374 [2018-12-01 15:32:48,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:32:48,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:32:48,189 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:32:48,190 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:32:48,190 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:32:48,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2018-12-01 15:32:48,226 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/data/40401b09c/0a96a917cc6643db864f38124920a7d3/FLAG19d33b01b [2018-12-01 15:32:48,698 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:32:48,699 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/sv-benchmarks/c/pthread-wmm/safe029_pso.opt_false-unreach-call.i [2018-12-01 15:32:48,707 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/data/40401b09c/0a96a917cc6643db864f38124920a7d3/FLAG19d33b01b [2018-12-01 15:32:48,715 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/data/40401b09c/0a96a917cc6643db864f38124920a7d3 [2018-12-01 15:32:48,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:32:48,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 15:32:48,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:32:48,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:32:48,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:32:48,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:32:48" (1/1) ... [2018-12-01 15:32:48,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:48, skipping insertion in model container [2018-12-01 15:32:48,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:32:48" (1/1) ... [2018-12-01 15:32:48,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:32:48,757 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:32:48,972 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:32:48,979 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:32:49,049 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:32:49,079 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:32:49,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49 WrapperNode [2018-12-01 15:32:49,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:32:49,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 15:32:49,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 15:32:49,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 15:32:49,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 15:32:49,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:32:49,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:32:49,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:32:49,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... [2018-12-01 15:32:49,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:32:49,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:32:49,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:32:49,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:32:49,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/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-01 15:32:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 15:32:49,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 15:32:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 15:32:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 15:32:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 15:32:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 15:32:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 15:32:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 15:32:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 15:32:49,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:32:49,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:32:49,162 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 15:32:49,454 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:32:49,454 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 15:32:49,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:32:49 BoogieIcfgContainer [2018-12-01 15:32:49,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:32:49,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 15:32:49,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 15:32:49,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 15:32:49,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:32:48" (1/3) ... [2018-12-01 15:32:49,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a58ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:32:49, skipping insertion in model container [2018-12-01 15:32:49,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:32:49" (2/3) ... [2018-12-01 15:32:49,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a58ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:32:49, skipping insertion in model container [2018-12-01 15:32:49,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:32:49" (3/3) ... [2018-12-01 15:32:49,460 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt_false-unreach-call.i [2018-12-01 15:32:49,484 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,484 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,484 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,484 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,485 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,486 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,487 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,488 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,489 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,489 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,489 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,489 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,489 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,490 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,490 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,490 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,490 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,491 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,492 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 15:32:49,499 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 15:32:49,499 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 15:32:49,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 15:32:49,519 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 15:32:49,533 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:32:49,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 15:32:49,534 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 15:32:49,534 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 15:32:49,534 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:32:49,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:32:49,534 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 15:32:49,534 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:32:49,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 15:32:49,542 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-01 15:32:50,644 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2018-12-01 15:32:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2018-12-01 15:32:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 15:32:50,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:50,651 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] [2018-12-01 15:32:50,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:50,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:50,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2018-12-01 15:32:50,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:50,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:50,804 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-01 15:32:50,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:50,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 15:32:50,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:32:50,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:32:50,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:32:50,818 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2018-12-01 15:32:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:51,147 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2018-12-01 15:32:51,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:32:51,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-01 15:32:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:51,283 INFO L225 Difference]: With dead ends: 45386 [2018-12-01 15:32:51,283 INFO L226 Difference]: Without dead ends: 40626 [2018-12-01 15:32:51,284 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-01 15:32:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2018-12-01 15:32:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2018-12-01 15:32:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2018-12-01 15:32:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2018-12-01 15:32:52,048 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2018-12-01 15:32:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:52,048 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2018-12-01 15:32:52,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:32:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2018-12-01 15:32:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 15:32:52,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:52,051 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-01 15:32:52,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:52,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1049069648, now seen corresponding path program 1 times [2018-12-01 15:32:52,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:52,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:52,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:52,103 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-01 15:32:52,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:52,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:32:52,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:32:52,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:32:52,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:32:52,105 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2018-12-01 15:32:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:52,740 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2018-12-01 15:32:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:32:52,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-01 15:32:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:52,896 INFO L225 Difference]: With dead ends: 64828 [2018-12-01 15:32:52,897 INFO L226 Difference]: Without dead ends: 64668 [2018-12-01 15:32:52,897 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-01 15:32:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2018-12-01 15:32:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2018-12-01 15:32:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2018-12-01 15:32:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2018-12-01 15:32:53,683 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2018-12-01 15:32:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:53,684 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2018-12-01 15:32:53,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:32:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2018-12-01 15:32:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 15:32:53,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:53,687 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] [2018-12-01 15:32:53,687 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:53,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2018-12-01 15:32:53,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:53,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:53,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:53,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:53,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:53,723 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-01 15:32:53,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:53,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 15:32:53,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:32:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:32:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:32:53,724 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2018-12-01 15:32:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:53,770 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2018-12-01 15:32:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:32:53,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-01 15:32:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:53,789 INFO L225 Difference]: With dead ends: 12362 [2018-12-01 15:32:53,790 INFO L226 Difference]: Without dead ends: 11841 [2018-12-01 15:32:53,790 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-01 15:32:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2018-12-01 15:32:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2018-12-01 15:32:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2018-12-01 15:32:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2018-12-01 15:32:53,930 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2018-12-01 15:32:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:53,930 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2018-12-01 15:32:53,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:32:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2018-12-01 15:32:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 15:32:53,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:53,933 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] [2018-12-01 15:32:53,933 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:53,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1845292501, now seen corresponding path program 1 times [2018-12-01 15:32:53,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:53,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:53,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:53,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:53,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:53,995 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-01 15:32:53,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:53,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 15:32:53,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:32:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:32:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:32:53,996 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2018-12-01 15:32:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:54,166 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2018-12-01 15:32:54,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:32:54,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-01 15:32:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:54,188 INFO L225 Difference]: With dead ends: 17017 [2018-12-01 15:32:54,189 INFO L226 Difference]: Without dead ends: 17017 [2018-12-01 15:32:54,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:32:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2018-12-01 15:32:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2018-12-01 15:32:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2018-12-01 15:32:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2018-12-01 15:32:54,378 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2018-12-01 15:32:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:54,379 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2018-12-01 15:32:54,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:32:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2018-12-01 15:32:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 15:32:54,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:54,385 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] [2018-12-01 15:32:54,385 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:54,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash -169488919, now seen corresponding path program 1 times [2018-12-01 15:32:54,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:54,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:54,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:54,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:54,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:54,476 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-01 15:32:54,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:54,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:32:54,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:32:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:32:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:32:54,477 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 6 states. [2018-12-01 15:32:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:54,853 INFO L93 Difference]: Finished difference Result 18597 states and 60828 transitions. [2018-12-01 15:32:54,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 15:32:54,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-01 15:32:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:54,880 INFO L225 Difference]: With dead ends: 18597 [2018-12-01 15:32:54,880 INFO L226 Difference]: Without dead ends: 18565 [2018-12-01 15:32:54,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-01 15:32:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18565 states. [2018-12-01 15:32:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18565 to 14409. [2018-12-01 15:32:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14409 states. [2018-12-01 15:32:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14409 states to 14409 states and 47547 transitions. [2018-12-01 15:32:55,132 INFO L78 Accepts]: Start accepts. Automaton has 14409 states and 47547 transitions. Word has length 56 [2018-12-01 15:32:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:55,133 INFO L480 AbstractCegarLoop]: Abstraction has 14409 states and 47547 transitions. [2018-12-01 15:32:55,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:32:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 14409 states and 47547 transitions. [2018-12-01 15:32:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 15:32:55,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:55,144 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] [2018-12-01 15:32:55,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:55,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:55,144 INFO L82 PathProgramCache]: Analyzing trace with hash 860313174, now seen corresponding path program 1 times [2018-12-01 15:32:55,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:55,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:55,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:55,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:55,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:32:55,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:55,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:32:55,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:32:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:32:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:32:55,243 INFO L87 Difference]: Start difference. First operand 14409 states and 47547 transitions. Second operand 7 states. [2018-12-01 15:32:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:56,907 INFO L93 Difference]: Finished difference Result 49866 states and 161886 transitions. [2018-12-01 15:32:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 15:32:56,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-01 15:32:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:56,978 INFO L225 Difference]: With dead ends: 49866 [2018-12-01 15:32:56,979 INFO L226 Difference]: Without dead ends: 49594 [2018-12-01 15:32:56,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-01 15:32:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49594 states. [2018-12-01 15:32:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49594 to 22262. [2018-12-01 15:32:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22262 states. [2018-12-01 15:32:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22262 states to 22262 states and 72740 transitions. [2018-12-01 15:32:57,391 INFO L78 Accepts]: Start accepts. Automaton has 22262 states and 72740 transitions. Word has length 70 [2018-12-01 15:32:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:57,392 INFO L480 AbstractCegarLoop]: Abstraction has 22262 states and 72740 transitions. [2018-12-01 15:32:57,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:32:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22262 states and 72740 transitions. [2018-12-01 15:32:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 15:32:57,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:57,407 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] [2018-12-01 15:32:57,407 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:57,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2081344425, now seen corresponding path program 1 times [2018-12-01 15:32:57,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:57,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:57,573 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-01 15:32:57,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:57,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:32:57,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:32:57,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:32:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:32:57,574 INFO L87 Difference]: Start difference. First operand 22262 states and 72740 transitions. Second operand 5 states. [2018-12-01 15:32:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:57,600 INFO L93 Difference]: Finished difference Result 4734 states and 12518 transitions. [2018-12-01 15:32:57,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:32:57,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-01 15:32:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:57,605 INFO L225 Difference]: With dead ends: 4734 [2018-12-01 15:32:57,606 INFO L226 Difference]: Without dead ends: 3910 [2018-12-01 15:32:57,606 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-01 15:32:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2018-12-01 15:32:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3410. [2018-12-01 15:32:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3410 states. [2018-12-01 15:32:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 9066 transitions. [2018-12-01 15:32:57,639 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 9066 transitions. Word has length 70 [2018-12-01 15:32:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:57,640 INFO L480 AbstractCegarLoop]: Abstraction has 3410 states and 9066 transitions. [2018-12-01 15:32:57,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:32:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 9066 transitions. [2018-12-01 15:32:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 15:32:57,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:57,643 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] [2018-12-01 15:32:57,643 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:57,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash 583358504, now seen corresponding path program 1 times [2018-12-01 15:32:57,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:57,674 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-01 15:32:57,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:57,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:32:57,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:32:57,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:32:57,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:32:57,675 INFO L87 Difference]: Start difference. First operand 3410 states and 9066 transitions. Second operand 3 states. [2018-12-01 15:32:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:57,753 INFO L93 Difference]: Finished difference Result 3508 states and 9283 transitions. [2018-12-01 15:32:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:32:57,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-01 15:32:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:57,756 INFO L225 Difference]: With dead ends: 3508 [2018-12-01 15:32:57,756 INFO L226 Difference]: Without dead ends: 3508 [2018-12-01 15:32:57,756 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-01 15:32:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2018-12-01 15:32:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3448. [2018-12-01 15:32:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3448 states. [2018-12-01 15:32:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 9152 transitions. [2018-12-01 15:32:57,781 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 9152 transitions. Word has length 89 [2018-12-01 15:32:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:57,782 INFO L480 AbstractCegarLoop]: Abstraction has 3448 states and 9152 transitions. [2018-12-01 15:32:57,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:32:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 9152 transitions. [2018-12-01 15:32:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 15:32:57,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:57,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:32:57,785 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:57,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash -549832089, now seen corresponding path program 1 times [2018-12-01 15:32:57,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:57,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:57,812 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-01 15:32:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 15:32:57,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:32:57,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:32:57,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:32:57,812 INFO L87 Difference]: Start difference. First operand 3448 states and 9152 transitions. Second operand 4 states. [2018-12-01 15:32:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:57,943 INFO L93 Difference]: Finished difference Result 4895 states and 13030 transitions. [2018-12-01 15:32:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:32:57,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-01 15:32:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:57,947 INFO L225 Difference]: With dead ends: 4895 [2018-12-01 15:32:57,948 INFO L226 Difference]: Without dead ends: 4895 [2018-12-01 15:32:57,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:32:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2018-12-01 15:32:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 3488. [2018-12-01 15:32:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2018-12-01 15:32:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 9242 transitions. [2018-12-01 15:32:57,980 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 9242 transitions. Word has length 89 [2018-12-01 15:32:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:57,980 INFO L480 AbstractCegarLoop]: Abstraction has 3488 states and 9242 transitions. [2018-12-01 15:32:57,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:32:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 9242 transitions. [2018-12-01 15:32:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 15:32:57,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:57,984 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] [2018-12-01 15:32:57,984 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:57,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1688964463, now seen corresponding path program 2 times [2018-12-01 15:32:57,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:57,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:58,020 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-01 15:32:58,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:32:58,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:32:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:32:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:32:58,021 INFO L87 Difference]: Start difference. First operand 3488 states and 9242 transitions. Second operand 5 states. [2018-12-01 15:32:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:58,157 INFO L93 Difference]: Finished difference Result 4960 states and 12809 transitions. [2018-12-01 15:32:58,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 15:32:58,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-01 15:32:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:58,161 INFO L225 Difference]: With dead ends: 4960 [2018-12-01 15:32:58,161 INFO L226 Difference]: Without dead ends: 4960 [2018-12-01 15:32:58,161 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-01 15:32:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2018-12-01 15:32:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4173. [2018-12-01 15:32:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4173 states. [2018-12-01 15:32:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 10939 transitions. [2018-12-01 15:32:58,193 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 10939 transitions. Word has length 89 [2018-12-01 15:32:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:58,194 INFO L480 AbstractCegarLoop]: Abstraction has 4173 states and 10939 transitions. [2018-12-01 15:32:58,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:32:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 10939 transitions. [2018-12-01 15:32:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 15:32:58,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:58,197 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] [2018-12-01 15:32:58,197 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:58,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1929956275, now seen corresponding path program 3 times [2018-12-01 15:32:58,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:58,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:32:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:58,247 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-01 15:32:58,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:58,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:32:58,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:32:58,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:32:58,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:32:58,248 INFO L87 Difference]: Start difference. First operand 4173 states and 10939 transitions. Second operand 7 states. [2018-12-01 15:32:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:58,520 INFO L93 Difference]: Finished difference Result 5187 states and 13337 transitions. [2018-12-01 15:32:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:32:58,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-01 15:32:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:58,524 INFO L225 Difference]: With dead ends: 5187 [2018-12-01 15:32:58,524 INFO L226 Difference]: Without dead ends: 5108 [2018-12-01 15:32:58,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-01 15:32:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2018-12-01 15:32:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 4355. [2018-12-01 15:32:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2018-12-01 15:32:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 11357 transitions. [2018-12-01 15:32:58,555 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 11357 transitions. Word has length 89 [2018-12-01 15:32:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:58,556 INFO L480 AbstractCegarLoop]: Abstraction has 4355 states and 11357 transitions. [2018-12-01 15:32:58,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:32:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 11357 transitions. [2018-12-01 15:32:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 15:32:58,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:58,559 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] [2018-12-01 15:32:58,559 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:58,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:58,559 INFO L82 PathProgramCache]: Analyzing trace with hash 40983182, now seen corresponding path program 1 times [2018-12-01 15:32:58,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:32:58,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:58,597 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-01 15:32:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:58,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:32:58,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:32:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:32:58,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:32:58,597 INFO L87 Difference]: Start difference. First operand 4355 states and 11357 transitions. Second operand 5 states. [2018-12-01 15:32:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:58,745 INFO L93 Difference]: Finished difference Result 5801 states and 14770 transitions. [2018-12-01 15:32:58,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:32:58,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-01 15:32:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:58,749 INFO L225 Difference]: With dead ends: 5801 [2018-12-01 15:32:58,749 INFO L226 Difference]: Without dead ends: 5737 [2018-12-01 15:32:58,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:32:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2018-12-01 15:32:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 4437. [2018-12-01 15:32:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2018-12-01 15:32:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 11528 transitions. [2018-12-01 15:32:58,783 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 11528 transitions. Word has length 89 [2018-12-01 15:32:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:58,783 INFO L480 AbstractCegarLoop]: Abstraction has 4437 states and 11528 transitions. [2018-12-01 15:32:58,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:32:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 11528 transitions. [2018-12-01 15:32:58,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:32:58,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:58,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:32:58,787 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:58,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1540346686, now seen corresponding path program 1 times [2018-12-01 15:32:58,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:58,817 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-01 15:32:58,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:58,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 15:32:58,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 15:32:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 15:32:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:32:58,817 INFO L87 Difference]: Start difference. First operand 4437 states and 11528 transitions. Second operand 4 states. [2018-12-01 15:32:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:58,897 INFO L93 Difference]: Finished difference Result 7785 states and 20394 transitions. [2018-12-01 15:32:58,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:32:58,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-01 15:32:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:58,903 INFO L225 Difference]: With dead ends: 7785 [2018-12-01 15:32:58,903 INFO L226 Difference]: Without dead ends: 7757 [2018-12-01 15:32:58,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 15:32:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2018-12-01 15:32:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 4179. [2018-12-01 15:32:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-12-01 15:32:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 10785 transitions. [2018-12-01 15:32:58,944 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 10785 transitions. Word has length 91 [2018-12-01 15:32:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:58,945 INFO L480 AbstractCegarLoop]: Abstraction has 4179 states and 10785 transitions. [2018-12-01 15:32:58,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 15:32:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 10785 transitions. [2018-12-01 15:32:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:32:58,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:58,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:32:58,948 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:58,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash -162033363, now seen corresponding path program 1 times [2018-12-01 15:32:58,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:58,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:32:59,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:59,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:32:59,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:32:59,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:32:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:32:59,003 INFO L87 Difference]: Start difference. First operand 4179 states and 10785 transitions. Second operand 6 states. [2018-12-01 15:32:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:59,181 INFO L93 Difference]: Finished difference Result 4586 states and 11717 transitions. [2018-12-01 15:32:59,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:32:59,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-01 15:32:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:59,184 INFO L225 Difference]: With dead ends: 4586 [2018-12-01 15:32:59,184 INFO L226 Difference]: Without dead ends: 4586 [2018-12-01 15:32:59,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:32:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2018-12-01 15:32:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4232. [2018-12-01 15:32:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2018-12-01 15:32:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 10914 transitions. [2018-12-01 15:32:59,213 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 10914 transitions. Word has length 91 [2018-12-01 15:32:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:59,214 INFO L480 AbstractCegarLoop]: Abstraction has 4232 states and 10914 transitions. [2018-12-01 15:32:59,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:32:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 10914 transitions. [2018-12-01 15:32:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:32:59,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:59,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:32:59,217 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:59,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 807547660, now seen corresponding path program 1 times [2018-12-01 15:32:59,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:59,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:59,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:59,280 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-01 15:32:59,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:59,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:32:59,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:32:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:32:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:32:59,281 INFO L87 Difference]: Start difference. First operand 4232 states and 10914 transitions. Second operand 6 states. [2018-12-01 15:32:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:59,414 INFO L93 Difference]: Finished difference Result 6106 states and 15541 transitions. [2018-12-01 15:32:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:32:59,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-01 15:32:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:59,419 INFO L225 Difference]: With dead ends: 6106 [2018-12-01 15:32:59,419 INFO L226 Difference]: Without dead ends: 6074 [2018-12-01 15:32:59,419 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-01 15:32:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2018-12-01 15:32:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 4851. [2018-12-01 15:32:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4851 states. [2018-12-01 15:32:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 12449 transitions. [2018-12-01 15:32:59,461 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 12449 transitions. Word has length 91 [2018-12-01 15:32:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:59,462 INFO L480 AbstractCegarLoop]: Abstraction has 4851 states and 12449 transitions. [2018-12-01 15:32:59,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:32:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 12449 transitions. [2018-12-01 15:32:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:32:59,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:59,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:32:59,467 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:59,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1769161677, now seen corresponding path program 1 times [2018-12-01 15:32:59,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:59,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:59,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:59,518 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-01 15:32:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:32:59,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:32:59,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:32:59,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:32:59,519 INFO L87 Difference]: Start difference. First operand 4851 states and 12449 transitions. Second operand 7 states. [2018-12-01 15:32:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:32:59,799 INFO L93 Difference]: Finished difference Result 9774 states and 25388 transitions. [2018-12-01 15:32:59,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 15:32:59,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 15:32:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:32:59,808 INFO L225 Difference]: With dead ends: 9774 [2018-12-01 15:32:59,808 INFO L226 Difference]: Without dead ends: 9774 [2018-12-01 15:32:59,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-01 15:32:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2018-12-01 15:32:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 5475. [2018-12-01 15:32:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5475 states. [2018-12-01 15:32:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 14083 transitions. [2018-12-01 15:32:59,874 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 14083 transitions. Word has length 91 [2018-12-01 15:32:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:32:59,874 INFO L480 AbstractCegarLoop]: Abstraction has 5475 states and 14083 transitions. [2018-12-01 15:32:59,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:32:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 14083 transitions. [2018-12-01 15:32:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:32:59,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:32:59,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] [2018-12-01 15:32:59,879 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:32:59,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:32:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1281041138, now seen corresponding path program 1 times [2018-12-01 15:32:59,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:32:59,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:32:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:59,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:32:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:32:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:32:59,952 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-01 15:32:59,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:32:59,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:32:59,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:32:59,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:32:59,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:32:59,953 INFO L87 Difference]: Start difference. First operand 5475 states and 14083 transitions. Second operand 7 states. [2018-12-01 15:33:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:00,143 INFO L93 Difference]: Finished difference Result 5137 states and 13135 transitions. [2018-12-01 15:33:00,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:33:00,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 15:33:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:00,148 INFO L225 Difference]: With dead ends: 5137 [2018-12-01 15:33:00,148 INFO L226 Difference]: Without dead ends: 5137 [2018-12-01 15:33:00,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-01 15:33:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2018-12-01 15:33:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 4996. [2018-12-01 15:33:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2018-12-01 15:33:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 12823 transitions. [2018-12-01 15:33:00,198 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 12823 transitions. Word has length 91 [2018-12-01 15:33:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:00,198 INFO L480 AbstractCegarLoop]: Abstraction has 4996 states and 12823 transitions. [2018-12-01 15:33:00,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:33:00,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 12823 transitions. [2018-12-01 15:33:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:33:00,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:00,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:33:00,203 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:00,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1672445698, now seen corresponding path program 1 times [2018-12-01 15:33:00,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:00,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:00,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:00,282 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-01 15:33:00,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:00,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:33:00,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:33:00,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:33:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:33:00,283 INFO L87 Difference]: Start difference. First operand 4996 states and 12823 transitions. Second operand 7 states. [2018-12-01 15:33:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:00,427 INFO L93 Difference]: Finished difference Result 5446 states and 13900 transitions. [2018-12-01 15:33:00,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:33:00,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 15:33:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:00,432 INFO L225 Difference]: With dead ends: 5446 [2018-12-01 15:33:00,432 INFO L226 Difference]: Without dead ends: 5446 [2018-12-01 15:33:00,433 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-01 15:33:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2018-12-01 15:33:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 5036. [2018-12-01 15:33:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2018-12-01 15:33:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 12894 transitions. [2018-12-01 15:33:00,486 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 12894 transitions. Word has length 91 [2018-12-01 15:33:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:00,486 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 12894 transitions. [2018-12-01 15:33:00,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:33:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 12894 transitions. [2018-12-01 15:33:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:33:00,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:00,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:33:00,491 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:00,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1439174301, now seen corresponding path program 1 times [2018-12-01 15:33:00,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:00,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:00,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:00,559 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-01 15:33:00,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:00,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:33:00,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:33:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:33:00,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:33:00,560 INFO L87 Difference]: Start difference. First operand 5036 states and 12894 transitions. Second operand 5 states. [2018-12-01 15:33:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:00,682 INFO L93 Difference]: Finished difference Result 4529 states and 11631 transitions. [2018-12-01 15:33:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:33:00,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 15:33:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:00,685 INFO L225 Difference]: With dead ends: 4529 [2018-12-01 15:33:00,685 INFO L226 Difference]: Without dead ends: 4529 [2018-12-01 15:33:00,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:33:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2018-12-01 15:33:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4491. [2018-12-01 15:33:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2018-12-01 15:33:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 11554 transitions. [2018-12-01 15:33:00,713 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 11554 transitions. Word has length 91 [2018-12-01 15:33:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:00,713 INFO L480 AbstractCegarLoop]: Abstraction has 4491 states and 11554 transitions. [2018-12-01 15:33:00,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:33:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 11554 transitions. [2018-12-01 15:33:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 15:33:00,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:00,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:33:00,716 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:00,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash -347029090, now seen corresponding path program 1 times [2018-12-01 15:33:00,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:00,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:00,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:00,779 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-01 15:33:00,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:00,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:33:00,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:33:00,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:33:00,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:33:00,779 INFO L87 Difference]: Start difference. First operand 4491 states and 11554 transitions. Second operand 6 states. [2018-12-01 15:33:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:00,826 INFO L93 Difference]: Finished difference Result 4075 states and 10146 transitions. [2018-12-01 15:33:00,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:33:00,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-01 15:33:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:00,829 INFO L225 Difference]: With dead ends: 4075 [2018-12-01 15:33:00,830 INFO L226 Difference]: Without dead ends: 4075 [2018-12-01 15:33:00,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:33:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-12-01 15:33:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2421. [2018-12-01 15:33:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2018-12-01 15:33:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 6211 transitions. [2018-12-01 15:33:00,849 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 6211 transitions. Word has length 91 [2018-12-01 15:33:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:00,850 INFO L480 AbstractCegarLoop]: Abstraction has 2421 states and 6211 transitions. [2018-12-01 15:33:00,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:33:00,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 6211 transitions. [2018-12-01 15:33:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:00,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:00,852 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] [2018-12-01 15:33:00,852 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:00,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash -626984130, now seen corresponding path program 1 times [2018-12-01 15:33:00,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:00,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:00,894 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-01 15:33:00,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:00,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:33:00,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:33:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:33:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:33:00,895 INFO L87 Difference]: Start difference. First operand 2421 states and 6211 transitions. Second operand 7 states. [2018-12-01 15:33:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:01,153 INFO L93 Difference]: Finished difference Result 3893 states and 9716 transitions. [2018-12-01 15:33:01,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 15:33:01,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 15:33:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:01,156 INFO L225 Difference]: With dead ends: 3893 [2018-12-01 15:33:01,156 INFO L226 Difference]: Without dead ends: 3861 [2018-12-01 15:33:01,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 15:33:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2018-12-01 15:33:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3073. [2018-12-01 15:33:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-12-01 15:33:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 7791 transitions. [2018-12-01 15:33:01,179 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 7791 transitions. Word has length 93 [2018-12-01 15:33:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:01,179 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 7791 transitions. [2018-12-01 15:33:01,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:33:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 7791 transitions. [2018-12-01 15:33:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:01,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:01,182 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] [2018-12-01 15:33:01,182 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:01,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash 617780351, now seen corresponding path program 1 times [2018-12-01 15:33:01,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:01,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:01,237 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-01 15:33:01,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:33:01,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:33:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:33:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:33:01,237 INFO L87 Difference]: Start difference. First operand 3073 states and 7791 transitions. Second operand 6 states. [2018-12-01 15:33:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:01,303 INFO L93 Difference]: Finished difference Result 3123 states and 7833 transitions. [2018-12-01 15:33:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 15:33:01,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 15:33:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:01,306 INFO L225 Difference]: With dead ends: 3123 [2018-12-01 15:33:01,306 INFO L226 Difference]: Without dead ends: 3123 [2018-12-01 15:33:01,306 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-01 15:33:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2018-12-01 15:33:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3043. [2018-12-01 15:33:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-12-01 15:33:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 7679 transitions. [2018-12-01 15:33:01,330 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 7679 transitions. Word has length 93 [2018-12-01 15:33:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:01,330 INFO L480 AbstractCegarLoop]: Abstraction has 3043 states and 7679 transitions. [2018-12-01 15:33:01,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:33:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 7679 transitions. [2018-12-01 15:33:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:01,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:01,333 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] [2018-12-01 15:33:01,333 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:01,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash -297218369, now seen corresponding path program 1 times [2018-12-01 15:33:01,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:01,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:01,397 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-01 15:33:01,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:01,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:33:01,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:33:01,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:33:01,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:33:01,397 INFO L87 Difference]: Start difference. First operand 3043 states and 7679 transitions. Second operand 6 states. [2018-12-01 15:33:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:01,525 INFO L93 Difference]: Finished difference Result 3582 states and 8908 transitions. [2018-12-01 15:33:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:33:01,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 15:33:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:01,528 INFO L225 Difference]: With dead ends: 3582 [2018-12-01 15:33:01,528 INFO L226 Difference]: Without dead ends: 3582 [2018-12-01 15:33:01,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 15:33:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2018-12-01 15:33:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3082. [2018-12-01 15:33:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-12-01 15:33:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 7728 transitions. [2018-12-01 15:33:01,549 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 7728 transitions. Word has length 93 [2018-12-01 15:33:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:01,550 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 7728 transitions. [2018-12-01 15:33:01,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:33:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 7728 transitions. [2018-12-01 15:33:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:01,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:01,551 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] [2018-12-01 15:33:01,552 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:01,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1093073861, now seen corresponding path program 2 times [2018-12-01 15:33:01,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:01,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:01,614 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-01 15:33:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:01,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:33:01,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:33:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:33:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:33:01,615 INFO L87 Difference]: Start difference. First operand 3082 states and 7728 transitions. Second operand 7 states. [2018-12-01 15:33:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:01,781 INFO L93 Difference]: Finished difference Result 3099 states and 7760 transitions. [2018-12-01 15:33:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 15:33:01,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 15:33:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:01,784 INFO L225 Difference]: With dead ends: 3099 [2018-12-01 15:33:01,784 INFO L226 Difference]: Without dead ends: 3099 [2018-12-01 15:33:01,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-01 15:33:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2018-12-01 15:33:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3082. [2018-12-01 15:33:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-12-01 15:33:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 7725 transitions. [2018-12-01 15:33:01,804 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 7725 transitions. Word has length 93 [2018-12-01 15:33:01,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:01,805 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 7725 transitions. [2018-12-01 15:33:01,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:33:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 7725 transitions. [2018-12-01 15:33:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:01,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:01,806 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] [2018-12-01 15:33:01,807 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:01,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:01,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1409070332, now seen corresponding path program 1 times [2018-12-01 15:33:01,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:01,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:33:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:01,874 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-01 15:33:01,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:01,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:33:01,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:33:01,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:33:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:33:01,875 INFO L87 Difference]: Start difference. First operand 3082 states and 7725 transitions. Second operand 7 states. [2018-12-01 15:33:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:02,064 INFO L93 Difference]: Finished difference Result 4056 states and 10447 transitions. [2018-12-01 15:33:02,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:33:02,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 15:33:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:02,068 INFO L225 Difference]: With dead ends: 4056 [2018-12-01 15:33:02,068 INFO L226 Difference]: Without dead ends: 4056 [2018-12-01 15:33:02,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-01 15:33:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2018-12-01 15:33:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2458. [2018-12-01 15:33:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2018-12-01 15:33:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 6206 transitions. [2018-12-01 15:33:02,092 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 6206 transitions. Word has length 93 [2018-12-01 15:33:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:02,092 INFO L480 AbstractCegarLoop]: Abstraction has 2458 states and 6206 transitions. [2018-12-01 15:33:02,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:33:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 6206 transitions. [2018-12-01 15:33:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:02,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:02,094 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] [2018-12-01 15:33:02,095 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:02,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash 494071612, now seen corresponding path program 1 times [2018-12-01 15:33:02,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:02,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:33:02,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:02,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 15:33:02,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 15:33:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:33:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:33:02,140 INFO L87 Difference]: Start difference. First operand 2458 states and 6206 transitions. Second operand 5 states. [2018-12-01 15:33:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:02,267 INFO L93 Difference]: Finished difference Result 2810 states and 7070 transitions. [2018-12-01 15:33:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:33:02,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-01 15:33:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:02,270 INFO L225 Difference]: With dead ends: 2810 [2018-12-01 15:33:02,270 INFO L226 Difference]: Without dead ends: 2778 [2018-12-01 15:33:02,270 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-01 15:33:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2018-12-01 15:33:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2506. [2018-12-01 15:33:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2018-12-01 15:33:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6310 transitions. [2018-12-01 15:33:02,292 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6310 transitions. Word has length 93 [2018-12-01 15:33:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:02,292 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 6310 transitions. [2018-12-01 15:33:02,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 15:33:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6310 transitions. [2018-12-01 15:33:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:02,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 15:33:02,295 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:02,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1738836093, now seen corresponding path program 1 times [2018-12-01 15:33:02,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:02,360 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-01 15:33:02,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:02,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 15:33:02,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 15:33:02,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 15:33:02,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:33:02,361 INFO L87 Difference]: Start difference. First operand 2506 states and 6310 transitions. Second operand 7 states. [2018-12-01 15:33:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:02,505 INFO L93 Difference]: Finished difference Result 4157 states and 10693 transitions. [2018-12-01 15:33:02,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 15:33:02,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 15:33:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:02,506 INFO L225 Difference]: With dead ends: 4157 [2018-12-01 15:33:02,506 INFO L226 Difference]: Without dead ends: 1726 [2018-12-01 15:33:02,507 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-01 15:33:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-12-01 15:33:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2018-12-01 15:33:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-12-01 15:33:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4513 transitions. [2018-12-01 15:33:02,518 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4513 transitions. Word has length 93 [2018-12-01 15:33:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:02,518 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 4513 transitions. [2018-12-01 15:33:02,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 15:33:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4513 transitions. [2018-12-01 15:33:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:02,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:02,519 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] [2018-12-01 15:33:02,519 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:02,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1752144950, now seen corresponding path program 1 times [2018-12-01 15:33:02,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:02,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:02,567 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-01 15:33:02,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:02,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 15:33:02,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 15:33:02,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:33:02,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:33:02,568 INFO L87 Difference]: Start difference. First operand 1726 states and 4513 transitions. Second operand 6 states. [2018-12-01 15:33:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:02,631 INFO L93 Difference]: Finished difference Result 1812 states and 4666 transitions. [2018-12-01 15:33:02,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 15:33:02,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 15:33:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:02,632 INFO L225 Difference]: With dead ends: 1812 [2018-12-01 15:33:02,632 INFO L226 Difference]: Without dead ends: 1792 [2018-12-01 15:33:02,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 15:33:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2018-12-01 15:33:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1718. [2018-12-01 15:33:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2018-12-01 15:33:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 4487 transitions. [2018-12-01 15:33:02,644 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 4487 transitions. Word has length 93 [2018-12-01 15:33:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:02,644 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 4487 transitions. [2018-12-01 15:33:02,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 15:33:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 4487 transitions. [2018-12-01 15:33:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:02,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:02,646 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] [2018-12-01 15:33:02,646 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:02,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 2 times [2018-12-01 15:33:02,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:33:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:33:02,732 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-01 15:33:02,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:33:02,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 15:33:02,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 15:33:02,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 15:33:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 15:33:02,733 INFO L87 Difference]: Start difference. First operand 1718 states and 4487 transitions. Second operand 12 states. [2018-12-01 15:33:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:33:03,067 INFO L93 Difference]: Finished difference Result 3315 states and 8720 transitions. [2018-12-01 15:33:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 15:33:03,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-01 15:33:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:33:03,069 INFO L225 Difference]: With dead ends: 3315 [2018-12-01 15:33:03,069 INFO L226 Difference]: Without dead ends: 2339 [2018-12-01 15:33:03,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-01 15:33:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2018-12-01 15:33:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2187. [2018-12-01 15:33:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2018-12-01 15:33:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 5546 transitions. [2018-12-01 15:33:03,088 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 5546 transitions. Word has length 93 [2018-12-01 15:33:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:33:03,088 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 5546 transitions. [2018-12-01 15:33:03,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 15:33:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 5546 transitions. [2018-12-01 15:33:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 15:33:03,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:33:03,090 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] [2018-12-01 15:33:03,090 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:33:03,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:33:03,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1369725745, now seen corresponding path program 3 times [2018-12-01 15:33:03,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:33:03,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:33:03,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:03,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:33:03,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:33:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:33:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:33:03,132 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 15:33:03,200 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 15:33:03,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:33:03 BasicIcfg [2018-12-01 15:33:03,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 15:33:03,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:33:03,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:33:03,202 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:33:03,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:32:49" (3/4) ... [2018-12-01 15:33:03,205 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 15:33:03,280 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bd8846f8-8f4b-41e2-828f-e9366adcfdfc/bin-2019/uautomizer/witness.graphml [2018-12-01 15:33:03,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:33:03,280 INFO L168 Benchmark]: Toolchain (without parser) took 14562.77 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 951.7 MB in the beginning and 842.2 MB in the end (delta: 109.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-01 15:33:03,281 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:33:03,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -91.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-01 15:33:03,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-01 15:33:03,282 INFO L168 Benchmark]: Boogie Preprocessor took 18.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:33:03,282 INFO L168 Benchmark]: RCFGBuilder took 325.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.4 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-12-01 15:33:03,283 INFO L168 Benchmark]: TraceAbstraction took 13746.61 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 990.4 MB in the beginning and 869.8 MB in the end (delta: 120.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-01 15:33:03,283 INFO L168 Benchmark]: Witness Printer took 77.83 ms. Allocated memory is still 2.3 GB. Free memory was 869.8 MB in the beginning and 842.2 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2018-12-01 15:33:03,285 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 951.7 MB in the beginning and 1.0 GB in the end (delta: -91.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 325.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.4 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13746.61 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 990.4 MB in the beginning and 869.8 MB in the end (delta: 120.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 77.83 ms. Allocated memory is still 2.3 GB. Free memory was 869.8 MB in the beginning and 842.2 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2481, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2482; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2482, ((void *)0), P1, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 13.6s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6365 SDtfs, 6376 SDslu, 13421 SDs, 0 SdLazy, 6052 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 91 SyntacticMatches, 13 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37140occurred in iteration=2, 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: 3.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 100107 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2475 NumberOfCodeBlocks, 2475 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2353 ConstructedInterpolants, 0 QuantifiedInterpolants, 491429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...