./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/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 aac2a7ad1130f4cb0499bd7cde65df0a82a8d241 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:47:30,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:47:30,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:47:30,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:47:30,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:47:30,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:47:30,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:47:30,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:47:30,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:47:30,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:47:30,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:47:30,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:47:30,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:47:30,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:47:30,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:47:30,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:47:30,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:47:30,144 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:47:30,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:47:30,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:47:30,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:47:30,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:47:30,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:47:30,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:47:30,150 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:47:30,151 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:47:30,152 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:47:30,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:47:30,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:47:30,153 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:47:30,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:47:30,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:47:30,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:47:30,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:47:30,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:47:30,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:47:30,155 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 12:47:30,166 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:47:30,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:47:30,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:47:30,166 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:47:30,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:47:30,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:47:30,167 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 12:47:30,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:47:30,167 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:47:30,167 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:47:30,167 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:47:30,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:47:30,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:47:30,169 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:47:30,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:47:30,169 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_24657586-b6bc-41b3-ad53-494155ee388c/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 -> aac2a7ad1130f4cb0499bd7cde65df0a82a8d241 [2018-12-02 12:47:30,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:47:30,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:47:30,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:47:30,204 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:47:30,204 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:47:30,205 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix012_power.opt_false-unreach-call.i [2018-12-02 12:47:30,244 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/data/fe3fdf8eb/fb95f1586ea44ec7b43d7cc1ee41c705/FLAGccda02f04 [2018-12-02 12:47:30,732 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:47:30,732 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/sv-benchmarks/c/pthread-wmm/mix012_power.opt_false-unreach-call.i [2018-12-02 12:47:30,740 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/data/fe3fdf8eb/fb95f1586ea44ec7b43d7cc1ee41c705/FLAGccda02f04 [2018-12-02 12:47:30,748 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/data/fe3fdf8eb/fb95f1586ea44ec7b43d7cc1ee41c705 [2018-12-02 12:47:30,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:47:30,751 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:47:30,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:47:30,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:47:30,753 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:47:30,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:30, skipping insertion in model container [2018-12-02 12:47:30,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:47:30" (1/1) ... [2018-12-02 12:47:30,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:47:30,782 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:47:30,963 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:47:30,970 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:47:31,060 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:47:31,090 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:47:31,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31 WrapperNode [2018-12-02 12:47:31,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:47:31,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:47:31,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:47:31,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:47:31,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:47:31,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:47:31,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:47:31,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:47:31,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... [2018-12-02 12:47:31,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:47:31,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:47:31,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:47:31,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:47:31,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:47:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:47:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:47:31,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:47:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:47:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:47:31,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:47:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:47:31,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:47:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:47:31,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:47:31,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:47:31,193 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 12:47:31,496 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:47:31,496 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:47:31,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:31 BoogieIcfgContainer [2018-12-02 12:47:31,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:47:31,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:47:31,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:47:31,498 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:47:31,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:47:30" (1/3) ... [2018-12-02 12:47:31,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb6c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:47:31, skipping insertion in model container [2018-12-02 12:47:31,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:47:31" (2/3) ... [2018-12-02 12:47:31,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb6c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:47:31, skipping insertion in model container [2018-12-02 12:47:31,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:31" (3/3) ... [2018-12-02 12:47:31,500 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.opt_false-unreach-call.i [2018-12-02 12:47:31,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,523 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,523 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,523 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,523 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,527 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,528 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,529 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,530 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:47:31,543 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:47:31,543 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:47:31,548 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:47:31,557 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:47:31,571 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:47:31,572 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:47:31,572 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:47:31,572 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:47:31,572 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:47:31,572 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:47:31,572 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:47:31,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:47:31,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:47:31,578 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 12:47:32,924 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 12:47:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 12:47:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 12:47:32,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:32,930 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] [2018-12-02 12:47:32,932 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:32,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:32,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-02 12:47:32,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:32,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:32,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:33,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:33,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:47:33,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:47:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:47:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:33,101 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 12:47:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:33,684 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 12:47:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:47:33,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 12:47:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:33,836 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 12:47:33,836 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 12:47:33,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 12:47:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 12:47:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 12:47:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 12:47:34,555 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 12:47:34,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:34,555 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 12:47:34,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:47:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 12:47:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 12:47:34,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:34,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:34,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:34,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:34,562 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-02 12:47:34,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:34,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:34,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:34,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:34,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:34,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:34,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:34,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:34,619 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-02 12:47:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:35,255 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-02 12:47:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:47:35,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 12:47:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:35,399 INFO L225 Difference]: With dead ends: 64005 [2018-12-02 12:47:35,399 INFO L226 Difference]: Without dead ends: 63453 [2018-12-02 12:47:35,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:47:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-02 12:47:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-02 12:47:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-02 12:47:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-02 12:47:36,190 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-02 12:47:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:36,191 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-02 12:47:36,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-02 12:47:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 12:47:36,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:36,194 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] [2018-12-02 12:47:36,194 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:36,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-02 12:47:36,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:36,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:36,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:36,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-02 12:47:36,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:36,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:36,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:36,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:36,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:36,243 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-02 12:47:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:36,636 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-02 12:47:36,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:47:36,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 12:47:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:36,778 INFO L225 Difference]: With dead ends: 81367 [2018-12-02 12:47:36,778 INFO L226 Difference]: Without dead ends: 80855 [2018-12-02 12:47:36,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:47:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-02 12:47:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-02 12:47:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-02 12:47:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-02 12:47:37,740 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-02 12:47:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:37,741 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-02 12:47:37,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-02 12:47:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 12:47:37,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:37,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:37,746 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:37,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-02 12:47:37,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:37,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:37,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:37,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:37,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:47:37,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:47:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:47:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:37,783 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-02 12:47:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:37,991 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-02 12:47:37,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:47:37,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 12:47:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:38,110 INFO L225 Difference]: With dead ends: 65251 [2018-12-02 12:47:38,110 INFO L226 Difference]: Without dead ends: 65251 [2018-12-02 12:47:38,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-02 12:47:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-02 12:47:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-02 12:47:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-02 12:47:39,003 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-02 12:47:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:39,003 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-02 12:47:39,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:47:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-02 12:47:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:47:39,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:39,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:39,011 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:39,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:39,011 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-02 12:47:39,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:39,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:39,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:39,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:39,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:39,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:39,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:39,084 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-02 12:47:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:39,613 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-02 12:47:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:47:39,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 12:47:39,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:39,729 INFO L225 Difference]: With dead ends: 67511 [2018-12-02 12:47:39,729 INFO L226 Difference]: Without dead ends: 67511 [2018-12-02 12:47:39,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:47:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-02 12:47:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-02 12:47:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-02 12:47:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-02 12:47:40,746 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-02 12:47:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:40,746 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-02 12:47:40,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-02 12:47:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:47:40,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:40,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:40,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:40,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-02 12:47:40,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:40,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:40,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:40,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:40,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:40,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:40,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:47:40,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:47:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:47:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:40,820 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-02 12:47:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:41,789 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-02 12:47:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:47:41,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 12:47:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:41,935 INFO L225 Difference]: With dead ends: 88528 [2018-12-02 12:47:41,935 INFO L226 Difference]: Without dead ends: 88528 [2018-12-02 12:47:41,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:47:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-02 12:47:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-02 12:47:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-02 12:47:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-02 12:47:43,145 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-02 12:47:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:43,146 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-02 12:47:43,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:47:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-02 12:47:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:47:43,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:43,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:43,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:43,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-02 12:47:43,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:43,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:43,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:43,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:47:43,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:47:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:47:43,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:43,188 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-02 12:47:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:43,371 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-02 12:47:43,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:47:43,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 12:47:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:43,468 INFO L225 Difference]: With dead ends: 57182 [2018-12-02 12:47:43,469 INFO L226 Difference]: Without dead ends: 57182 [2018-12-02 12:47:43,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-02 12:47:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-02 12:47:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-02 12:47:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-02 12:47:44,442 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-02 12:47:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:44,442 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-02 12:47:44,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:47:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-02 12:47:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 12:47:44,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:44,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:44,448 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:44,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-02 12:47:44,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:44,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:44,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:44,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:44,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:44,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:44,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:44,495 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-02 12:47:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:45,007 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-02 12:47:45,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:47:45,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 12:47:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:45,167 INFO L225 Difference]: With dead ends: 97908 [2018-12-02 12:47:45,167 INFO L226 Difference]: Without dead ends: 97332 [2018-12-02 12:47:45,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:47:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-02 12:47:46,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-02 12:47:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-02 12:47:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-02 12:47:46,249 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-02 12:47:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:46,249 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-02 12:47:46,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-02 12:47:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 12:47:46,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:46,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:46,256 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:46,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-02 12:47:46,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:46,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:46,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:46,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:46,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:46,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:46,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:47:46,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:47:46,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:47:46,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:46,280 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 4 states. [2018-12-02 12:47:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:46,338 INFO L93 Difference]: Finished difference Result 12705 states and 39586 transitions. [2018-12-02 12:47:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:47:46,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 12:47:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:46,350 INFO L225 Difference]: With dead ends: 12705 [2018-12-02 12:47:46,350 INFO L226 Difference]: Without dead ends: 10887 [2018-12-02 12:47:46,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-02 12:47:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-02 12:47:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-02 12:47:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33402 transitions. [2018-12-02 12:47:46,541 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33402 transitions. Word has length 54 [2018-12-02 12:47:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:46,542 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33402 transitions. [2018-12-02 12:47:46,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:47:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33402 transitions. [2018-12-02 12:47:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 12:47:46,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:46,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:46,545 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:46,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-02 12:47:46,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:46,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:46,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:46,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:47:46,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:47:46,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:47:46,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:46,569 INFO L87 Difference]: Start difference. First operand 10839 states and 33402 transitions. Second operand 4 states. [2018-12-02 12:47:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:46,657 INFO L93 Difference]: Finished difference Result 12386 states and 38231 transitions. [2018-12-02 12:47:46,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:47:46,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 12:47:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:46,670 INFO L225 Difference]: With dead ends: 12386 [2018-12-02 12:47:46,670 INFO L226 Difference]: Without dead ends: 12386 [2018-12-02 12:47:46,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-02 12:47:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-02 12:47:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-02 12:47:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 35015 transitions. [2018-12-02 12:47:46,781 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 35015 transitions. Word has length 61 [2018-12-02 12:47:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:46,781 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 35015 transitions. [2018-12-02 12:47:46,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:47:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 35015 transitions. [2018-12-02 12:47:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 12:47:46,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:46,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:46,784 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:46,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-02 12:47:46,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:46,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:46,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:46,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:46,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:46,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:46,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:46,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:46,828 INFO L87 Difference]: Start difference. First operand 11359 states and 35015 transitions. Second operand 6 states. [2018-12-02 12:47:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:47,059 INFO L93 Difference]: Finished difference Result 20935 states and 64448 transitions. [2018-12-02 12:47:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:47:47,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 12:47:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:47,081 INFO L225 Difference]: With dead ends: 20935 [2018-12-02 12:47:47,081 INFO L226 Difference]: Without dead ends: 20864 [2018-12-02 12:47:47,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:47:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-02 12:47:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-02 12:47:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-02 12:47:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40712 transitions. [2018-12-02 12:47:47,253 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40712 transitions. Word has length 61 [2018-12-02 12:47:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:47,253 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40712 transitions. [2018-12-02 12:47:47,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40712 transitions. [2018-12-02 12:47:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:47,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:47,257 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] [2018-12-02 12:47:47,257 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:47,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1555758839, now seen corresponding path program 1 times [2018-12-02 12:47:47,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:47,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:47,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:47,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-02 12:47:47,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:47,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:47:47,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:47:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:47:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:47,280 INFO L87 Difference]: Start difference. First operand 13298 states and 40712 transitions. Second operand 3 states. [2018-12-02 12:47:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:47,405 INFO L93 Difference]: Finished difference Result 13930 states and 42364 transitions. [2018-12-02 12:47:47,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:47:47,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 12:47:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:47,419 INFO L225 Difference]: With dead ends: 13930 [2018-12-02 12:47:47,419 INFO L226 Difference]: Without dead ends: 13930 [2018-12-02 12:47:47,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-02 12:47:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-02 12:47:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-02 12:47:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41538 transitions. [2018-12-02 12:47:47,547 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41538 transitions. Word has length 67 [2018-12-02 12:47:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:47,547 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41538 transitions. [2018-12-02 12:47:47,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:47:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41538 transitions. [2018-12-02 12:47:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:47,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:47,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] [2018-12-02 12:47:47,551 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:47,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash 594144822, now seen corresponding path program 1 times [2018-12-02 12:47:47,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:47,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:47,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:47,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:47,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:47:47,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:47:47,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:47:47,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:47,585 INFO L87 Difference]: Start difference. First operand 13614 states and 41538 transitions. Second operand 4 states. [2018-12-02 12:47:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:47,744 INFO L93 Difference]: Finished difference Result 17463 states and 52743 transitions. [2018-12-02 12:47:47,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:47:47,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 12:47:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:47,761 INFO L225 Difference]: With dead ends: 17463 [2018-12-02 12:47:47,761 INFO L226 Difference]: Without dead ends: 17463 [2018-12-02 12:47:47,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-02 12:47:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-02 12:47:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-02 12:47:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46198 transitions. [2018-12-02 12:47:47,915 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46198 transitions. Word has length 67 [2018-12-02 12:47:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:47,915 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46198 transitions. [2018-12-02 12:47:47,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:47:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46198 transitions. [2018-12-02 12:47:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:47,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:47,920 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] [2018-12-02 12:47:47,920 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:47,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1838909303, now seen corresponding path program 1 times [2018-12-02 12:47:47,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:47,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:47,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:47,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:47,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:47,967 INFO L87 Difference]: Start difference. First operand 15244 states and 46198 transitions. Second operand 6 states. [2018-12-02 12:47:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:48,462 INFO L93 Difference]: Finished difference Result 18862 states and 56126 transitions. [2018-12-02 12:47:48,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:47:48,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 12:47:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:48,481 INFO L225 Difference]: With dead ends: 18862 [2018-12-02 12:47:48,481 INFO L226 Difference]: Without dead ends: 18862 [2018-12-02 12:47:48,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-02 12:47:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-02 12:47:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-02 12:47:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53178 transitions. [2018-12-02 12:47:48,658 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53178 transitions. Word has length 67 [2018-12-02 12:47:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:48,658 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53178 transitions. [2018-12-02 12:47:48,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53178 transitions. [2018-12-02 12:47:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:48,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:48,664 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] [2018-12-02 12:47:48,664 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:48,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash -238300040, now seen corresponding path program 1 times [2018-12-02 12:47:48,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:48,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:48,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:48,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:48,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:48,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:48,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:48,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:48,736 INFO L87 Difference]: Start difference. First operand 17720 states and 53178 transitions. Second operand 6 states. [2018-12-02 12:47:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:48,976 INFO L93 Difference]: Finished difference Result 20389 states and 59240 transitions. [2018-12-02 12:47:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:47:48,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 12:47:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:48,995 INFO L225 Difference]: With dead ends: 20389 [2018-12-02 12:47:48,996 INFO L226 Difference]: Without dead ends: 20389 [2018-12-02 12:47:48,996 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-02 12:47:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-02 12:47:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-02 12:47:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-02 12:47:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53189 transitions. [2018-12-02 12:47:49,180 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53189 transitions. Word has length 67 [2018-12-02 12:47:49,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:49,181 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53189 transitions. [2018-12-02 12:47:49,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53189 transitions. [2018-12-02 12:47:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:49,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:49,187 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] [2018-12-02 12:47:49,187 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:49,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:49,187 INFO L82 PathProgramCache]: Analyzing trace with hash -26949127, now seen corresponding path program 1 times [2018-12-02 12:47:49,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:49,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:49,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:49,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:49,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:49,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:49,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:49,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:49,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:49,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:49,229 INFO L87 Difference]: Start difference. First operand 18002 states and 53189 transitions. Second operand 5 states. [2018-12-02 12:47:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:49,437 INFO L93 Difference]: Finished difference Result 23413 states and 68682 transitions. [2018-12-02 12:47:49,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:47:49,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 12:47:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:49,460 INFO L225 Difference]: With dead ends: 23413 [2018-12-02 12:47:49,460 INFO L226 Difference]: Without dead ends: 23413 [2018-12-02 12:47:49,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-02 12:47:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-02 12:47:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-02 12:47:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62593 transitions. [2018-12-02 12:47:49,682 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62593 transitions. Word has length 67 [2018-12-02 12:47:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:49,682 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62593 transitions. [2018-12-02 12:47:49,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62593 transitions. [2018-12-02 12:47:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:49,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:49,689 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] [2018-12-02 12:47:49,689 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:49,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:49,689 INFO L82 PathProgramCache]: Analyzing trace with hash -537483304, now seen corresponding path program 1 times [2018-12-02 12:47:49,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:49,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:49,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:49,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:49,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:49,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:47:49,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:47:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:47:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:49,734 INFO L87 Difference]: Start difference. First operand 21350 states and 62593 transitions. Second operand 4 states. [2018-12-02 12:47:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:50,058 INFO L93 Difference]: Finished difference Result 26758 states and 78553 transitions. [2018-12-02 12:47:50,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:47:50,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 12:47:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:50,086 INFO L225 Difference]: With dead ends: 26758 [2018-12-02 12:47:50,086 INFO L226 Difference]: Without dead ends: 26462 [2018-12-02 12:47:50,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26462 states. [2018-12-02 12:47:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26462 to 25142. [2018-12-02 12:47:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25142 states. [2018-12-02 12:47:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 73709 transitions. [2018-12-02 12:47:50,384 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 73709 transitions. Word has length 67 [2018-12-02 12:47:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:50,384 INFO L480 AbstractCegarLoop]: Abstraction has 25142 states and 73709 transitions. [2018-12-02 12:47:50,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:47:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 73709 transitions. [2018-12-02 12:47:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:50,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:50,390 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] [2018-12-02 12:47:50,391 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:50,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1960532633, now seen corresponding path program 1 times [2018-12-02 12:47:50,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:50,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:50,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:50,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:47:50,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:47:50,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:47:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:47:50,458 INFO L87 Difference]: Start difference. First operand 25142 states and 73709 transitions. Second operand 9 states. [2018-12-02 12:47:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:51,073 INFO L93 Difference]: Finished difference Result 33665 states and 98229 transitions. [2018-12-02 12:47:51,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:47:51,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-12-02 12:47:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:51,108 INFO L225 Difference]: With dead ends: 33665 [2018-12-02 12:47:51,108 INFO L226 Difference]: Without dead ends: 33665 [2018-12-02 12:47:51,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:47:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33665 states. [2018-12-02 12:47:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33665 to 29137. [2018-12-02 12:47:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29137 states. [2018-12-02 12:47:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29137 states to 29137 states and 85055 transitions. [2018-12-02 12:47:51,419 INFO L78 Accepts]: Start accepts. Automaton has 29137 states and 85055 transitions. Word has length 67 [2018-12-02 12:47:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:51,419 INFO L480 AbstractCegarLoop]: Abstraction has 29137 states and 85055 transitions. [2018-12-02 12:47:51,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:47:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 29137 states and 85055 transitions. [2018-12-02 12:47:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:51,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:51,427 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] [2018-12-02 12:47:51,427 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:51,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1446930982, now seen corresponding path program 1 times [2018-12-02 12:47:51,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:51,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:51,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:51,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:51,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:51,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:51,461 INFO L87 Difference]: Start difference. First operand 29137 states and 85055 transitions. Second operand 5 states. [2018-12-02 12:47:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:51,492 INFO L93 Difference]: Finished difference Result 7701 states and 18578 transitions. [2018-12-02 12:47:51,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:47:51,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 12:47:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:51,497 INFO L225 Difference]: With dead ends: 7701 [2018-12-02 12:47:51,497 INFO L226 Difference]: Without dead ends: 6251 [2018-12-02 12:47:51,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2018-12-02 12:47:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 5430. [2018-12-02 12:47:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5430 states. [2018-12-02 12:47:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5430 states to 5430 states and 12664 transitions. [2018-12-02 12:47:51,540 INFO L78 Accepts]: Start accepts. Automaton has 5430 states and 12664 transitions. Word has length 67 [2018-12-02 12:47:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:51,540 INFO L480 AbstractCegarLoop]: Abstraction has 5430 states and 12664 transitions. [2018-12-02 12:47:51,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5430 states and 12664 transitions. [2018-12-02 12:47:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 12:47:51,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:51,543 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] [2018-12-02 12:47:51,544 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:51,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:51,544 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-02 12:47:51,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:51,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:51,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:47:51,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:47:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:47:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:51,556 INFO L87 Difference]: Start difference. First operand 5430 states and 12664 transitions. Second operand 3 states. [2018-12-02 12:47:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:51,593 INFO L93 Difference]: Finished difference Result 7040 states and 16231 transitions. [2018-12-02 12:47:51,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:47:51,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 12:47:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:51,598 INFO L225 Difference]: With dead ends: 7040 [2018-12-02 12:47:51,598 INFO L226 Difference]: Without dead ends: 7040 [2018-12-02 12:47:51,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:47:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2018-12-02 12:47:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 5367. [2018-12-02 12:47:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5367 states. [2018-12-02 12:47:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5367 states to 5367 states and 12202 transitions. [2018-12-02 12:47:51,640 INFO L78 Accepts]: Start accepts. Automaton has 5367 states and 12202 transitions. Word has length 67 [2018-12-02 12:47:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:51,640 INFO L480 AbstractCegarLoop]: Abstraction has 5367 states and 12202 transitions. [2018-12-02 12:47:51,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:47:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5367 states and 12202 transitions. [2018-12-02 12:47:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 12:47:51,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:51,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] [2018-12-02 12:47:51,644 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:51,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-02 12:47:51,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:51,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:51,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:51,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:51,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:51,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:51,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:51,677 INFO L87 Difference]: Start difference. First operand 5367 states and 12202 transitions. Second operand 5 states. [2018-12-02 12:47:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:51,776 INFO L93 Difference]: Finished difference Result 6531 states and 14826 transitions. [2018-12-02 12:47:51,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:47:51,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 12:47:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:51,780 INFO L225 Difference]: With dead ends: 6531 [2018-12-02 12:47:51,781 INFO L226 Difference]: Without dead ends: 6531 [2018-12-02 12:47:51,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:47:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6531 states. [2018-12-02 12:47:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6531 to 5811. [2018-12-02 12:47:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5811 states. [2018-12-02 12:47:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 13206 transitions. [2018-12-02 12:47:51,821 INFO L78 Accepts]: Start accepts. Automaton has 5811 states and 13206 transitions. Word has length 73 [2018-12-02 12:47:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:51,821 INFO L480 AbstractCegarLoop]: Abstraction has 5811 states and 13206 transitions. [2018-12-02 12:47:51,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5811 states and 13206 transitions. [2018-12-02 12:47:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 12:47:51,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:51,827 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] [2018-12-02 12:47:51,827 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:51,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-02 12:47:51,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:51,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:51,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:51,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:47:51,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:47:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:47:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:51,883 INFO L87 Difference]: Start difference. First operand 5811 states and 13206 transitions. Second operand 7 states. [2018-12-02 12:47:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:52,097 INFO L93 Difference]: Finished difference Result 7005 states and 15751 transitions. [2018-12-02 12:47:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:47:52,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 12:47:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:52,101 INFO L225 Difference]: With dead ends: 7005 [2018-12-02 12:47:52,102 INFO L226 Difference]: Without dead ends: 6886 [2018-12-02 12:47:52,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 12:47:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-12-02 12:47:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 5900. [2018-12-02 12:47:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5900 states. [2018-12-02 12:47:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5900 states to 5900 states and 13275 transitions. [2018-12-02 12:47:52,144 INFO L78 Accepts]: Start accepts. Automaton has 5900 states and 13275 transitions. Word has length 73 [2018-12-02 12:47:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:52,144 INFO L480 AbstractCegarLoop]: Abstraction has 5900 states and 13275 transitions. [2018-12-02 12:47:52,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:47:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5900 states and 13275 transitions. [2018-12-02 12:47:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:47:52,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:52,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:52,149 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:52,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1741653737, now seen corresponding path program 1 times [2018-12-02 12:47:52,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:52,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:52,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:52,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:52,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:52,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:52,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:52,200 INFO L87 Difference]: Start difference. First operand 5900 states and 13275 transitions. Second operand 5 states. [2018-12-02 12:47:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:52,389 INFO L93 Difference]: Finished difference Result 5452 states and 12136 transitions. [2018-12-02 12:47:52,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:47:52,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 12:47:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:52,392 INFO L225 Difference]: With dead ends: 5452 [2018-12-02 12:47:52,392 INFO L226 Difference]: Without dead ends: 5452 [2018-12-02 12:47:52,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2018-12-02 12:47:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5053. [2018-12-02 12:47:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5053 states. [2018-12-02 12:47:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5053 states to 5053 states and 11230 transitions. [2018-12-02 12:47:52,425 INFO L78 Accepts]: Start accepts. Automaton has 5053 states and 11230 transitions. Word has length 94 [2018-12-02 12:47:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:52,425 INFO L480 AbstractCegarLoop]: Abstraction has 5053 states and 11230 transitions. [2018-12-02 12:47:52,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5053 states and 11230 transitions. [2018-12-02 12:47:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 12:47:52,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:52,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:52,428 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:52,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1883867464, now seen corresponding path program 1 times [2018-12-02 12:47:52,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:52,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:52,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:52,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:52,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:47:52,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:47:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:47:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:47:52,459 INFO L87 Difference]: Start difference. First operand 5053 states and 11230 transitions. Second operand 4 states. [2018-12-02 12:47:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:52,523 INFO L93 Difference]: Finished difference Result 6237 states and 13788 transitions. [2018-12-02 12:47:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:47:52,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 12:47:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:52,527 INFO L225 Difference]: With dead ends: 6237 [2018-12-02 12:47:52,527 INFO L226 Difference]: Without dead ends: 6237 [2018-12-02 12:47:52,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6237 states. [2018-12-02 12:47:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6237 to 5468. [2018-12-02 12:47:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5468 states. [2018-12-02 12:47:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 12154 transitions. [2018-12-02 12:47:52,567 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 12154 transitions. Word has length 94 [2018-12-02 12:47:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:52,567 INFO L480 AbstractCegarLoop]: Abstraction has 5468 states and 12154 transitions. [2018-12-02 12:47:52,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:47:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 12154 transitions. [2018-12-02 12:47:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:52,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:52,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:52,571 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:52,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1606085759, now seen corresponding path program 1 times [2018-12-02 12:47:52,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:52,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:52,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:52,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:47:52,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:47:52,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:47:52,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:47:52,621 INFO L87 Difference]: Start difference. First operand 5468 states and 12154 transitions. Second operand 5 states. [2018-12-02 12:47:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:52,685 INFO L93 Difference]: Finished difference Result 6369 states and 14143 transitions. [2018-12-02 12:47:52,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:47:52,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 12:47:52,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:52,689 INFO L225 Difference]: With dead ends: 6369 [2018-12-02 12:47:52,689 INFO L226 Difference]: Without dead ends: 6369 [2018-12-02 12:47:52,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2018-12-02 12:47:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 5007. [2018-12-02 12:47:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5007 states. [2018-12-02 12:47:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5007 states to 5007 states and 11124 transitions. [2018-12-02 12:47:52,725 INFO L78 Accepts]: Start accepts. Automaton has 5007 states and 11124 transitions. Word has length 96 [2018-12-02 12:47:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:52,725 INFO L480 AbstractCegarLoop]: Abstraction has 5007 states and 11124 transitions. [2018-12-02 12:47:52,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:47:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 5007 states and 11124 transitions. [2018-12-02 12:47:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:52,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:52,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:52,728 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:52,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:52,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1056077538, now seen corresponding path program 1 times [2018-12-02 12:47:52,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:52,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:52,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:52,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:52,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-02 12:47:52,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:52,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:47:52,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:47:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:47:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:52,805 INFO L87 Difference]: Start difference. First operand 5007 states and 11124 transitions. Second operand 7 states. [2018-12-02 12:47:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:52,976 INFO L93 Difference]: Finished difference Result 6705 states and 14747 transitions. [2018-12-02 12:47:52,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:47:52,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 12:47:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:52,981 INFO L225 Difference]: With dead ends: 6705 [2018-12-02 12:47:52,981 INFO L226 Difference]: Without dead ends: 6651 [2018-12-02 12:47:52,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:47:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6651 states. [2018-12-02 12:47:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6651 to 5484. [2018-12-02 12:47:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2018-12-02 12:47:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 12114 transitions. [2018-12-02 12:47:53,020 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 12114 transitions. Word has length 96 [2018-12-02 12:47:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:53,020 INFO L480 AbstractCegarLoop]: Abstraction has 5484 states and 12114 transitions. [2018-12-02 12:47:53,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:47:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 12114 transitions. [2018-12-02 12:47:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:53,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:53,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:53,024 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:53,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1570666369, now seen corresponding path program 1 times [2018-12-02 12:47:53,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:53,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:53,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:53,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:53,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:53,065 INFO L87 Difference]: Start difference. First operand 5484 states and 12114 transitions. Second operand 6 states. [2018-12-02 12:47:53,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:53,230 INFO L93 Difference]: Finished difference Result 6419 states and 14264 transitions. [2018-12-02 12:47:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:47:53,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 12:47:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:53,234 INFO L225 Difference]: With dead ends: 6419 [2018-12-02 12:47:53,234 INFO L226 Difference]: Without dead ends: 6419 [2018-12-02 12:47:53,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:47:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2018-12-02 12:47:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 5689. [2018-12-02 12:47:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2018-12-02 12:47:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 12563 transitions. [2018-12-02 12:47:53,271 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 12563 transitions. Word has length 96 [2018-12-02 12:47:53,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:53,271 INFO L480 AbstractCegarLoop]: Abstraction has 5689 states and 12563 transitions. [2018-12-02 12:47:53,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 12563 transitions. [2018-12-02 12:47:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:53,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:53,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:53,275 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:53,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash -626916003, now seen corresponding path program 1 times [2018-12-02 12:47:53,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:53,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:53,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:53,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:53,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:53,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:53,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:53,338 INFO L87 Difference]: Start difference. First operand 5689 states and 12563 transitions. Second operand 6 states. [2018-12-02 12:47:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:53,644 INFO L93 Difference]: Finished difference Result 7566 states and 16613 transitions. [2018-12-02 12:47:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:47:53,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 12:47:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:53,649 INFO L225 Difference]: With dead ends: 7566 [2018-12-02 12:47:53,649 INFO L226 Difference]: Without dead ends: 7550 [2018-12-02 12:47:53,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:47:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7550 states. [2018-12-02 12:47:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7550 to 6108. [2018-12-02 12:47:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2018-12-02 12:47:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 13598 transitions. [2018-12-02 12:47:53,694 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 13598 transitions. Word has length 96 [2018-12-02 12:47:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:53,694 INFO L480 AbstractCegarLoop]: Abstraction has 6108 states and 13598 transitions. [2018-12-02 12:47:53,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 13598 transitions. [2018-12-02 12:47:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:53,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:53,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:53,698 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:53,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash -415565090, now seen corresponding path program 1 times [2018-12-02 12:47:53,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:53,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:53,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:53,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:47:53,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:47:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:47:53,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:47:53,749 INFO L87 Difference]: Start difference. First operand 6108 states and 13598 transitions. Second operand 6 states. [2018-12-02 12:47:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:53,851 INFO L93 Difference]: Finished difference Result 6442 states and 14107 transitions. [2018-12-02 12:47:53,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:47:53,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 12:47:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:53,855 INFO L225 Difference]: With dead ends: 6442 [2018-12-02 12:47:53,855 INFO L226 Difference]: Without dead ends: 6420 [2018-12-02 12:47:53,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2018-12-02 12:47:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5492. [2018-12-02 12:47:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5492 states. [2018-12-02 12:47:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 12130 transitions. [2018-12-02 12:47:53,894 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 12130 transitions. Word has length 96 [2018-12-02 12:47:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:53,894 INFO L480 AbstractCegarLoop]: Abstraction has 5492 states and 12130 transitions. [2018-12-02 12:47:53,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:47:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 12130 transitions. [2018-12-02 12:47:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:53,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:53,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:53,898 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:53,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1921296066, now seen corresponding path program 1 times [2018-12-02 12:47:53,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:53,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:54,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:54,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 12:47:54,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 12:47:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 12:47:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:47:54,022 INFO L87 Difference]: Start difference. First operand 5492 states and 12130 transitions. Second operand 9 states. [2018-12-02 12:47:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:54,300 INFO L93 Difference]: Finished difference Result 6541 states and 14255 transitions. [2018-12-02 12:47:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 12:47:54,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 12:47:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:54,304 INFO L225 Difference]: With dead ends: 6541 [2018-12-02 12:47:54,304 INFO L226 Difference]: Without dead ends: 6541 [2018-12-02 12:47:54,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:47:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6541 states. [2018-12-02 12:47:54,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6541 to 5796. [2018-12-02 12:47:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5796 states. [2018-12-02 12:47:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5796 states to 5796 states and 12754 transitions. [2018-12-02 12:47:54,344 INFO L78 Accepts]: Start accepts. Automaton has 5796 states and 12754 transitions. Word has length 96 [2018-12-02 12:47:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:54,344 INFO L480 AbstractCegarLoop]: Abstraction has 5796 states and 12754 transitions. [2018-12-02 12:47:54,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 12:47:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5796 states and 12754 transitions. [2018-12-02 12:47:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:54,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:54,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:54,348 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:54,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash -753822401, now seen corresponding path program 1 times [2018-12-02 12:47:54,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:54,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:54,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:54,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:47:54,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:47:54,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:47:54,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:54,401 INFO L87 Difference]: Start difference. First operand 5796 states and 12754 transitions. Second operand 7 states. [2018-12-02 12:47:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:54,597 INFO L93 Difference]: Finished difference Result 7269 states and 15919 transitions. [2018-12-02 12:47:54,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 12:47:54,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 12:47:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:54,601 INFO L225 Difference]: With dead ends: 7269 [2018-12-02 12:47:54,601 INFO L226 Difference]: Without dead ends: 7269 [2018-12-02 12:47:54,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:47:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2018-12-02 12:47:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 6739. [2018-12-02 12:47:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6739 states. [2018-12-02 12:47:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 14734 transitions. [2018-12-02 12:47:54,662 INFO L78 Accepts]: Start accepts. Automaton has 6739 states and 14734 transitions. Word has length 96 [2018-12-02 12:47:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:54,662 INFO L480 AbstractCegarLoop]: Abstraction has 6739 states and 14734 transitions. [2018-12-02 12:47:54,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:47:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6739 states and 14734 transitions. [2018-12-02 12:47:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:54,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:54,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:54,665 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:54,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:54,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1233659359, now seen corresponding path program 1 times [2018-12-02 12:47:54,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:54,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:54,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:54,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:54,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:54,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:54,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:47:54,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:47:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:47:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:47:54,719 INFO L87 Difference]: Start difference. First operand 6739 states and 14734 transitions. Second operand 7 states. [2018-12-02 12:47:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:54,804 INFO L93 Difference]: Finished difference Result 8497 states and 18677 transitions. [2018-12-02 12:47:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:47:54,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 12:47:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:54,809 INFO L225 Difference]: With dead ends: 8497 [2018-12-02 12:47:54,809 INFO L226 Difference]: Without dead ends: 8497 [2018-12-02 12:47:54,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:47:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8497 states. [2018-12-02 12:47:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8497 to 6071. [2018-12-02 12:47:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6071 states. [2018-12-02 12:47:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 13202 transitions. [2018-12-02 12:47:54,855 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 13202 transitions. Word has length 96 [2018-12-02 12:47:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:54,855 INFO L480 AbstractCegarLoop]: Abstraction has 6071 states and 13202 transitions. [2018-12-02 12:47:54,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:47:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 13202 transitions. [2018-12-02 12:47:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:54,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:54,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:54,859 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:54,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1926761056, now seen corresponding path program 1 times [2018-12-02 12:47:54,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:54,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:47:54,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 12:47:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 12:47:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:47:54,958 INFO L87 Difference]: Start difference. First operand 6071 states and 13202 transitions. Second operand 11 states. [2018-12-02 12:47:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:55,303 INFO L93 Difference]: Finished difference Result 7681 states and 16682 transitions. [2018-12-02 12:47:55,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:47:55,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 12:47:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:55,307 INFO L225 Difference]: With dead ends: 7681 [2018-12-02 12:47:55,307 INFO L226 Difference]: Without dead ends: 7681 [2018-12-02 12:47:55,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-12-02 12:47:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7681 states. [2018-12-02 12:47:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7681 to 6402. [2018-12-02 12:47:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6402 states. [2018-12-02 12:47:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6402 states to 6402 states and 13959 transitions. [2018-12-02 12:47:55,353 INFO L78 Accepts]: Start accepts. Automaton has 6402 states and 13959 transitions. Word has length 96 [2018-12-02 12:47:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:55,353 INFO L480 AbstractCegarLoop]: Abstraction has 6402 states and 13959 transitions. [2018-12-02 12:47:55,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 12:47:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 6402 states and 13959 transitions. [2018-12-02 12:47:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:55,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:55,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:55,358 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:55,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1480702559, now seen corresponding path program 1 times [2018-12-02 12:47:55,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:55,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:55,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:55,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:55,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:47:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:47:55,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:47:55,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 12:47:55,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 12:47:55,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 12:47:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:47:55,469 INFO L87 Difference]: Start difference. First operand 6402 states and 13959 transitions. Second operand 11 states. [2018-12-02 12:47:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:47:56,288 INFO L93 Difference]: Finished difference Result 12306 states and 27186 transitions. [2018-12-02 12:47:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 12:47:56,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 12:47:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:47:56,293 INFO L225 Difference]: With dead ends: 12306 [2018-12-02 12:47:56,293 INFO L226 Difference]: Without dead ends: 7693 [2018-12-02 12:47:56,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 12:47:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states. [2018-12-02 12:47:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 5578. [2018-12-02 12:47:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5578 states. [2018-12-02 12:47:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 12198 transitions. [2018-12-02 12:47:56,334 INFO L78 Accepts]: Start accepts. Automaton has 5578 states and 12198 transitions. Word has length 96 [2018-12-02 12:47:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:47:56,334 INFO L480 AbstractCegarLoop]: Abstraction has 5578 states and 12198 transitions. [2018-12-02 12:47:56,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 12:47:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5578 states and 12198 transitions. [2018-12-02 12:47:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 12:47:56,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:47:56,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:47:56,337 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:47:56,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:47:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1556391435, now seen corresponding path program 2 times [2018-12-02 12:47:56,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:47:56,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:47:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:56,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:47:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:47:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:47:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:47:56,373 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:47:56,442 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:47:56,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:47:56 BasicIcfg [2018-12-02 12:47:56,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:47:56,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:47:56,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:47:56,443 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:47:56,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:47:31" (3/4) ... [2018-12-02 12:47:56,445 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:47:56,518 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_24657586-b6bc-41b3-ad53-494155ee388c/bin-2019/uautomizer/witness.graphml [2018-12-02 12:47:56,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:47:56,519 INFO L168 Benchmark]: Toolchain (without parser) took 25768.47 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 954.5 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-02 12:47:56,520 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:47:56,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 954.5 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:56,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:56,520 INFO L168 Benchmark]: Boogie Preprocessor took 25.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:47:56,520 INFO L168 Benchmark]: RCFGBuilder took 340.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2018-12-02 12:47:56,520 INFO L168 Benchmark]: TraceAbstraction took 24946.35 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-02 12:47:56,521 INFO L168 Benchmark]: Witness Printer took 75.08 ms. Allocated memory is still 4.3 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:47:56,521 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 954.5 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 340.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24946.35 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 75.08 ms. Allocated memory is still 4.3 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t309; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t310; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 24.8s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9355 SDtfs, 10909 SDslu, 22229 SDs, 0 SdLazy, 10108 SolverSat, 525 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 86 SyntacticMatches, 32 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, 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: 10.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 188571 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2557 NumberOfCodeBlocks, 2557 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2427 ConstructedInterpolants, 0 QuantifiedInterpolants, 583885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...