./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_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_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 494bc2fc09075c95dc50510368677477add42eee ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:56:56,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:56:56,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:56:56,129 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:56:56,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:56:56,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:56:56,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:56:56,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:56:56,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:56:56,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:56:56,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:56:56,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:56:56,134 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:56:56,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:56:56,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:56:56,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:56:56,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:56:56,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:56:56,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:56:56,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:56:56,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:56:56,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:56:56,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:56:56,140 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:56:56,140 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:56:56,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:56:56,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:56:56,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:56:56,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:56:56,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:56:56,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:56:56,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:56:56,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:56:56,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:56:56,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:56:56,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:56:56,144 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 04:56:56,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:56:56,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:56:56,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:56:56,152 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:56:56,152 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:56:56,153 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:56:56,153 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:56:56,153 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:56:56,153 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:56:56,153 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:56:56,153 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:56:56,153 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:56:56,153 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:56:56,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:56:56,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:56:56,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:56:56,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:56:56,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:56:56,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 04:56:56,156 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan 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 -> Taipan 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 -> 494bc2fc09075c95dc50510368677477add42eee [2018-12-09 04:56:56,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:56:56,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:56:56,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:56:56,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:56:56,183 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:56:56,183 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_false-unreach-call.i [2018-12-09 04:56:56,217 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/data/73ff0e142/06e03e6fcd874e4094893e32cfa1acef/FLAG13fd36b4c [2018-12-09 04:56:56,686 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:56:56,686 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/sv-benchmarks/c/pthread-wmm/rfi007_power.oepc_false-unreach-call.i [2018-12-09 04:56:56,693 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/data/73ff0e142/06e03e6fcd874e4094893e32cfa1acef/FLAG13fd36b4c [2018-12-09 04:56:57,201 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/data/73ff0e142/06e03e6fcd874e4094893e32cfa1acef [2018-12-09 04:56:57,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:56:57,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:56:57,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:56:57,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:56:57,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:56:57,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014c445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57, skipping insertion in model container [2018-12-09 04:56:57,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:56:57,235 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:56:57,410 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:56:57,418 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:56:57,492 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:56:57,521 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:56:57,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57 WrapperNode [2018-12-09 04:56:57,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:56:57,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:56:57,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:56:57,522 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:56:57,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:56:57,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:56:57,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:56:57,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:56:57,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... [2018-12-09 04:56:57,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:56:57,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:56:57,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:56:57,573 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:56:57,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:56:57,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:56:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:56:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 04:56:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:56:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 04:56:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 04:56:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 04:56:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 04:56:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 04:56:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:56:57,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:56:57,610 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 04:56:57,914 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:56:57,914 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 04:56:57,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:57 BoogieIcfgContainer [2018-12-09 04:56:57,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:56:57,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:56:57,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:56:57,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:56:57,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:56:57" (1/3) ... [2018-12-09 04:56:57,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe4c716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:56:57, skipping insertion in model container [2018-12-09 04:56:57,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:57" (2/3) ... [2018-12-09 04:56:57,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe4c716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:56:57, skipping insertion in model container [2018-12-09 04:56:57,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:57" (3/3) ... [2018-12-09 04:56:57,919 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_false-unreach-call.i [2018-12-09 04:56:57,943 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,943 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,943 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,943 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,943 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,943 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:57,961 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 04:56:57,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:56:57,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 04:56:57,977 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 04:56:57,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:56:57,992 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:56:57,993 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:56:57,993 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:56:57,993 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:56:57,993 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:56:57,993 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:56:57,993 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:56:58,000 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 142places, 180 transitions [2018-12-09 04:56:59,473 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34806 states. [2018-12-09 04:56:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34806 states. [2018-12-09 04:56:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 04:56:59,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:56:59,480 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] [2018-12-09 04:56:59,481 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:56:59,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:56:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash 829463542, now seen corresponding path program 1 times [2018-12-09 04:56:59,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:56:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:56:59,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:56:59,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:56:59,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:56:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:56:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:56:59,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:56:59,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:56:59,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:56:59,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:56:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:56:59,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:56:59,643 INFO L87 Difference]: Start difference. First operand 34806 states. Second operand 4 states. [2018-12-09 04:57:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:00,185 INFO L93 Difference]: Finished difference Result 60790 states and 234493 transitions. [2018-12-09 04:57:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:57:00,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-12-09 04:57:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:00,331 INFO L225 Difference]: With dead ends: 60790 [2018-12-09 04:57:00,331 INFO L226 Difference]: Without dead ends: 44270 [2018-12-09 04:57:00,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44270 states. [2018-12-09 04:57:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44270 to 27338. [2018-12-09 04:57:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27338 states. [2018-12-09 04:57:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27338 states to 27338 states and 105499 transitions. [2018-12-09 04:57:01,184 INFO L78 Accepts]: Start accepts. Automaton has 27338 states and 105499 transitions. Word has length 33 [2018-12-09 04:57:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:01,184 INFO L480 AbstractCegarLoop]: Abstraction has 27338 states and 105499 transitions. [2018-12-09 04:57:01,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 27338 states and 105499 transitions. [2018-12-09 04:57:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 04:57:01,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:01,191 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] [2018-12-09 04:57:01,191 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:01,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1614500037, now seen corresponding path program 1 times [2018-12-09 04:57:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:01,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:01,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:01,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:01,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:01,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:01,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:01,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:01,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:01,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:01,270 INFO L87 Difference]: Start difference. First operand 27338 states and 105499 transitions. Second operand 4 states. [2018-12-09 04:57:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:01,338 INFO L93 Difference]: Finished difference Result 8528 states and 28344 transitions. [2018-12-09 04:57:01,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:57:01,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 04:57:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:01,358 INFO L225 Difference]: With dead ends: 8528 [2018-12-09 04:57:01,358 INFO L226 Difference]: Without dead ends: 7466 [2018-12-09 04:57:01,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-09 04:57:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7466. [2018-12-09 04:57:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-12-09 04:57:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 24636 transitions. [2018-12-09 04:57:01,448 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 24636 transitions. Word has length 45 [2018-12-09 04:57:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:01,448 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 24636 transitions. [2018-12-09 04:57:01,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 24636 transitions. [2018-12-09 04:57:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 04:57:01,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:01,449 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-09 04:57:01,449 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:01,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2087909407, now seen corresponding path program 1 times [2018-12-09 04:57:01,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:01,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:01,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:01,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:01,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:01,521 INFO L87 Difference]: Start difference. First operand 7466 states and 24636 transitions. Second operand 5 states. [2018-12-09 04:57:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:01,742 INFO L93 Difference]: Finished difference Result 13998 states and 45805 transitions. [2018-12-09 04:57:01,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:57:01,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 04:57:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:01,789 INFO L225 Difference]: With dead ends: 13998 [2018-12-09 04:57:01,789 INFO L226 Difference]: Without dead ends: 13930 [2018-12-09 04:57:01,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:57:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-09 04:57:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9441. [2018-12-09 04:57:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2018-12-09 04:57:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 30542 transitions. [2018-12-09 04:57:02,037 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 30542 transitions. Word has length 46 [2018-12-09 04:57:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:02,038 INFO L480 AbstractCegarLoop]: Abstraction has 9441 states and 30542 transitions. [2018-12-09 04:57:02,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 30542 transitions. [2018-12-09 04:57:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 04:57:02,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:02,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:02,039 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:02,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1703396709, now seen corresponding path program 1 times [2018-12-09 04:57:02,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:02,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:02,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:57:02,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:02,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:57:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:57:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:02,083 INFO L87 Difference]: Start difference. First operand 9441 states and 30542 transitions. Second operand 3 states. [2018-12-09 04:57:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:02,147 INFO L93 Difference]: Finished difference Result 13279 states and 42641 transitions. [2018-12-09 04:57:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:57:02,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 04:57:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:02,172 INFO L225 Difference]: With dead ends: 13279 [2018-12-09 04:57:02,172 INFO L226 Difference]: Without dead ends: 13279 [2018-12-09 04:57:02,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2018-12-09 04:57:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 9845. [2018-12-09 04:57:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9845 states. [2018-12-09 04:57:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9845 states to 9845 states and 31508 transitions. [2018-12-09 04:57:02,330 INFO L78 Accepts]: Start accepts. Automaton has 9845 states and 31508 transitions. Word has length 48 [2018-12-09 04:57:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:02,331 INFO L480 AbstractCegarLoop]: Abstraction has 9845 states and 31508 transitions. [2018-12-09 04:57:02,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:57:02,331 INFO L276 IsEmpty]: Start isEmpty. Operand 9845 states and 31508 transitions. [2018-12-09 04:57:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:57:02,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:02,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:02,333 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:02,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash -778746896, now seen corresponding path program 1 times [2018-12-09 04:57:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:02,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:02,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:02,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:57:02,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:02,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:57:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:57:02,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:57:02,406 INFO L87 Difference]: Start difference. First operand 9845 states and 31508 transitions. Second operand 7 states. [2018-12-09 04:57:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:02,810 INFO L93 Difference]: Finished difference Result 12285 states and 38673 transitions. [2018-12-09 04:57:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:57:02,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-09 04:57:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:02,825 INFO L225 Difference]: With dead ends: 12285 [2018-12-09 04:57:02,825 INFO L226 Difference]: Without dead ends: 12213 [2018-12-09 04:57:02,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:57:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-09 04:57:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 10849. [2018-12-09 04:57:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2018-12-09 04:57:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 34563 transitions. [2018-12-09 04:57:02,951 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 34563 transitions. Word has length 52 [2018-12-09 04:57:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:02,951 INFO L480 AbstractCegarLoop]: Abstraction has 10849 states and 34563 transitions. [2018-12-09 04:57:02,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:57:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 34563 transitions. [2018-12-09 04:57:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:57:02,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:02,954 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] [2018-12-09 04:57:02,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:02,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1619956916, now seen corresponding path program 1 times [2018-12-09 04:57:02,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:02,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:02,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:02,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:02,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:02,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:02,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:02,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:02,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:02,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:02,988 INFO L87 Difference]: Start difference. First operand 10849 states and 34563 transitions. Second operand 4 states. [2018-12-09 04:57:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:03,078 INFO L93 Difference]: Finished difference Result 12396 states and 39572 transitions. [2018-12-09 04:57:03,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:57:03,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 04:57:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:03,095 INFO L225 Difference]: With dead ends: 12396 [2018-12-09 04:57:03,095 INFO L226 Difference]: Without dead ends: 12396 [2018-12-09 04:57:03,095 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-09 04:57:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2018-12-09 04:57:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11369. [2018-12-09 04:57:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11369 states. [2018-12-09 04:57:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 36236 transitions. [2018-12-09 04:57:03,273 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 36236 transitions. Word has length 60 [2018-12-09 04:57:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:03,273 INFO L480 AbstractCegarLoop]: Abstraction has 11369 states and 36236 transitions. [2018-12-09 04:57:03,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 36236 transitions. [2018-12-09 04:57:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:57:03,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:03,276 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] [2018-12-09 04:57:03,277 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:03,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash 122853419, now seen corresponding path program 1 times [2018-12-09 04:57:03,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:03,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:03,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:03,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:57:03,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:03,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:57:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:57:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:57:03,337 INFO L87 Difference]: Start difference. First operand 11369 states and 36236 transitions. Second operand 6 states. [2018-12-09 04:57:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:03,632 INFO L93 Difference]: Finished difference Result 20969 states and 66486 transitions. [2018-12-09 04:57:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:57:03,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-09 04:57:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:03,657 INFO L225 Difference]: With dead ends: 20969 [2018-12-09 04:57:03,657 INFO L226 Difference]: Without dead ends: 20898 [2018-12-09 04:57:03,657 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-09 04:57:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20898 states. [2018-12-09 04:57:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20898 to 13755. [2018-12-09 04:57:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13755 states. [2018-12-09 04:57:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 43280 transitions. [2018-12-09 04:57:03,847 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 43280 transitions. Word has length 60 [2018-12-09 04:57:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:03,847 INFO L480 AbstractCegarLoop]: Abstraction has 13755 states and 43280 transitions. [2018-12-09 04:57:03,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:57:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 43280 transitions. [2018-12-09 04:57:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 04:57:03,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:03,851 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] [2018-12-09 04:57:03,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:03,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1407589042, now seen corresponding path program 1 times [2018-12-09 04:57:03,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:03,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:03,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:03,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:03,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:03,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:03,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:03,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:03,900 INFO L87 Difference]: Start difference. First operand 13755 states and 43280 transitions. Second operand 4 states. [2018-12-09 04:57:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:04,139 INFO L93 Difference]: Finished difference Result 23352 states and 74493 transitions. [2018-12-09 04:57:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:57:04,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 04:57:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:04,168 INFO L225 Difference]: With dead ends: 23352 [2018-12-09 04:57:04,168 INFO L226 Difference]: Without dead ends: 23352 [2018-12-09 04:57:04,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23352 states. [2018-12-09 04:57:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23352 to 14523. [2018-12-09 04:57:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14523 states. [2018-12-09 04:57:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14523 states to 14523 states and 45664 transitions. [2018-12-09 04:57:04,371 INFO L78 Accepts]: Start accepts. Automaton has 14523 states and 45664 transitions. Word has length 64 [2018-12-09 04:57:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:04,371 INFO L480 AbstractCegarLoop]: Abstraction has 14523 states and 45664 transitions. [2018-12-09 04:57:04,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 14523 states and 45664 transitions. [2018-12-09 04:57:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 04:57:04,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:04,375 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] [2018-12-09 04:57:04,375 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:04,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1114186035, now seen corresponding path program 1 times [2018-12-09 04:57:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:04,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:04,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:04,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:04,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:04,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:04,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:04,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:04,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:04,427 INFO L87 Difference]: Start difference. First operand 14523 states and 45664 transitions. Second operand 4 states. [2018-12-09 04:57:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:04,619 INFO L93 Difference]: Finished difference Result 18411 states and 56991 transitions. [2018-12-09 04:57:04,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:57:04,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 04:57:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:04,640 INFO L225 Difference]: With dead ends: 18411 [2018-12-09 04:57:04,640 INFO L226 Difference]: Without dead ends: 18411 [2018-12-09 04:57:04,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18411 states. [2018-12-09 04:57:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18411 to 16569. [2018-12-09 04:57:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16569 states. [2018-12-09 04:57:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 51537 transitions. [2018-12-09 04:57:04,934 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 51537 transitions. Word has length 64 [2018-12-09 04:57:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:04,934 INFO L480 AbstractCegarLoop]: Abstraction has 16569 states and 51537 transitions. [2018-12-09 04:57:04,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 51537 transitions. [2018-12-09 04:57:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 04:57:04,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:04,939 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] [2018-12-09 04:57:04,939 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:04,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash -73219442, now seen corresponding path program 1 times [2018-12-09 04:57:04,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:04,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:04,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:04,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:04,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:04,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:04,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:57:04,969 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:04,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:57:04,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:57:04,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:04,970 INFO L87 Difference]: Start difference. First operand 16569 states and 51537 transitions. Second operand 3 states. [2018-12-09 04:57:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:05,121 INFO L93 Difference]: Finished difference Result 17193 states and 53232 transitions. [2018-12-09 04:57:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:57:05,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-09 04:57:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:05,141 INFO L225 Difference]: With dead ends: 17193 [2018-12-09 04:57:05,141 INFO L226 Difference]: Without dead ends: 17193 [2018-12-09 04:57:05,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2018-12-09 04:57:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16901. [2018-12-09 04:57:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16901 states. [2018-12-09 04:57:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 52431 transitions. [2018-12-09 04:57:05,320 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 52431 transitions. Word has length 64 [2018-12-09 04:57:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:05,320 INFO L480 AbstractCegarLoop]: Abstraction has 16901 states and 52431 transitions. [2018-12-09 04:57:05,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:57:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 52431 transitions. [2018-12-09 04:57:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:57:05,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:05,326 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] [2018-12-09 04:57:05,327 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:05,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash -776511433, now seen corresponding path program 1 times [2018-12-09 04:57:05,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:05,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:05,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:05,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:05,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:05,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:57:05,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:05,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:57:05,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:57:05,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:57:05,393 INFO L87 Difference]: Start difference. First operand 16901 states and 52431 transitions. Second operand 6 states. [2018-12-09 04:57:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:06,036 INFO L93 Difference]: Finished difference Result 20789 states and 63395 transitions. [2018-12-09 04:57:06,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:57:06,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 04:57:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:06,058 INFO L225 Difference]: With dead ends: 20789 [2018-12-09 04:57:06,059 INFO L226 Difference]: Without dead ends: 20789 [2018-12-09 04:57:06,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:57:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2018-12-09 04:57:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 19521. [2018-12-09 04:57:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19521 states. [2018-12-09 04:57:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19521 states to 19521 states and 60007 transitions. [2018-12-09 04:57:06,273 INFO L78 Accepts]: Start accepts. Automaton has 19521 states and 60007 transitions. Word has length 66 [2018-12-09 04:57:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:06,273 INFO L480 AbstractCegarLoop]: Abstraction has 19521 states and 60007 transitions. [2018-12-09 04:57:06,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:57:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 19521 states and 60007 transitions. [2018-12-09 04:57:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:57:06,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:06,281 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] [2018-12-09 04:57:06,281 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:06,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash 185102584, now seen corresponding path program 1 times [2018-12-09 04:57:06,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:06,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:06,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:06,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:06,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:06,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:57:06,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:06,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:57:06,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:57:06,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:57:06,344 INFO L87 Difference]: Start difference. First operand 19521 states and 60007 transitions. Second operand 6 states. [2018-12-09 04:57:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:06,612 INFO L93 Difference]: Finished difference Result 22441 states and 66578 transitions. [2018-12-09 04:57:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:57:06,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 04:57:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:06,641 INFO L225 Difference]: With dead ends: 22441 [2018-12-09 04:57:06,641 INFO L226 Difference]: Without dead ends: 22441 [2018-12-09 04:57:06,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:57:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22441 states. [2018-12-09 04:57:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22441 to 20085. [2018-12-09 04:57:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20085 states. [2018-12-09 04:57:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 60622 transitions. [2018-12-09 04:57:06,891 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 60622 transitions. Word has length 66 [2018-12-09 04:57:06,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:06,891 INFO L480 AbstractCegarLoop]: Abstraction has 20085 states and 60622 transitions. [2018-12-09 04:57:06,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:57:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 60622 transitions. [2018-12-09 04:57:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:57:06,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:06,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] [2018-12-09 04:57:06,899 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:06,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1429867065, now seen corresponding path program 1 times [2018-12-09 04:57:06,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:06,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:06,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:06,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:06,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:06,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:06,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:06,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:06,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:06,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:06,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:06,956 INFO L87 Difference]: Start difference. First operand 20085 states and 60622 transitions. Second operand 5 states. [2018-12-09 04:57:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:07,190 INFO L93 Difference]: Finished difference Result 26432 states and 79262 transitions. [2018-12-09 04:57:07,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:57:07,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 04:57:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:07,222 INFO L225 Difference]: With dead ends: 26432 [2018-12-09 04:57:07,222 INFO L226 Difference]: Without dead ends: 26432 [2018-12-09 04:57:07,222 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-09 04:57:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26432 states. [2018-12-09 04:57:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26432 to 23813. [2018-12-09 04:57:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23813 states. [2018-12-09 04:57:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23813 states to 23813 states and 71372 transitions. [2018-12-09 04:57:07,488 INFO L78 Accepts]: Start accepts. Automaton has 23813 states and 71372 transitions. Word has length 66 [2018-12-09 04:57:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:07,488 INFO L480 AbstractCegarLoop]: Abstraction has 23813 states and 71372 transitions. [2018-12-09 04:57:07,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 23813 states and 71372 transitions. [2018-12-09 04:57:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:57:07,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:07,497 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] [2018-12-09 04:57:07,497 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:07,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:07,498 INFO L82 PathProgramCache]: Analyzing trace with hash 919332888, now seen corresponding path program 1 times [2018-12-09 04:57:07,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:07,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:07,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:07,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:07,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:07,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:07,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:07,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:07,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:07,554 INFO L87 Difference]: Start difference. First operand 23813 states and 71372 transitions. Second operand 5 states. [2018-12-09 04:57:07,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:07,853 INFO L93 Difference]: Finished difference Result 33063 states and 98211 transitions. [2018-12-09 04:57:07,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:57:07,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 04:57:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:07,891 INFO L225 Difference]: With dead ends: 33063 [2018-12-09 04:57:07,891 INFO L226 Difference]: Without dead ends: 33063 [2018-12-09 04:57:07,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:57:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33063 states. [2018-12-09 04:57:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33063 to 29343. [2018-12-09 04:57:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29343 states. [2018-12-09 04:57:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29343 states to 29343 states and 87599 transitions. [2018-12-09 04:57:08,239 INFO L78 Accepts]: Start accepts. Automaton has 29343 states and 87599 transitions. Word has length 66 [2018-12-09 04:57:08,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:08,239 INFO L480 AbstractCegarLoop]: Abstraction has 29343 states and 87599 transitions. [2018-12-09 04:57:08,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29343 states and 87599 transitions. [2018-12-09 04:57:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:57:08,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:08,248 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] [2018-12-09 04:57:08,249 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:08,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:08,249 INFO L82 PathProgramCache]: Analyzing trace with hash -888121575, now seen corresponding path program 1 times [2018-12-09 04:57:08,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:08,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:08,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:08,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:08,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:08,279 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:08,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:08,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:08,279 INFO L87 Difference]: Start difference. First operand 29343 states and 87599 transitions. Second operand 5 states. [2018-12-09 04:57:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:08,318 INFO L93 Difference]: Finished difference Result 9075 states and 21914 transitions. [2018-12-09 04:57:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:57:08,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 04:57:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:08,323 INFO L225 Difference]: With dead ends: 9075 [2018-12-09 04:57:08,323 INFO L226 Difference]: Without dead ends: 7223 [2018-12-09 04:57:08,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:57:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7223 states. [2018-12-09 04:57:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7223 to 6120. [2018-12-09 04:57:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2018-12-09 04:57:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 14385 transitions. [2018-12-09 04:57:08,374 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 14385 transitions. Word has length 66 [2018-12-09 04:57:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:08,374 INFO L480 AbstractCegarLoop]: Abstraction has 6120 states and 14385 transitions. [2018-12-09 04:57:08,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 14385 transitions. [2018-12-09 04:57:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 04:57:08,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:08,379 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] [2018-12-09 04:57:08,379 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:08,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1563910716, now seen corresponding path program 1 times [2018-12-09 04:57:08,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:57:08,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:08,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:57:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:57:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:08,397 INFO L87 Difference]: Start difference. First operand 6120 states and 14385 transitions. Second operand 3 states. [2018-12-09 04:57:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:08,429 INFO L93 Difference]: Finished difference Result 8339 states and 19492 transitions. [2018-12-09 04:57:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:57:08,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 04:57:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:08,436 INFO L225 Difference]: With dead ends: 8339 [2018-12-09 04:57:08,436 INFO L226 Difference]: Without dead ends: 8339 [2018-12-09 04:57:08,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8339 states. [2018-12-09 04:57:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8339 to 6059. [2018-12-09 04:57:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6059 states. [2018-12-09 04:57:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 13925 transitions. [2018-12-09 04:57:08,495 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 13925 transitions. Word has length 66 [2018-12-09 04:57:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:08,495 INFO L480 AbstractCegarLoop]: Abstraction has 6059 states and 13925 transitions. [2018-12-09 04:57:08,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:57:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 13925 transitions. [2018-12-09 04:57:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 04:57:08,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:08,500 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] [2018-12-09 04:57:08,500 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:08,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1344844335, now seen corresponding path program 1 times [2018-12-09 04:57:08,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:08,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:08,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:08,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:08,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:08,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:08,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:08,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:08,541 INFO L87 Difference]: Start difference. First operand 6059 states and 13925 transitions. Second operand 5 states. [2018-12-09 04:57:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:08,630 INFO L93 Difference]: Finished difference Result 7229 states and 16566 transitions. [2018-12-09 04:57:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:57:08,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-09 04:57:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:08,635 INFO L225 Difference]: With dead ends: 7229 [2018-12-09 04:57:08,635 INFO L226 Difference]: Without dead ends: 7229 [2018-12-09 04:57:08,636 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-09 04:57:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2018-12-09 04:57:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 6503. [2018-12-09 04:57:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2018-12-09 04:57:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 14929 transitions. [2018-12-09 04:57:08,699 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 14929 transitions. Word has length 72 [2018-12-09 04:57:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:08,699 INFO L480 AbstractCegarLoop]: Abstraction has 6503 states and 14929 transitions. [2018-12-09 04:57:08,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 14929 transitions. [2018-12-09 04:57:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 04:57:08,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:08,704 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] [2018-12-09 04:57:08,705 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:08,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1207312626, now seen corresponding path program 1 times [2018-12-09 04:57:08,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:08,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:08,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:08,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:08,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:08,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:57:08,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:08,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:57:08,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:57:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:57:08,814 INFO L87 Difference]: Start difference. First operand 6503 states and 14929 transitions. Second operand 9 states. [2018-12-09 04:57:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:09,197 INFO L93 Difference]: Finished difference Result 8529 states and 19410 transitions. [2018-12-09 04:57:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 04:57:09,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-09 04:57:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:09,212 INFO L225 Difference]: With dead ends: 8529 [2018-12-09 04:57:09,212 INFO L226 Difference]: Without dead ends: 8410 [2018-12-09 04:57:09,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-12-09 04:57:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2018-12-09 04:57:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 6600. [2018-12-09 04:57:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6600 states. [2018-12-09 04:57:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 15022 transitions. [2018-12-09 04:57:09,277 INFO L78 Accepts]: Start accepts. Automaton has 6600 states and 15022 transitions. Word has length 72 [2018-12-09 04:57:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:09,277 INFO L480 AbstractCegarLoop]: Abstraction has 6600 states and 15022 transitions. [2018-12-09 04:57:09,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:57:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 15022 transitions. [2018-12-09 04:57:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 04:57:09,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:09,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:09,282 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:09,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:09,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1375926790, now seen corresponding path program 1 times [2018-12-09 04:57:09,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:09,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:09,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:09,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:09,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:09,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:09,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:09,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:09,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:09,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:09,322 INFO L87 Difference]: Start difference. First operand 6600 states and 15022 transitions. Second operand 4 states. [2018-12-09 04:57:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:09,476 INFO L93 Difference]: Finished difference Result 10287 states and 23293 transitions. [2018-12-09 04:57:09,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:57:09,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 04:57:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:09,483 INFO L225 Difference]: With dead ends: 10287 [2018-12-09 04:57:09,483 INFO L226 Difference]: Without dead ends: 10287 [2018-12-09 04:57:09,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2018-12-09 04:57:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 7720. [2018-12-09 04:57:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7720 states. [2018-12-09 04:57:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 17356 transitions. [2018-12-09 04:57:09,547 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 17356 transitions. Word has length 91 [2018-12-09 04:57:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:09,548 INFO L480 AbstractCegarLoop]: Abstraction has 7720 states and 17356 transitions. [2018-12-09 04:57:09,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 17356 transitions. [2018-12-09 04:57:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 04:57:09,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:09,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:09,553 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:09,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:09,553 INFO L82 PathProgramCache]: Analyzing trace with hash 533882140, now seen corresponding path program 1 times [2018-12-09 04:57:09,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:09,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:09,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:09,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:09,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:09,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:09,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:09,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:09,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:09,601 INFO L87 Difference]: Start difference. First operand 7720 states and 17356 transitions. Second operand 4 states. [2018-12-09 04:57:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:09,659 INFO L93 Difference]: Finished difference Result 8285 states and 18649 transitions. [2018-12-09 04:57:09,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:57:09,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 04:57:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:09,664 INFO L225 Difference]: With dead ends: 8285 [2018-12-09 04:57:09,665 INFO L226 Difference]: Without dead ends: 8285 [2018-12-09 04:57:09,665 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-09 04:57:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2018-12-09 04:57:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 7626. [2018-12-09 04:57:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2018-12-09 04:57:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 17251 transitions. [2018-12-09 04:57:09,720 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 17251 transitions. Word has length 91 [2018-12-09 04:57:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:09,720 INFO L480 AbstractCegarLoop]: Abstraction has 7626 states and 17251 transitions. [2018-12-09 04:57:09,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 17251 transitions. [2018-12-09 04:57:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:57:09,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:09,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:09,725 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:09,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:09,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1680047616, now seen corresponding path program 1 times [2018-12-09 04:57:09,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:09,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:09,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:09,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:09,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:09,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:57:09,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:09,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:57:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:57:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:57:09,789 INFO L87 Difference]: Start difference. First operand 7626 states and 17251 transitions. Second operand 7 states. [2018-12-09 04:57:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:10,188 INFO L93 Difference]: Finished difference Result 9400 states and 21199 transitions. [2018-12-09 04:57:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:57:10,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 04:57:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:10,194 INFO L225 Difference]: With dead ends: 9400 [2018-12-09 04:57:10,194 INFO L226 Difference]: Without dead ends: 9400 [2018-12-09 04:57:10,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:57:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9400 states. [2018-12-09 04:57:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9400 to 7738. [2018-12-09 04:57:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7738 states. [2018-12-09 04:57:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7738 states to 7738 states and 17571 transitions. [2018-12-09 04:57:10,256 INFO L78 Accepts]: Start accepts. Automaton has 7738 states and 17571 transitions. Word has length 93 [2018-12-09 04:57:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:10,257 INFO L480 AbstractCegarLoop]: Abstraction has 7738 states and 17571 transitions. [2018-12-09 04:57:10,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:57:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7738 states and 17571 transitions. [2018-12-09 04:57:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:57:10,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:10,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:10,262 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:10,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1241251611, now seen corresponding path program 1 times [2018-12-09 04:57:10,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:10,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:10,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:10,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:10,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:10,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:10,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:10,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:10,296 INFO L87 Difference]: Start difference. First operand 7738 states and 17571 transitions. Second operand 5 states. [2018-12-09 04:57:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:10,366 INFO L93 Difference]: Finished difference Result 8645 states and 19529 transitions. [2018-12-09 04:57:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:57:10,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 04:57:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:10,374 INFO L225 Difference]: With dead ends: 8645 [2018-12-09 04:57:10,374 INFO L226 Difference]: Without dead ends: 8645 [2018-12-09 04:57:10,374 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-09 04:57:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2018-12-09 04:57:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 6634. [2018-12-09 04:57:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6634 states. [2018-12-09 04:57:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 15090 transitions. [2018-12-09 04:57:10,443 INFO L78 Accepts]: Start accepts. Automaton has 6634 states and 15090 transitions. Word has length 93 [2018-12-09 04:57:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:10,443 INFO L480 AbstractCegarLoop]: Abstraction has 6634 states and 15090 transitions. [2018-12-09 04:57:10,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6634 states and 15090 transitions. [2018-12-09 04:57:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:57:10,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:10,448 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:10,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:10,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1495988156, now seen corresponding path program 1 times [2018-12-09 04:57:10,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:10,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:10,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:10,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:10,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:10,491 INFO L87 Difference]: Start difference. First operand 6634 states and 15090 transitions. Second operand 5 states. [2018-12-09 04:57:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:10,692 INFO L93 Difference]: Finished difference Result 7882 states and 17730 transitions. [2018-12-09 04:57:10,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:57:10,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 04:57:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:10,697 INFO L225 Difference]: With dead ends: 7882 [2018-12-09 04:57:10,697 INFO L226 Difference]: Without dead ends: 7751 [2018-12-09 04:57:10,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:57:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7751 states. [2018-12-09 04:57:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7751 to 7373. [2018-12-09 04:57:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7373 states. [2018-12-09 04:57:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 16709 transitions. [2018-12-09 04:57:10,752 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 16709 transitions. Word has length 93 [2018-12-09 04:57:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:10,752 INFO L480 AbstractCegarLoop]: Abstraction has 7373 states and 16709 transitions. [2018-12-09 04:57:10,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 16709 transitions. [2018-12-09 04:57:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:57:10,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:10,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:10,758 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:10,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:10,758 INFO L82 PathProgramCache]: Analyzing trace with hash -251223675, now seen corresponding path program 1 times [2018-12-09 04:57:10,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:10,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:10,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:10,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:57:10,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:10,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:57:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:57:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:57:10,797 INFO L87 Difference]: Start difference. First operand 7373 states and 16709 transitions. Second operand 6 states. [2018-12-09 04:57:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:11,015 INFO L93 Difference]: Finished difference Result 9406 states and 21103 transitions. [2018-12-09 04:57:11,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:57:11,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 04:57:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:11,021 INFO L225 Difference]: With dead ends: 9406 [2018-12-09 04:57:11,021 INFO L226 Difference]: Without dead ends: 9298 [2018-12-09 04:57:11,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:57:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9298 states. [2018-12-09 04:57:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9298 to 7200. [2018-12-09 04:57:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7200 states. [2018-12-09 04:57:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 16315 transitions. [2018-12-09 04:57:11,085 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 16315 transitions. Word has length 93 [2018-12-09 04:57:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:11,085 INFO L480 AbstractCegarLoop]: Abstraction has 7200 states and 16315 transitions. [2018-12-09 04:57:11,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:57:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 16315 transitions. [2018-12-09 04:57:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:57:11,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:11,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:11,090 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:11,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1344833246, now seen corresponding path program 1 times [2018-12-09 04:57:11,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:11,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:11,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:11,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:11,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:11,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:11,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:57:11,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:11,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:57:11,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:57:11,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:57:11,202 INFO L87 Difference]: Start difference. First operand 7200 states and 16315 transitions. Second operand 9 states. [2018-12-09 04:57:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:11,800 INFO L93 Difference]: Finished difference Result 10191 states and 23070 transitions. [2018-12-09 04:57:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:57:11,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-12-09 04:57:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:11,816 INFO L225 Difference]: With dead ends: 10191 [2018-12-09 04:57:11,816 INFO L226 Difference]: Without dead ends: 10159 [2018-12-09 04:57:11,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 04:57:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10159 states. [2018-12-09 04:57:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10159 to 9008. [2018-12-09 04:57:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9008 states. [2018-12-09 04:57:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 20407 transitions. [2018-12-09 04:57:11,898 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 20407 transitions. Word has length 93 [2018-12-09 04:57:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:11,899 INFO L480 AbstractCegarLoop]: Abstraction has 9008 states and 20407 transitions. [2018-12-09 04:57:11,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:57:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 20407 transitions. [2018-12-09 04:57:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:57:11,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:11,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:11,906 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:11,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1153182691, now seen corresponding path program 1 times [2018-12-09 04:57:11,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:11,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:11,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:11,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:11,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:11,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:11,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:57:11,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:11,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:57:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:57:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:57:11,996 INFO L87 Difference]: Start difference. First operand 9008 states and 20407 transitions. Second operand 8 states. [2018-12-09 04:57:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:12,242 INFO L93 Difference]: Finished difference Result 14357 states and 33169 transitions. [2018-12-09 04:57:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:57:12,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-09 04:57:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:12,251 INFO L225 Difference]: With dead ends: 14357 [2018-12-09 04:57:12,251 INFO L226 Difference]: Without dead ends: 14357 [2018-12-09 04:57:12,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:57:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14357 states. [2018-12-09 04:57:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14357 to 9634. [2018-12-09 04:57:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2018-12-09 04:57:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 22044 transitions. [2018-12-09 04:57:12,345 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 22044 transitions. Word has length 93 [2018-12-09 04:57:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:12,345 INFO L480 AbstractCegarLoop]: Abstraction has 9634 states and 22044 transitions. [2018-12-09 04:57:12,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:57:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 22044 transitions. [2018-12-09 04:57:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 04:57:12,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:12,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:12,353 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:12,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2040686372, now seen corresponding path program 1 times [2018-12-09 04:57:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:12,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:12,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:12,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:12,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:57:12,393 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:12,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:57:12,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:57:12,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:12,394 INFO L87 Difference]: Start difference. First operand 9634 states and 22044 transitions. Second operand 3 states. [2018-12-09 04:57:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:12,425 INFO L93 Difference]: Finished difference Result 9378 states and 21228 transitions. [2018-12-09 04:57:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:57:12,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-09 04:57:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:12,431 INFO L225 Difference]: With dead ends: 9378 [2018-12-09 04:57:12,431 INFO L226 Difference]: Without dead ends: 9346 [2018-12-09 04:57:12,431 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-09 04:57:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9346 states. [2018-12-09 04:57:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9346 to 7511. [2018-12-09 04:57:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7511 states. [2018-12-09 04:57:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7511 states to 7511 states and 16863 transitions. [2018-12-09 04:57:12,493 INFO L78 Accepts]: Start accepts. Automaton has 7511 states and 16863 transitions. Word has length 93 [2018-12-09 04:57:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:12,493 INFO L480 AbstractCegarLoop]: Abstraction has 7511 states and 16863 transitions. [2018-12-09 04:57:12,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:57:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 7511 states and 16863 transitions. [2018-12-09 04:57:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:12,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:12,498 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] [2018-12-09 04:57:12,498 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:12,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash -639150898, now seen corresponding path program 1 times [2018-12-09 04:57:12,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:12,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:12,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:12,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:12,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:12,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:12,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 04:57:12,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:12,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 04:57:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 04:57:12,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:57:12,651 INFO L87 Difference]: Start difference. First operand 7511 states and 16863 transitions. Second operand 10 states. [2018-12-09 04:57:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:13,085 INFO L93 Difference]: Finished difference Result 9932 states and 22168 transitions. [2018-12-09 04:57:13,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:57:13,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-12-09 04:57:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:13,091 INFO L225 Difference]: With dead ends: 9932 [2018-12-09 04:57:13,091 INFO L226 Difference]: Without dead ends: 9932 [2018-12-09 04:57:13,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-09 04:57:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9932 states. [2018-12-09 04:57:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9932 to 8732. [2018-12-09 04:57:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2018-12-09 04:57:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 19527 transitions. [2018-12-09 04:57:13,157 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 19527 transitions. Word has length 95 [2018-12-09 04:57:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:13,157 INFO L480 AbstractCegarLoop]: Abstraction has 8732 states and 19527 transitions. [2018-12-09 04:57:13,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 04:57:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 19527 transitions. [2018-12-09 04:57:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:13,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:13,162 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] [2018-12-09 04:57:13,163 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:13,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash 248352783, now seen corresponding path program 1 times [2018-12-09 04:57:13,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:13,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:13,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:13,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:13,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:13,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:13,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:57:13,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:13,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:57:13,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:57:13,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:57:13,278 INFO L87 Difference]: Start difference. First operand 8732 states and 19527 transitions. Second operand 9 states. [2018-12-09 04:57:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:13,621 INFO L93 Difference]: Finished difference Result 10680 states and 23668 transitions. [2018-12-09 04:57:13,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 04:57:13,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-09 04:57:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:13,628 INFO L225 Difference]: With dead ends: 10680 [2018-12-09 04:57:13,628 INFO L226 Difference]: Without dead ends: 10680 [2018-12-09 04:57:13,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-09 04:57:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10680 states. [2018-12-09 04:57:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10680 to 9212. [2018-12-09 04:57:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9212 states. [2018-12-09 04:57:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9212 states to 9212 states and 20534 transitions. [2018-12-09 04:57:13,697 INFO L78 Accepts]: Start accepts. Automaton has 9212 states and 20534 transitions. Word has length 95 [2018-12-09 04:57:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:13,697 INFO L480 AbstractCegarLoop]: Abstraction has 9212 states and 20534 transitions. [2018-12-09 04:57:13,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:57:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 9212 states and 20534 transitions. [2018-12-09 04:57:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:13,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:13,704 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] [2018-12-09 04:57:13,704 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:13,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash -427799985, now seen corresponding path program 1 times [2018-12-09 04:57:13,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:13,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:13,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:13,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:13,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:13,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 04:57:13,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:13,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 04:57:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 04:57:13,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:57:13,821 INFO L87 Difference]: Start difference. First operand 9212 states and 20534 transitions. Second operand 13 states. [2018-12-09 04:57:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:14,390 INFO L93 Difference]: Finished difference Result 12994 states and 28668 transitions. [2018-12-09 04:57:14,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 04:57:14,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-12-09 04:57:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:14,400 INFO L225 Difference]: With dead ends: 12994 [2018-12-09 04:57:14,400 INFO L226 Difference]: Without dead ends: 12994 [2018-12-09 04:57:14,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-09 04:57:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12994 states. [2018-12-09 04:57:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12994 to 9608. [2018-12-09 04:57:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-09 04:57:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 21410 transitions. [2018-12-09 04:57:14,485 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 21410 transitions. Word has length 95 [2018-12-09 04:57:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:14,485 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 21410 transitions. [2018-12-09 04:57:14,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 04:57:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 21410 transitions. [2018-12-09 04:57:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:14,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:14,492 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] [2018-12-09 04:57:14,492 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:14,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 459703696, now seen corresponding path program 1 times [2018-12-09 04:57:14,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:14,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:14,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:14,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:14,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:14,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:14,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:57:14,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:14,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 04:57:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 04:57:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:57:14,605 INFO L87 Difference]: Start difference. First operand 9608 states and 21410 transitions. Second operand 11 states. [2018-12-09 04:57:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:15,415 INFO L93 Difference]: Finished difference Result 18046 states and 40435 transitions. [2018-12-09 04:57:15,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 04:57:15,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-09 04:57:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:15,424 INFO L225 Difference]: With dead ends: 18046 [2018-12-09 04:57:15,424 INFO L226 Difference]: Without dead ends: 12348 [2018-12-09 04:57:15,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 04:57:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12348 states. [2018-12-09 04:57:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12348 to 9338. [2018-12-09 04:57:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2018-12-09 04:57:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 20791 transitions. [2018-12-09 04:57:15,527 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 20791 transitions. Word has length 95 [2018-12-09 04:57:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:15,527 INFO L480 AbstractCegarLoop]: Abstraction has 9338 states and 20791 transitions. [2018-12-09 04:57:15,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 04:57:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 20791 transitions. [2018-12-09 04:57:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:15,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:15,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:15,536 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:15,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2021940000, now seen corresponding path program 1 times [2018-12-09 04:57:15,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:15,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:15,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:15,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:57:15,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:15,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:57:15,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:57:15,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:57:15,599 INFO L87 Difference]: Start difference. First operand 9338 states and 20791 transitions. Second operand 7 states. [2018-12-09 04:57:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:15,861 INFO L93 Difference]: Finished difference Result 10983 states and 24188 transitions. [2018-12-09 04:57:15,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:57:15,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-12-09 04:57:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:15,868 INFO L225 Difference]: With dead ends: 10983 [2018-12-09 04:57:15,868 INFO L226 Difference]: Without dead ends: 10940 [2018-12-09 04:57:15,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:57:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10940 states. [2018-12-09 04:57:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10940 to 9660. [2018-12-09 04:57:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9660 states. [2018-12-09 04:57:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9660 states to 9660 states and 21408 transitions. [2018-12-09 04:57:15,966 INFO L78 Accepts]: Start accepts. Automaton has 9660 states and 21408 transitions. Word has length 95 [2018-12-09 04:57:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:15,967 INFO L480 AbstractCegarLoop]: Abstraction has 9660 states and 21408 transitions. [2018-12-09 04:57:15,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:57:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 9660 states and 21408 transitions. [2018-12-09 04:57:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:15,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:15,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:15,976 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:15,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1454890592, now seen corresponding path program 2 times [2018-12-09 04:57:15,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:15,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:15,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:16,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:16,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:57:16,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:16,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:57:16,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:57:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:57:16,072 INFO L87 Difference]: Start difference. First operand 9660 states and 21408 transitions. Second operand 9 states. [2018-12-09 04:57:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:16,425 INFO L93 Difference]: Finished difference Result 11521 states and 25358 transitions. [2018-12-09 04:57:16,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:57:16,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-12-09 04:57:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:16,432 INFO L225 Difference]: With dead ends: 11521 [2018-12-09 04:57:16,432 INFO L226 Difference]: Without dead ends: 11514 [2018-12-09 04:57:16,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:57:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2018-12-09 04:57:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 9973. [2018-12-09 04:57:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9973 states. [2018-12-09 04:57:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9973 states to 9973 states and 22132 transitions. [2018-12-09 04:57:16,510 INFO L78 Accepts]: Start accepts. Automaton has 9973 states and 22132 transitions. Word has length 95 [2018-12-09 04:57:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 9973 states and 22132 transitions. [2018-12-09 04:57:16,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:57:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9973 states and 22132 transitions. [2018-12-09 04:57:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:16,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:16,517 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] [2018-12-09 04:57:16,517 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:16,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2131043360, now seen corresponding path program 1 times [2018-12-09 04:57:16,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:16,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:57:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:16,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:16,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:16,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:57:16,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:16,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:57:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:57:16,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:57:16,575 INFO L87 Difference]: Start difference. First operand 9973 states and 22132 transitions. Second operand 6 states. [2018-12-09 04:57:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:16,678 INFO L93 Difference]: Finished difference Result 9951 states and 21877 transitions. [2018-12-09 04:57:16,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:57:16,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-09 04:57:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:16,685 INFO L225 Difference]: With dead ends: 9951 [2018-12-09 04:57:16,685 INFO L226 Difference]: Without dead ends: 9951 [2018-12-09 04:57:16,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:57:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9951 states. [2018-12-09 04:57:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9951 to 9324. [2018-12-09 04:57:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9324 states. [2018-12-09 04:57:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9324 states to 9324 states and 20583 transitions. [2018-12-09 04:57:16,752 INFO L78 Accepts]: Start accepts. Automaton has 9324 states and 20583 transitions. Word has length 95 [2018-12-09 04:57:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:16,752 INFO L480 AbstractCegarLoop]: Abstraction has 9324 states and 20583 transitions. [2018-12-09 04:57:16,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:57:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 9324 states and 20583 transitions. [2018-12-09 04:57:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:16,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:16,759 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] [2018-12-09 04:57:16,760 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:16,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1943261535, now seen corresponding path program 2 times [2018-12-09 04:57:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:16,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:16,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:16,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:16,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:16,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:16,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:57:16,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:16,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:57:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:57:16,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:57:16,853 INFO L87 Difference]: Start difference. First operand 9324 states and 20583 transitions. Second operand 8 states. [2018-12-09 04:57:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:17,065 INFO L93 Difference]: Finished difference Result 12438 states and 27163 transitions. [2018-12-09 04:57:17,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:57:17,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-12-09 04:57:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:17,073 INFO L225 Difference]: With dead ends: 12438 [2018-12-09 04:57:17,074 INFO L226 Difference]: Without dead ends: 12438 [2018-12-09 04:57:17,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:57:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12438 states. [2018-12-09 04:57:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12438 to 9626. [2018-12-09 04:57:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9626 states. [2018-12-09 04:57:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 21283 transitions. [2018-12-09 04:57:17,156 INFO L78 Accepts]: Start accepts. Automaton has 9626 states and 21283 transitions. Word has length 95 [2018-12-09 04:57:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:17,156 INFO L480 AbstractCegarLoop]: Abstraction has 9626 states and 21283 transitions. [2018-12-09 04:57:17,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:57:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9626 states and 21283 transitions. [2018-12-09 04:57:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:17,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:17,164 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] [2018-12-09 04:57:17,164 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:17,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1675552993, now seen corresponding path program 2 times [2018-12-09 04:57:17,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:17,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:57:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:17,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:17,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:17,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 04:57:17,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:17,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 04:57:17,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 04:57:17,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:57:17,253 INFO L87 Difference]: Start difference. First operand 9626 states and 21283 transitions. Second operand 12 states. [2018-12-09 04:57:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:17,653 INFO L93 Difference]: Finished difference Result 11854 states and 26083 transitions. [2018-12-09 04:57:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 04:57:17,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2018-12-09 04:57:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:17,660 INFO L225 Difference]: With dead ends: 11854 [2018-12-09 04:57:17,660 INFO L226 Difference]: Without dead ends: 11854 [2018-12-09 04:57:17,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-12-09 04:57:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2018-12-09 04:57:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 9423. [2018-12-09 04:57:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9423 states. [2018-12-09 04:57:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9423 states to 9423 states and 20864 transitions. [2018-12-09 04:57:17,735 INFO L78 Accepts]: Start accepts. Automaton has 9423 states and 20864 transitions. Word has length 95 [2018-12-09 04:57:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:17,735 INFO L480 AbstractCegarLoop]: Abstraction has 9423 states and 20864 transitions. [2018-12-09 04:57:17,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 04:57:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9423 states and 20864 transitions. [2018-12-09 04:57:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:57:17,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:17,741 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] [2018-12-09 04:57:17,742 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:17,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1731910622, now seen corresponding path program 2 times [2018-12-09 04:57:17,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:17,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:57:17,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:17,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:57:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:57:17,780 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 04:57:17,846 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 04:57:17,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:57:17 BasicIcfg [2018-12-09 04:57:17,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:57:17,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:57:17,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:57:17,847 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:57:17,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:57" (3/4) ... [2018-12-09 04:57:17,849 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 04:57:17,918 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_757a0272-346a-49e4-8943-b2744244297e/bin-2019/utaipan/witness.graphml [2018-12-09 04:57:17,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:57:17,919 INFO L168 Benchmark]: Toolchain (without parser) took 20715.29 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 950.6 MB in the beginning and 1.6 GB in the end (delta: -633.5 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 04:57:17,919 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:57:17,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -98.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 04:57:17,920 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:57:17,920 INFO L168 Benchmark]: Boogie Preprocessor took 20.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:57:17,920 INFO L168 Benchmark]: RCFGBuilder took 341.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.3 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:57:17,920 INFO L168 Benchmark]: TraceAbstraction took 19932.10 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 997.3 MB in the beginning and 1.6 GB in the end (delta: -621.1 MB). Peak memory consumption was 956.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:57:17,920 INFO L168 Benchmark]: Witness Printer took 71.05 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-12-09 04:57:17,921 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -98.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 341.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.3 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19932.10 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 997.3 MB in the beginning and 1.6 GB in the end (delta: -621.1 MB). Peak memory consumption was 956.0 MB. Max. memory is 11.5 GB. * Witness Printer took 71.05 ms. Allocated memory is still 2.7 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] -1 pthread_t t1707; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] FCALL, FORK -1 pthread_create(&t1707, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 0 x$w_buff1 = x$w_buff0 [L702] 0 x$w_buff0 = 1 [L703] 0 x$w_buff1_used = x$w_buff0_used [L704] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L707] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L708] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L709] 0 x$r_buff0_thd1 = (_Bool)1 [L712] 0 y = 1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L715] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] -1 pthread_t t1708; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] FCALL, FORK -1 pthread_create(&t1708, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 y = 2 [L732] 1 __unbuffered_p1_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L745] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L722] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L789] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 222 locations, 3 error locations. UNSAFE Result, 19.8s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9502 SDtfs, 11043 SDslu, 25438 SDs, 0 SdLazy, 12535 SolverSat, 565 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 100 SyntacticMatches, 43 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34806occurred in iteration=0, 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: 5.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 96073 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2859 NumberOfCodeBlocks, 2859 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2728 ConstructedInterpolants, 0 QuantifiedInterpolants, 653577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...