./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_cev_2_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_cev_2_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/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 deb919dbeb6c93820ecd17ebd2a54de676136f72 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 12:59:32,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:59:32,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:59:32,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:59:32,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:59:32,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:59:32,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:59:32,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:59:32,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:59:32,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:59:32,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:59:32,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:59:32,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:59:32,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:59:32,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:59:32,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:59:32,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:59:32,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:59:32,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:59:32,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:59:32,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:59:32,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:59:32,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:59:32,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:59:32,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:59:32,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:59:32,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:59:32,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:59:32,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:59:32,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:59:32,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:59:32,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:59:32,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:59:32,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:59:32,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:59:32,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:59:32,327 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:59:32,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:59:32,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:59:32,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:59:32,338 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:59:32,338 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:59:32,339 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:59:32,339 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:59:32,339 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:59:32,339 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:59:32,339 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:59:32,339 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:59:32,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:59:32,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:59:32,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:59:32,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:59:32,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:59:32,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:59:32,340 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:59:32,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:59:32,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:59:32,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:59:32,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:59:32,341 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:59:32,341 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:59:32,341 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:59:32,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:59:32,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:59:32,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:59:32,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:59:32,342 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:59:32,342 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:59:32,342 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:59:32,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:59:32,343 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:59:32,343 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_cd4d2d20-f20d-486b-b316-d69116529171/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 -> deb919dbeb6c93820ecd17ebd2a54de676136f72 [2018-11-10 12:59:32,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:59:32,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:59:32,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:59:32,379 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:59:32,380 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:59:32,380 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/../../sv-benchmarks/c/psyco/psyco_cev_2_false-unreach-call.c [2018-11-10 12:59:32,425 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/data/1bcb2a68d/75a70a40f9014c0d8406b86b63b27501/FLAGf5c188724 [2018-11-10 12:59:38,911 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:59:38,912 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/sv-benchmarks/c/psyco/psyco_cev_2_false-unreach-call.c [2018-11-10 12:59:39,974 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/data/1bcb2a68d/75a70a40f9014c0d8406b86b63b27501/FLAGf5c188724 [2018-11-10 12:59:39,982 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/data/1bcb2a68d/75a70a40f9014c0d8406b86b63b27501 [2018-11-10 12:59:39,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:59:39,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:59:39,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:59:39,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:59:39,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:59:39,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:39" (1/1) ... [2018-11-10 12:59:39,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e892343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:39, skipping insertion in model container [2018-11-10 12:59:39,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:39" (1/1) ... [2018-11-10 12:59:39,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:59:47,235 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:01:41,713 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:01:41,717 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:03:16,019 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:03:16,030 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:03:16,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16 WrapperNode [2018-11-10 13:03:16,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:03:16,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:03:16,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:03:16,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:03:16,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:20,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:20,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:03:20,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:03:20,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:03:20,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:03:20,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:20,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:23,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:23,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:39,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:39,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:42,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... [2018-11-10 13:03:46,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:03:46,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:03:46,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:03:46,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:03:46,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/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-11-10 13:03:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:03:46,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:03:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:03:46,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:03:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:03:46,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:04:09,270 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:04:09,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:09 BoogieIcfgContainer [2018-11-10 13:04:09,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:04:09,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:04:09,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:04:09,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:04:09,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:59:39" (1/3) ... [2018-11-10 13:04:09,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59011227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:09, skipping insertion in model container [2018-11-10 13:04:09,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:03:16" (2/3) ... [2018-11-10 13:04:09,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59011227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:09, skipping insertion in model container [2018-11-10 13:04:09,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:09" (3/3) ... [2018-11-10 13:04:09,276 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_cev_2_false-unreach-call.c [2018-11-10 13:04:09,282 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:04:09,288 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:04:09,297 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:04:09,343 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:04:09,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:04:09,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:04:09,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:04:09,343 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:04:09,343 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:04:09,343 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:04:09,344 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:04:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 7499 states. [2018-11-10 13:04:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 13:04:09,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:09,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:09,421 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:09,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:09,427 INFO L82 PathProgramCache]: Analyzing trace with hash -263901133, now seen corresponding path program 1 times [2018-11-10 13:04:09,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:09,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:09,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:09,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:04:09,557 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:09,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:04:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:04:09,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:04:09,571 INFO L87 Difference]: Start difference. First operand 7499 states. Second operand 2 states. [2018-11-10 13:04:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:09,725 INFO L93 Difference]: Finished difference Result 12688 states and 25354 transitions. [2018-11-10 13:04:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:04:09,726 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-10 13:04:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:09,755 INFO L225 Difference]: With dead ends: 12688 [2018-11-10 13:04:09,755 INFO L226 Difference]: Without dead ends: 5150 [2018-11-10 13:04:09,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:04:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5150 states. [2018-11-10 13:04:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5150 to 5150. [2018-11-10 13:04:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5150 states. [2018-11-10 13:04:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 7657 transitions. [2018-11-10 13:04:09,893 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 7657 transitions. Word has length 13 [2018-11-10 13:04:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:09,894 INFO L481 AbstractCegarLoop]: Abstraction has 5150 states and 7657 transitions. [2018-11-10 13:04:09,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:04:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 7657 transitions. [2018-11-10 13:04:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 13:04:09,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:09,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:09,896 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:09,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash 940305949, now seen corresponding path program 1 times [2018-11-10 13:04:09,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:09,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:09,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:09,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:09,897 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:09,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:09,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:09,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:09,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:09,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:09,944 INFO L87 Difference]: Start difference. First operand 5150 states and 7657 transitions. Second operand 3 states. [2018-11-10 13:04:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:10,441 INFO L93 Difference]: Finished difference Result 10297 states and 15312 transitions. [2018-11-10 13:04:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:10,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 13:04:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:10,458 INFO L225 Difference]: With dead ends: 10297 [2018-11-10 13:04:10,458 INFO L226 Difference]: Without dead ends: 5153 [2018-11-10 13:04:10,466 INFO L605 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-11-10 13:04:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2018-11-10 13:04:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 5153. [2018-11-10 13:04:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-11-10 13:04:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 7660 transitions. [2018-11-10 13:04:10,547 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 7660 transitions. Word has length 14 [2018-11-10 13:04:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:10,547 INFO L481 AbstractCegarLoop]: Abstraction has 5153 states and 7660 transitions. [2018-11-10 13:04:10,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 7660 transitions. [2018-11-10 13:04:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 13:04:10,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:10,548 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:10,548 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:10,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:10,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1702280662, now seen corresponding path program 1 times [2018-11-10 13:04:10,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:10,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:10,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:10,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:10,550 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:10,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:10,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:10,596 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:10,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:10,596 INFO L87 Difference]: Start difference. First operand 5153 states and 7660 transitions. Second operand 3 states. [2018-11-10 13:04:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:10,947 INFO L93 Difference]: Finished difference Result 10285 states and 15295 transitions. [2018-11-10 13:04:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:10,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 13:04:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:10,963 INFO L225 Difference]: With dead ends: 10285 [2018-11-10 13:04:10,963 INFO L226 Difference]: Without dead ends: 5139 [2018-11-10 13:04:10,971 INFO L605 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-11-10 13:04:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2018-11-10 13:04:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 5139. [2018-11-10 13:04:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5139 states. [2018-11-10 13:04:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 7640 transitions. [2018-11-10 13:04:11,052 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 7640 transitions. Word has length 19 [2018-11-10 13:04:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:11,052 INFO L481 AbstractCegarLoop]: Abstraction has 5139 states and 7640 transitions. [2018-11-10 13:04:11,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 7640 transitions. [2018-11-10 13:04:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 13:04:11,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:11,053 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:11,054 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:11,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1072069579, now seen corresponding path program 1 times [2018-11-10 13:04:11,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:11,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:11,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:11,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:11,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:11,094 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:11,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:11,095 INFO L87 Difference]: Start difference. First operand 5139 states and 7640 transitions. Second operand 3 states. [2018-11-10 13:04:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:11,784 INFO L93 Difference]: Finished difference Result 15384 states and 22885 transitions. [2018-11-10 13:04:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:11,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 13:04:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:11,813 INFO L225 Difference]: With dead ends: 15384 [2018-11-10 13:04:11,813 INFO L226 Difference]: Without dead ends: 10245 [2018-11-10 13:04:11,822 INFO L605 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-11-10 13:04:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10245 states. [2018-11-10 13:04:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10245 to 10179. [2018-11-10 13:04:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10179 states. [2018-11-10 13:04:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 15153 transitions. [2018-11-10 13:04:11,977 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 15153 transitions. Word has length 22 [2018-11-10 13:04:11,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:11,977 INFO L481 AbstractCegarLoop]: Abstraction has 10179 states and 15153 transitions. [2018-11-10 13:04:11,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:11,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 15153 transitions. [2018-11-10 13:04:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 13:04:11,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:11,978 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:11,979 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:11,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 746756741, now seen corresponding path program 1 times [2018-11-10 13:04:11,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:11,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:11,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:11,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:12,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:12,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:12,004 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:12,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:12,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:12,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:12,005 INFO L87 Difference]: Start difference. First operand 10179 states and 15153 transitions. Second operand 3 states. [2018-11-10 13:04:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:12,422 INFO L93 Difference]: Finished difference Result 20356 states and 30304 transitions. [2018-11-10 13:04:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:12,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 13:04:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:12,442 INFO L225 Difference]: With dead ends: 20356 [2018-11-10 13:04:12,442 INFO L226 Difference]: Without dead ends: 10189 [2018-11-10 13:04:12,454 INFO L605 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-11-10 13:04:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10189 states. [2018-11-10 13:04:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10189 to 10187. [2018-11-10 13:04:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10187 states. [2018-11-10 13:04:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10187 states to 10187 states and 15161 transitions. [2018-11-10 13:04:12,557 INFO L78 Accepts]: Start accepts. Automaton has 10187 states and 15161 transitions. Word has length 25 [2018-11-10 13:04:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:12,558 INFO L481 AbstractCegarLoop]: Abstraction has 10187 states and 15161 transitions. [2018-11-10 13:04:12,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 10187 states and 15161 transitions. [2018-11-10 13:04:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 13:04:12,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:12,559 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 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-11-10 13:04:12,559 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:12,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:12,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1767567643, now seen corresponding path program 1 times [2018-11-10 13:04:12,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:12,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:12,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:12,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:12,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:12,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:12,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:12,596 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:12,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:12,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:12,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:12,596 INFO L87 Difference]: Start difference. First operand 10187 states and 15161 transitions. Second operand 3 states. [2018-11-10 13:04:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:12,777 INFO L93 Difference]: Finished difference Result 20374 states and 30324 transitions. [2018-11-10 13:04:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:12,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 13:04:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:12,792 INFO L225 Difference]: With dead ends: 20374 [2018-11-10 13:04:12,792 INFO L226 Difference]: Without dead ends: 10199 [2018-11-10 13:04:12,802 INFO L605 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-11-10 13:04:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10199 states. [2018-11-10 13:04:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10199 to 10197. [2018-11-10 13:04:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10197 states. [2018-11-10 13:04:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10197 states to 10197 states and 15171 transitions. [2018-11-10 13:04:12,896 INFO L78 Accepts]: Start accepts. Automaton has 10197 states and 15171 transitions. Word has length 33 [2018-11-10 13:04:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:12,896 INFO L481 AbstractCegarLoop]: Abstraction has 10197 states and 15171 transitions. [2018-11-10 13:04:12,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 10197 states and 15171 transitions. [2018-11-10 13:04:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-11-10 13:04:12,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:12,901 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:12,901 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:12,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:12,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1794245389, now seen corresponding path program 1 times [2018-11-10 13:04:12,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:12,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:12,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:12,905 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:13,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:13,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:13,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:13,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:13,098 INFO L87 Difference]: Start difference. First operand 10197 states and 15171 transitions. Second operand 3 states. [2018-11-10 13:04:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:13,314 INFO L93 Difference]: Finished difference Result 10770 states and 16016 transitions. [2018-11-10 13:04:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:13,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-11-10 13:04:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:13,332 INFO L225 Difference]: With dead ends: 10770 [2018-11-10 13:04:13,332 INFO L226 Difference]: Without dead ends: 10764 [2018-11-10 13:04:13,336 INFO L605 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-11-10 13:04:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10764 states. [2018-11-10 13:04:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10764 to 10756. [2018-11-10 13:04:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10756 states. [2018-11-10 13:04:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 16002 transitions. [2018-11-10 13:04:13,501 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 16002 transitions. Word has length 285 [2018-11-10 13:04:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:13,501 INFO L481 AbstractCegarLoop]: Abstraction has 10756 states and 16002 transitions. [2018-11-10 13:04:13,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 16002 transitions. [2018-11-10 13:04:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-10 13:04:13,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:13,504 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:13,504 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:13,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash 223358732, now seen corresponding path program 1 times [2018-11-10 13:04:13,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:13,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:13,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:13,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:13,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:13,740 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:13,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:13,741 INFO L87 Difference]: Start difference. First operand 10756 states and 16002 transitions. Second operand 3 states. [2018-11-10 13:04:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:14,132 INFO L93 Difference]: Finished difference Result 31117 states and 46309 transitions. [2018-11-10 13:04:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:14,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-11-10 13:04:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:14,157 INFO L225 Difference]: With dead ends: 31117 [2018-11-10 13:04:14,157 INFO L226 Difference]: Without dead ends: 20932 [2018-11-10 13:04:14,174 INFO L605 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-11-10 13:04:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20932 states. [2018-11-10 13:04:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20932 to 20870. [2018-11-10 13:04:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20870 states. [2018-11-10 13:04:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20870 states to 20870 states and 31064 transitions. [2018-11-10 13:04:14,445 INFO L78 Accepts]: Start accepts. Automaton has 20870 states and 31064 transitions. Word has length 286 [2018-11-10 13:04:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:14,446 INFO L481 AbstractCegarLoop]: Abstraction has 20870 states and 31064 transitions. [2018-11-10 13:04:14,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 20870 states and 31064 transitions. [2018-11-10 13:04:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-10 13:04:14,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:14,451 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:14,451 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:14,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash -148289768, now seen corresponding path program 1 times [2018-11-10 13:04:14,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:14,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:14,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:14,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:14,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:14,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:14,616 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:14,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:14,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:14,617 INFO L87 Difference]: Start difference. First operand 20870 states and 31064 transitions. Second operand 3 states. [2018-11-10 13:04:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:15,008 INFO L93 Difference]: Finished difference Result 41166 states and 61282 transitions. [2018-11-10 13:04:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:15,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-11-10 13:04:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:15,033 INFO L225 Difference]: With dead ends: 41166 [2018-11-10 13:04:15,033 INFO L226 Difference]: Without dead ends: 20867 [2018-11-10 13:04:15,057 INFO L605 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-11-10 13:04:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20867 states. [2018-11-10 13:04:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20867 to 20861. [2018-11-10 13:04:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20861 states. [2018-11-10 13:04:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20861 states to 20861 states and 31038 transitions. [2018-11-10 13:04:15,299 INFO L78 Accepts]: Start accepts. Automaton has 20861 states and 31038 transitions. Word has length 294 [2018-11-10 13:04:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:15,300 INFO L481 AbstractCegarLoop]: Abstraction has 20861 states and 31038 transitions. [2018-11-10 13:04:15,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20861 states and 31038 transitions. [2018-11-10 13:04:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-10 13:04:15,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:15,305 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:15,305 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:15,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1897048442, now seen corresponding path program 1 times [2018-11-10 13:04:15,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:15,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:15,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:15,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 13:04:15,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:15,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:15,428 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:15,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:15,430 INFO L87 Difference]: Start difference. First operand 20861 states and 31038 transitions. Second operand 3 states. [2018-11-10 13:04:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:15,710 INFO L93 Difference]: Finished difference Result 37792 states and 56236 transitions. [2018-11-10 13:04:15,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:15,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-11-10 13:04:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:15,725 INFO L225 Difference]: With dead ends: 37792 [2018-11-10 13:04:15,725 INFO L226 Difference]: Without dead ends: 17502 [2018-11-10 13:04:15,738 INFO L605 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-11-10 13:04:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17502 states. [2018-11-10 13:04:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17502 to 17500. [2018-11-10 13:04:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17500 states. [2018-11-10 13:04:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17500 states to 17500 states and 26028 transitions. [2018-11-10 13:04:15,896 INFO L78 Accepts]: Start accepts. Automaton has 17500 states and 26028 transitions. Word has length 303 [2018-11-10 13:04:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:15,896 INFO L481 AbstractCegarLoop]: Abstraction has 17500 states and 26028 transitions. [2018-11-10 13:04:15,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17500 states and 26028 transitions. [2018-11-10 13:04:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 13:04:15,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:15,901 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:15,902 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:15,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash 148254606, now seen corresponding path program 1 times [2018-11-10 13:04:15,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:15,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:15,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:15,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:15,903 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:16,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:16,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:16,070 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:16,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:16,071 INFO L87 Difference]: Start difference. First operand 17500 states and 26028 transitions. Second operand 3 states. [2018-11-10 13:04:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:16,379 INFO L93 Difference]: Finished difference Result 33861 states and 50365 transitions. [2018-11-10 13:04:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:16,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2018-11-10 13:04:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:16,394 INFO L225 Difference]: With dead ends: 33861 [2018-11-10 13:04:16,394 INFO L226 Difference]: Without dead ends: 16932 [2018-11-10 13:04:16,408 INFO L605 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-11-10 13:04:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16932 states. [2018-11-10 13:04:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16932 to 16930. [2018-11-10 13:04:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16930 states. [2018-11-10 13:04:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16930 states to 16930 states and 25176 transitions. [2018-11-10 13:04:16,529 INFO L78 Accepts]: Start accepts. Automaton has 16930 states and 25176 transitions. Word has length 304 [2018-11-10 13:04:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:16,530 INFO L481 AbstractCegarLoop]: Abstraction has 16930 states and 25176 transitions. [2018-11-10 13:04:16,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 16930 states and 25176 transitions. [2018-11-10 13:04:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 13:04:16,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:16,533 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:16,533 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:16,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:16,534 INFO L82 PathProgramCache]: Analyzing trace with hash -598672182, now seen corresponding path program 1 times [2018-11-10 13:04:16,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:16,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:16,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:16,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:16,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:17,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:17,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:04:17,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:17,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:04:17,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:04:17,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:04:17,069 INFO L87 Difference]: Start difference. First operand 16930 states and 25176 transitions. Second operand 4 states. [2018-11-10 13:04:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:17,417 INFO L93 Difference]: Finished difference Result 18074 states and 26866 transitions. [2018-11-10 13:04:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:04:17,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2018-11-10 13:04:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:17,431 INFO L225 Difference]: With dead ends: 18074 [2018-11-10 13:04:17,431 INFO L226 Difference]: Without dead ends: 18072 [2018-11-10 13:04:17,435 INFO L605 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-11-10 13:04:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18072 states. [2018-11-10 13:04:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18072 to 18062. [2018-11-10 13:04:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18062 states. [2018-11-10 13:04:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18062 states to 18062 states and 26855 transitions. [2018-11-10 13:04:17,561 INFO L78 Accepts]: Start accepts. Automaton has 18062 states and 26855 transitions. Word has length 304 [2018-11-10 13:04:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:17,561 INFO L481 AbstractCegarLoop]: Abstraction has 18062 states and 26855 transitions. [2018-11-10 13:04:17,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:04:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 18062 states and 26855 transitions. [2018-11-10 13:04:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-10 13:04:17,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:17,564 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:17,564 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:17,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1691713046, now seen corresponding path program 1 times [2018-11-10 13:04:17,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:17,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:17,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 13:04:17,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:17,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:17,672 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:17,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:17,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:17,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:17,673 INFO L87 Difference]: Start difference. First operand 18062 states and 26855 transitions. Second operand 3 states. [2018-11-10 13:04:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:18,001 INFO L93 Difference]: Finished difference Result 33916 states and 50413 transitions. [2018-11-10 13:04:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:18,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2018-11-10 13:04:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:18,020 INFO L225 Difference]: With dead ends: 33916 [2018-11-10 13:04:18,020 INFO L226 Difference]: Without dead ends: 18124 [2018-11-10 13:04:18,033 INFO L605 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-11-10 13:04:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18124 states. [2018-11-10 13:04:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18124 to 18066. [2018-11-10 13:04:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18066 states. [2018-11-10 13:04:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18066 states to 18066 states and 26843 transitions. [2018-11-10 13:04:18,216 INFO L78 Accepts]: Start accepts. Automaton has 18066 states and 26843 transitions. Word has length 306 [2018-11-10 13:04:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:18,217 INFO L481 AbstractCegarLoop]: Abstraction has 18066 states and 26843 transitions. [2018-11-10 13:04:18,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18066 states and 26843 transitions. [2018-11-10 13:04:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-11-10 13:04:18,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:18,219 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:18,220 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:18,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1582252413, now seen corresponding path program 1 times [2018-11-10 13:04:18,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:18,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:18,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 13:04:18,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:18,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:18,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:18,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:18,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:18,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:18,300 INFO L87 Difference]: Start difference. First operand 18066 states and 26843 transitions. Second operand 3 states. [2018-11-10 13:04:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:18,498 INFO L93 Difference]: Finished difference Result 33882 states and 50347 transitions. [2018-11-10 13:04:18,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:18,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-11-10 13:04:18,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:18,516 INFO L225 Difference]: With dead ends: 33882 [2018-11-10 13:04:18,516 INFO L226 Difference]: Without dead ends: 18096 [2018-11-10 13:04:18,525 INFO L605 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-11-10 13:04:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18096 states. [2018-11-10 13:04:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18096 to 18094. [2018-11-10 13:04:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18094 states. [2018-11-10 13:04:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18094 states to 18094 states and 26871 transitions. [2018-11-10 13:04:18,648 INFO L78 Accepts]: Start accepts. Automaton has 18094 states and 26871 transitions. Word has length 307 [2018-11-10 13:04:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:18,649 INFO L481 AbstractCegarLoop]: Abstraction has 18094 states and 26871 transitions. [2018-11-10 13:04:18,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18094 states and 26871 transitions. [2018-11-10 13:04:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-11-10 13:04:18,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:18,651 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:18,651 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:18,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash 774224451, now seen corresponding path program 1 times [2018-11-10 13:04:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:18,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:18,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:18,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:18,652 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:04:18,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:18,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:18,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:18,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:18,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:18,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:18,731 INFO L87 Difference]: Start difference. First operand 18094 states and 26871 transitions. Second operand 3 states. [2018-11-10 13:04:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:18,913 INFO L93 Difference]: Finished difference Result 32210 states and 47850 transitions. [2018-11-10 13:04:18,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:18,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2018-11-10 13:04:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:18,926 INFO L225 Difference]: With dead ends: 32210 [2018-11-10 13:04:18,926 INFO L226 Difference]: Without dead ends: 16396 [2018-11-10 13:04:18,935 INFO L605 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-11-10 13:04:18,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16396 states. [2018-11-10 13:04:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16396 to 16394. [2018-11-10 13:04:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16394 states. [2018-11-10 13:04:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16394 states to 16394 states and 24346 transitions. [2018-11-10 13:04:19,061 INFO L78 Accepts]: Start accepts. Automaton has 16394 states and 24346 transitions. Word has length 321 [2018-11-10 13:04:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:19,062 INFO L481 AbstractCegarLoop]: Abstraction has 16394 states and 24346 transitions. [2018-11-10 13:04:19,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 16394 states and 24346 transitions. [2018-11-10 13:04:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-10 13:04:19,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:19,066 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:19,066 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:19,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash 403931049, now seen corresponding path program 1 times [2018-11-10 13:04:19,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:19,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:19,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 13:04:19,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:19,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:19,184 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:19,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:19,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:19,185 INFO L87 Difference]: Start difference. First operand 16394 states and 24346 transitions. Second operand 3 states. [2018-11-10 13:04:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:19,367 INFO L93 Difference]: Finished difference Result 30542 states and 45357 transitions. [2018-11-10 13:04:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:19,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2018-11-10 13:04:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:19,383 INFO L225 Difference]: With dead ends: 30542 [2018-11-10 13:04:19,383 INFO L226 Difference]: Without dead ends: 16428 [2018-11-10 13:04:19,392 INFO L605 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-11-10 13:04:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16428 states. [2018-11-10 13:04:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16428 to 16426. [2018-11-10 13:04:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16426 states. [2018-11-10 13:04:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16426 states to 16426 states and 24378 transitions. [2018-11-10 13:04:19,539 INFO L78 Accepts]: Start accepts. Automaton has 16426 states and 24378 transitions. Word has length 324 [2018-11-10 13:04:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:19,539 INFO L481 AbstractCegarLoop]: Abstraction has 16426 states and 24378 transitions. [2018-11-10 13:04:19,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16426 states and 24378 transitions. [2018-11-10 13:04:19,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-10 13:04:19,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:19,542 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:19,543 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:19,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:19,543 INFO L82 PathProgramCache]: Analyzing trace with hash 145835823, now seen corresponding path program 1 times [2018-11-10 13:04:19,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:19,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:19,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:19,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:19,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 13:04:19,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:19,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:19,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:19,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:19,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:19,674 INFO L87 Difference]: Start difference. First operand 16426 states and 24378 transitions. Second operand 3 states. [2018-11-10 13:04:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:19,871 INFO L93 Difference]: Finished difference Result 30610 states and 45429 transitions. [2018-11-10 13:04:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:19,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-11-10 13:04:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:19,884 INFO L225 Difference]: With dead ends: 30610 [2018-11-10 13:04:19,884 INFO L226 Difference]: Without dead ends: 16464 [2018-11-10 13:04:19,892 INFO L605 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-11-10 13:04:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16464 states. [2018-11-10 13:04:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16464 to 16462. [2018-11-10 13:04:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16462 states. [2018-11-10 13:04:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16462 states to 16462 states and 24414 transitions. [2018-11-10 13:04:20,049 INFO L78 Accepts]: Start accepts. Automaton has 16462 states and 24414 transitions. Word has length 341 [2018-11-10 13:04:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:20,049 INFO L481 AbstractCegarLoop]: Abstraction has 16462 states and 24414 transitions. [2018-11-10 13:04:20,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 16462 states and 24414 transitions. [2018-11-10 13:04:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-11-10 13:04:20,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:20,056 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:20,056 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:20,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1183507158, now seen corresponding path program 1 times [2018-11-10 13:04:20,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:20,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:20,058 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 13:04:20,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:20,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:20,320 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:20,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:20,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:20,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:20,321 INFO L87 Difference]: Start difference. First operand 16462 states and 24414 transitions. Second operand 3 states. [2018-11-10 13:04:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:20,524 INFO L93 Difference]: Finished difference Result 17613 states and 26110 transitions. [2018-11-10 13:04:20,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:20,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 570 [2018-11-10 13:04:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:20,537 INFO L225 Difference]: With dead ends: 17613 [2018-11-10 13:04:20,537 INFO L226 Difference]: Without dead ends: 17605 [2018-11-10 13:04:20,541 INFO L605 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-11-10 13:04:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17605 states. [2018-11-10 13:04:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17605 to 17593. [2018-11-10 13:04:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17593 states. [2018-11-10 13:04:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17593 states to 17593 states and 26089 transitions. [2018-11-10 13:04:20,671 INFO L78 Accepts]: Start accepts. Automaton has 17593 states and 26089 transitions. Word has length 570 [2018-11-10 13:04:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:20,671 INFO L481 AbstractCegarLoop]: Abstraction has 17593 states and 26089 transitions. [2018-11-10 13:04:20,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 17593 states and 26089 transitions. [2018-11-10 13:04:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2018-11-10 13:04:20,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:20,676 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:20,677 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:20,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash -417536946, now seen corresponding path program 1 times [2018-11-10 13:04:20,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:20,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:20,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:20,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 13:04:21,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:21,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:21,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:04:21,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:21,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:21,002 INFO L87 Difference]: Start difference. First operand 17593 states and 26089 transitions. Second operand 3 states. [2018-11-10 13:04:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:21,384 INFO L93 Difference]: Finished difference Result 49355 states and 73203 transitions. [2018-11-10 13:04:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:21,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 576 [2018-11-10 13:04:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:21,405 INFO L225 Difference]: With dead ends: 49355 [2018-11-10 13:04:21,406 INFO L226 Difference]: Without dead ends: 34032 [2018-11-10 13:04:21,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-10 13:04:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34032 states. [2018-11-10 13:04:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34032 to 33822. [2018-11-10 13:04:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33822 states. [2018-11-10 13:04:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33822 states to 33822 states and 50252 transitions. [2018-11-10 13:04:21,632 INFO L78 Accepts]: Start accepts. Automaton has 33822 states and 50252 transitions. Word has length 576 [2018-11-10 13:04:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:21,632 INFO L481 AbstractCegarLoop]: Abstraction has 33822 states and 50252 transitions. [2018-11-10 13:04:21,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 33822 states and 50252 transitions. [2018-11-10 13:04:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-11-10 13:04:21,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:21,637 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 13:04:21,637 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:21,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash -816240994, now seen corresponding path program 1 times [2018-11-10 13:04:21,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:04:21,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:21,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:21,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:21,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:04:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:04:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:04:22,087 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:04:22,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:04:22 BoogieIcfgContainer [2018-11-10 13:04:22,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:04:22,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:04:22,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:04:22,203 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:04:22,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:09" (3/4) ... [2018-11-10 13:04:22,205 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:04:22,325 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cd4d2d20-f20d-486b-b316-d69116529171/bin-2019/utaipan/witness.graphml [2018-11-10 13:04:22,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:04:22,326 INFO L168 Benchmark]: Toolchain (without parser) took 282341.39 ms. Allocated memory was 2.5 GB in the beginning and 10.1 GB in the end (delta: 7.6 GB). Free memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-11-10 13:04:22,327 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:04:22,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216045.16 ms. Allocated memory was 2.5 GB in the beginning and 9.3 GB in the end (delta: 6.8 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 6.7 GB. Max. memory is 11.5 GB. [2018-11-10 13:04:22,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 4779.92 ms. Allocated memory was 9.3 GB in the beginning and 9.3 GB in the end (delta: 14.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -326.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 13:04:22,327 INFO L168 Benchmark]: Boogie Preprocessor took 25641.54 ms. Allocated memory was 9.3 GB in the beginning and 10.3 GB in the end (delta: 955.8 MB). Free memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-11-10 13:04:22,328 INFO L168 Benchmark]: RCFGBuilder took 22818.41 ms. Allocated memory was 10.3 GB in the beginning and 11.5 GB in the end (delta: 1.2 GB). Free memory was 3.7 GB in the beginning and 6.0 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-11-10 13:04:22,328 INFO L168 Benchmark]: TraceAbstraction took 12930.84 ms. Allocated memory was 11.5 GB in the beginning and 10.1 GB in the end (delta: -1.3 GB). Free memory was 6.0 GB in the beginning and 4.5 GB in the end (delta: 1.5 GB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:04:22,328 INFO L168 Benchmark]: Witness Printer took 122.64 ms. Allocated memory is still 10.1 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:04:22,330 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 216045.16 ms. Allocated memory was 2.5 GB in the beginning and 9.3 GB in the end (delta: 6.8 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 6.7 GB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 4779.92 ms. Allocated memory was 9.3 GB in the beginning and 9.3 GB in the end (delta: 14.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -326.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25641.54 ms. Allocated memory was 9.3 GB in the beginning and 10.3 GB in the end (delta: 955.8 MB). Free memory was 2.5 GB in the beginning and 3.7 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * RCFGBuilder took 22818.41 ms. Allocated memory was 10.3 GB in the beginning and 11.5 GB in the end (delta: 1.2 GB). Free memory was 3.7 GB in the beginning and 6.0 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * TraceAbstraction took 12930.84 ms. Allocated memory was 11.5 GB in the beginning and 10.1 GB in the end (delta: -1.3 GB). Free memory was 6.0 GB in the beginning and 4.5 GB in the end (delta: 1.5 GB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. * Witness Printer took 122.64 ms. Allocated memory is still 10.1 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39960]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_stage2Separation = 1; [L6] int m_completion = 2; [L7] int m_tliBurn = 3; [L8] int m_loiBurn = 4; [L9] int m_stage1Separation = 5; [L10] int m_edsSeparation = 6; [L11] int m_lsamAscentRendezvous = 7; [L12] int m_smSeparation = 8; [L13] int m_eiBurn = 9; [L14] int m_lsamRendezvous = 10; [L15] int m_teiBurn = 11; [L16] int m_CEV = 12; [L17] int m_abort = 13; [L18] int m_enterOrbitOps = 14; [L19] int m_failure = 15; [L20] int m_lsamSeparation = 16; [L21] int m_abortPassiveLAScompletion = 17; [L22] int m_lasJettison = 18; [L23] int m_lsamAscentBurn = 19; [L24] int m_srbIgnition = 20; [L25] int m_deOrbit = 21; VAL [\old(m_abort)=9, \old(m_abortPassiveLAScompletion)=11, \old(m_CEV)=10, \old(m_completion)=2, \old(m_deOrbit)=3, \old(m_edsSeparation)=5, \old(m_eiBurn)=7, \old(m_enterOrbitOps)=15, \old(m_failure)=12, \old(m_lasJettison)=4, \old(m_loiBurn)=13, \old(m_lsamAscentBurn)=19, \old(m_lsamAscentRendezvous)=6, \old(m_lsamRendezvous)=14, \old(m_lsamSeparation)=17, \old(m_smSeparation)=8, \old(m_srbIgnition)=16, \old(m_stage1Separation)=21, \old(m_stage2Separation)=22, \old(m_teiBurn)=20, \old(m_tliBurn)=18, m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3] [L30] int q = 0; [L31] int method_id; [L34] int this_spacecraft_cLSAM_ASCENT = 0; [L35] int this_spacecraft_cEDS = 0; [L36] int this_spacecraft_cLSAM_DESCENT = 0; [L37] int this_spacecraft_cLAS = 1; [L38] int this_spacecraft_cStage1 = 1; [L39] int this_spacecraft_cStage2 = 1; [L40] int this_spacecraft_cCM = 1; [L41] int this_spacecraft_cSM = 1; VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND TRUE q == 0 [L56] COND TRUE __VERIFIER_nondet_int() [L58] COND TRUE 1 [L60] method_id = 12 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=0, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L62] COND FALSE !(0) [L66] q = 2 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=12, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND TRUE __VERIFIER_nondet_int() [L289] COND TRUE 1 [L291] method_id = 8 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=1, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L293] COND FALSE !(0) [L297] q = 2 [L299] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L299] this_spacecraft_cCM=this_spacecraft_cCM [L299] this_spacecraft_cSM=0 [L299] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L299] this_spacecraft_cEDS=this_spacecraft_cEDS [L299] this_spacecraft_cLAS=this_spacecraft_cLAS [L299] this_spacecraft_cStage2=this_spacecraft_cStage2 [L299] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=1, P3=0, P4=1, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=8, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND TRUE q == 2 [L175] COND FALSE !(__VERIFIER_nondet_int()) [L191] COND FALSE !(__VERIFIER_nondet_int()) [L207] COND FALSE !(__VERIFIER_nondet_int()) [L223] COND FALSE !(__VERIFIER_nondet_int()) [L239] COND FALSE !(__VERIFIER_nondet_int()) [L255] COND FALSE !(__VERIFIER_nondet_int()) [L271] COND FALSE !(__VERIFIER_nondet_int()) [L287] COND FALSE !(__VERIFIER_nondet_int()) [L303] COND FALSE !(__VERIFIER_nondet_int()) [L319] COND FALSE !(__VERIFIER_nondet_int()) [L335] COND FALSE !(__VERIFIER_nondet_int()) [L351] COND FALSE !(__VERIFIER_nondet_int()) [L367] COND FALSE !(__VERIFIER_nondet_int()) [L383] COND FALSE !(__VERIFIER_nondet_int()) [L399] COND FALSE !(__VERIFIER_nondet_int()) [L415] COND FALSE !(__VERIFIER_nondet_int()) [L431] COND FALSE !(__VERIFIER_nondet_int()) [L447] COND FALSE !(__VERIFIER_nondet_int()) [L463] COND FALSE !(__VERIFIER_nondet_int()) [L479] COND FALSE !(__VERIFIER_nondet_int()) [L495] COND FALSE !(__VERIFIER_nondet_int()) [L511] COND FALSE !(__VERIFIER_nondet_int()) [L527] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L559] COND FALSE !(__VERIFIER_nondet_int()) [L575] COND FALSE !(__VERIFIER_nondet_int()) [L591] COND FALSE !(__VERIFIER_nondet_int()) [L607] COND FALSE !(__VERIFIER_nondet_int()) [L623] COND FALSE !(__VERIFIER_nondet_int()) [L639] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND FALSE !(__VERIFIER_nondet_int()) [L671] COND FALSE !(__VERIFIER_nondet_int()) [L687] COND FALSE !(__VERIFIER_nondet_int()) [L703] COND FALSE !(__VERIFIER_nondet_int()) [L719] COND FALSE !(__VERIFIER_nondet_int()) [L735] COND FALSE !(__VERIFIER_nondet_int()) [L751] COND FALSE !(__VERIFIER_nondet_int()) [L767] COND FALSE !(__VERIFIER_nondet_int()) [L783] COND FALSE !(__VERIFIER_nondet_int()) [L799] COND FALSE !(__VERIFIER_nondet_int()) [L815] COND FALSE !(__VERIFIER_nondet_int()) [L831] COND FALSE !(__VERIFIER_nondet_int()) [L847] COND FALSE !(__VERIFIER_nondet_int()) [L863] COND FALSE !(__VERIFIER_nondet_int()) [L879] COND FALSE !(__VERIFIER_nondet_int()) [L895] COND FALSE !(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L927] COND FALSE !(__VERIFIER_nondet_int()) [L943] COND FALSE !(__VERIFIER_nondet_int()) [L959] COND FALSE !(__VERIFIER_nondet_int()) [L975] COND FALSE !(__VERIFIER_nondet_int()) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1007] COND FALSE !(__VERIFIER_nondet_int()) [L1023] COND FALSE !(__VERIFIER_nondet_int()) [L1039] COND FALSE !(__VERIFIER_nondet_int()) [L1055] COND FALSE !(__VERIFIER_nondet_int()) [L1071] COND FALSE !(__VERIFIER_nondet_int()) [L1087] COND FALSE !(__VERIFIER_nondet_int()) [L1103] COND FALSE !(__VERIFIER_nondet_int()) [L1119] COND FALSE !(__VERIFIER_nondet_int()) [L1135] COND FALSE !(__VERIFIER_nondet_int()) [L1151] COND FALSE !(__VERIFIER_nondet_int()) [L1167] COND FALSE !(__VERIFIER_nondet_int()) [L1183] COND FALSE !(__VERIFIER_nondet_int()) [L1199] COND FALSE !(__VERIFIER_nondet_int()) [L1215] COND FALSE !(__VERIFIER_nondet_int()) [L1231] COND FALSE !(__VERIFIER_nondet_int()) [L1247] COND FALSE !(__VERIFIER_nondet_int()) [L1263] COND FALSE !(__VERIFIER_nondet_int()) [L1279] COND FALSE !(__VERIFIER_nondet_int()) [L1295] COND FALSE !(__VERIFIER_nondet_int()) [L1311] COND FALSE !(__VERIFIER_nondet_int()) [L1327] COND FALSE !(__VERIFIER_nondet_int()) [L1343] COND FALSE !(__VERIFIER_nondet_int()) [L1359] COND FALSE !(__VERIFIER_nondet_int()) [L1375] COND FALSE !(__VERIFIER_nondet_int()) [L1391] COND FALSE !(__VERIFIER_nondet_int()) [L1407] COND FALSE !(__VERIFIER_nondet_int()) [L1423] COND FALSE !(__VERIFIER_nondet_int()) [L1439] COND FALSE !(__VERIFIER_nondet_int()) [L1455] COND FALSE !(__VERIFIER_nondet_int()) [L1471] COND FALSE !(__VERIFIER_nondet_int()) [L1487] COND FALSE !(__VERIFIER_nondet_int()) [L1503] COND FALSE !(__VERIFIER_nondet_int()) [L1519] COND FALSE !(__VERIFIER_nondet_int()) [L1535] COND FALSE !(__VERIFIER_nondet_int()) [L1551] COND FALSE !(__VERIFIER_nondet_int()) [L1567] COND FALSE !(__VERIFIER_nondet_int()) [L1583] COND FALSE !(__VERIFIER_nondet_int()) [L1599] COND FALSE !(__VERIFIER_nondet_int()) [L1615] COND FALSE !(__VERIFIER_nondet_int()) [L1631] COND FALSE !(__VERIFIER_nondet_int()) [L1647] COND FALSE !(__VERIFIER_nondet_int()) [L1663] COND FALSE !(__VERIFIER_nondet_int()) [L1679] COND FALSE !(__VERIFIER_nondet_int()) [L1695] COND FALSE !(__VERIFIER_nondet_int()) [L1711] COND FALSE !(__VERIFIER_nondet_int()) [L1727] COND FALSE !(__VERIFIER_nondet_int()) [L1743] COND FALSE !(__VERIFIER_nondet_int()) [L1759] COND FALSE !(__VERIFIER_nondet_int()) [L1775] COND FALSE !(__VERIFIER_nondet_int()) [L1791] COND FALSE !(__VERIFIER_nondet_int()) [L1807] COND FALSE !(__VERIFIER_nondet_int()) [L1823] COND FALSE !(__VERIFIER_nondet_int()) [L1839] COND FALSE !(__VERIFIER_nondet_int()) [L1855] COND FALSE !(__VERIFIER_nondet_int()) [L1871] COND FALSE !(__VERIFIER_nondet_int()) [L1887] COND FALSE !(__VERIFIER_nondet_int()) [L1903] COND FALSE !(__VERIFIER_nondet_int()) [L1919] COND FALSE !(__VERIFIER_nondet_int()) [L1935] COND FALSE !(__VERIFIER_nondet_int()) [L1951] COND FALSE !(__VERIFIER_nondet_int()) [L1967] COND FALSE !(__VERIFIER_nondet_int()) [L1983] COND FALSE !(__VERIFIER_nondet_int()) [L1999] COND FALSE !(__VERIFIER_nondet_int()) [L2015] COND FALSE !(__VERIFIER_nondet_int()) [L2031] COND FALSE !(__VERIFIER_nondet_int()) [L2047] COND FALSE !(__VERIFIER_nondet_int()) [L2063] COND FALSE !(__VERIFIER_nondet_int()) [L2079] COND FALSE !(__VERIFIER_nondet_int()) [L2095] COND FALSE !(__VERIFIER_nondet_int()) [L2111] COND FALSE !(__VERIFIER_nondet_int()) [L2127] COND FALSE !(__VERIFIER_nondet_int()) [L2143] COND FALSE !(__VERIFIER_nondet_int()) [L2159] COND FALSE !(__VERIFIER_nondet_int()) [L2175] COND FALSE !(__VERIFIER_nondet_int()) [L2191] COND FALSE !(__VERIFIER_nondet_int()) [L2207] COND FALSE !(__VERIFIER_nondet_int()) [L2223] COND FALSE !(__VERIFIER_nondet_int()) [L2239] COND FALSE !(__VERIFIER_nondet_int()) [L2255] COND FALSE !(__VERIFIER_nondet_int()) [L2271] COND FALSE !(__VERIFIER_nondet_int()) [L2287] COND FALSE !(__VERIFIER_nondet_int()) [L2303] COND FALSE !(__VERIFIER_nondet_int()) [L2319] COND FALSE !(__VERIFIER_nondet_int()) [L2335] COND FALSE !(__VERIFIER_nondet_int()) [L2351] COND FALSE !(__VERIFIER_nondet_int()) [L2367] COND FALSE !(__VERIFIER_nondet_int()) [L2383] COND FALSE !(__VERIFIER_nondet_int()) [L2399] COND FALSE !(__VERIFIER_nondet_int()) [L2415] COND FALSE !(__VERIFIER_nondet_int()) [L2431] COND FALSE !(__VERIFIER_nondet_int()) [L2447] COND FALSE !(__VERIFIER_nondet_int()) [L2463] COND FALSE !(__VERIFIER_nondet_int()) [L2479] COND FALSE !(__VERIFIER_nondet_int()) [L2495] COND FALSE !(__VERIFIER_nondet_int()) [L2511] COND FALSE !(__VERIFIER_nondet_int()) [L2527] COND FALSE !(__VERIFIER_nondet_int()) [L2543] COND FALSE !(__VERIFIER_nondet_int()) [L2559] COND FALSE !(__VERIFIER_nondet_int()) [L2575] COND FALSE !(__VERIFIER_nondet_int()) [L2591] COND FALSE !(__VERIFIER_nondet_int()) [L2607] COND FALSE !(__VERIFIER_nondet_int()) [L2623] COND FALSE !(__VERIFIER_nondet_int()) [L2639] COND FALSE !(__VERIFIER_nondet_int()) [L2655] COND FALSE !(__VERIFIER_nondet_int()) [L2671] COND FALSE !(__VERIFIER_nondet_int()) [L2687] COND FALSE !(__VERIFIER_nondet_int()) [L2703] COND FALSE !(__VERIFIER_nondet_int()) [L2719] COND FALSE !(__VERIFIER_nondet_int()) [L2735] COND FALSE !(__VERIFIER_nondet_int()) [L2751] COND FALSE !(__VERIFIER_nondet_int()) [L2767] COND FALSE !(__VERIFIER_nondet_int()) [L2783] COND FALSE !(__VERIFIER_nondet_int()) [L2799] COND FALSE !(__VERIFIER_nondet_int()) [L2815] COND FALSE !(__VERIFIER_nondet_int()) [L2831] COND FALSE !(__VERIFIER_nondet_int()) [L2847] COND FALSE !(__VERIFIER_nondet_int()) [L2863] COND FALSE !(__VERIFIER_nondet_int()) [L2879] COND FALSE !(__VERIFIER_nondet_int()) [L2895] COND FALSE !(__VERIFIER_nondet_int()) [L2911] COND FALSE !(__VERIFIER_nondet_int()) [L2927] COND FALSE !(__VERIFIER_nondet_int()) [L2943] COND FALSE !(__VERIFIER_nondet_int()) [L2959] COND FALSE !(__VERIFIER_nondet_int()) [L2975] COND FALSE !(__VERIFIER_nondet_int()) [L2991] COND FALSE !(__VERIFIER_nondet_int()) [L3007] COND FALSE !(__VERIFIER_nondet_int()) [L3023] COND FALSE !(__VERIFIER_nondet_int()) [L3039] COND FALSE !(__VERIFIER_nondet_int()) [L3055] COND FALSE !(__VERIFIER_nondet_int()) [L3071] COND FALSE !(__VERIFIER_nondet_int()) [L3087] COND FALSE !(__VERIFIER_nondet_int()) [L3103] COND FALSE !(__VERIFIER_nondet_int()) [L3119] COND FALSE !(__VERIFIER_nondet_int()) [L3135] COND FALSE !(__VERIFIER_nondet_int()) [L3151] COND FALSE !(__VERIFIER_nondet_int()) [L3167] COND FALSE !(__VERIFIER_nondet_int()) [L3183] COND FALSE !(__VERIFIER_nondet_int()) [L3199] COND FALSE !(__VERIFIER_nondet_int()) [L3215] COND FALSE !(__VERIFIER_nondet_int()) [L3231] COND FALSE !(__VERIFIER_nondet_int()) [L3247] COND FALSE !(__VERIFIER_nondet_int()) [L3263] COND FALSE !(__VERIFIER_nondet_int()) [L3279] COND FALSE !(__VERIFIER_nondet_int()) [L3295] COND FALSE !(__VERIFIER_nondet_int()) [L3311] COND FALSE !(__VERIFIER_nondet_int()) [L3327] COND FALSE !(__VERIFIER_nondet_int()) [L3343] COND FALSE !(__VERIFIER_nondet_int()) [L3359] COND FALSE !(__VERIFIER_nondet_int()) [L3375] COND FALSE !(__VERIFIER_nondet_int()) [L3391] COND FALSE !(__VERIFIER_nondet_int()) [L3407] COND FALSE !(__VERIFIER_nondet_int()) [L3423] COND FALSE !(__VERIFIER_nondet_int()) [L3439] COND FALSE !(__VERIFIER_nondet_int()) [L3455] COND FALSE !(__VERIFIER_nondet_int()) [L3471] COND FALSE !(__VERIFIER_nondet_int()) [L3487] COND FALSE !(__VERIFIER_nondet_int()) [L3503] COND FALSE !(__VERIFIER_nondet_int()) [L3519] COND FALSE !(__VERIFIER_nondet_int()) [L3535] COND FALSE !(__VERIFIER_nondet_int()) [L3551] COND FALSE !(__VERIFIER_nondet_int()) [L3567] COND FALSE !(__VERIFIER_nondet_int()) [L3583] COND FALSE !(__VERIFIER_nondet_int()) [L3599] COND FALSE !(__VERIFIER_nondet_int()) [L3615] COND FALSE !(__VERIFIER_nondet_int()) [L3631] COND FALSE !(__VERIFIER_nondet_int()) [L3647] COND FALSE !(__VERIFIER_nondet_int()) [L3663] COND FALSE !(__VERIFIER_nondet_int()) [L3679] COND FALSE !(__VERIFIER_nondet_int()) [L3695] COND FALSE !(__VERIFIER_nondet_int()) [L3711] COND FALSE !(__VERIFIER_nondet_int()) [L3727] COND FALSE !(__VERIFIER_nondet_int()) [L3743] COND FALSE !(__VERIFIER_nondet_int()) [L3759] COND FALSE !(__VERIFIER_nondet_int()) [L3775] COND FALSE !(__VERIFIER_nondet_int()) [L3791] COND FALSE !(__VERIFIER_nondet_int()) [L3807] COND FALSE !(__VERIFIER_nondet_int()) [L3823] COND FALSE !(__VERIFIER_nondet_int()) [L3839] COND FALSE !(__VERIFIER_nondet_int()) [L3855] COND FALSE !(__VERIFIER_nondet_int()) [L3871] COND FALSE !(__VERIFIER_nondet_int()) [L3887] COND FALSE !(__VERIFIER_nondet_int()) [L3903] COND FALSE !(__VERIFIER_nondet_int()) [L3919] COND FALSE !(__VERIFIER_nondet_int()) [L3935] COND FALSE !(__VERIFIER_nondet_int()) [L3951] COND FALSE !(__VERIFIER_nondet_int()) [L3967] COND FALSE !(__VERIFIER_nondet_int()) [L3983] COND FALSE !(__VERIFIER_nondet_int()) [L3999] COND FALSE !(__VERIFIER_nondet_int()) [L4015] COND FALSE !(__VERIFIER_nondet_int()) [L4031] COND FALSE !(__VERIFIER_nondet_int()) [L4047] COND FALSE !(__VERIFIER_nondet_int()) [L4063] COND FALSE !(__VERIFIER_nondet_int()) [L4079] COND FALSE !(__VERIFIER_nondet_int()) [L4095] COND FALSE !(__VERIFIER_nondet_int()) [L4111] COND FALSE !(__VERIFIER_nondet_int()) [L4127] COND FALSE !(__VERIFIER_nondet_int()) [L4143] COND FALSE !(__VERIFIER_nondet_int()) [L4159] COND FALSE !(__VERIFIER_nondet_int()) [L4175] COND FALSE !(__VERIFIER_nondet_int()) [L4191] COND FALSE !(__VERIFIER_nondet_int()) [L4207] COND FALSE !(__VERIFIER_nondet_int()) [L4223] COND FALSE !(__VERIFIER_nondet_int()) [L4239] COND FALSE !(__VERIFIER_nondet_int()) [L4255] COND FALSE !(__VERIFIER_nondet_int()) [L4271] COND FALSE !(__VERIFIER_nondet_int()) [L4287] COND FALSE !(__VERIFIER_nondet_int()) [L4303] COND FALSE !(__VERIFIER_nondet_int()) [L4319] COND FALSE !(__VERIFIER_nondet_int()) [L4335] COND FALSE !(__VERIFIER_nondet_int()) [L4351] COND FALSE !(__VERIFIER_nondet_int()) [L4367] COND FALSE !(__VERIFIER_nondet_int()) [L4383] COND FALSE !(__VERIFIER_nondet_int()) [L4399] COND FALSE !(__VERIFIER_nondet_int()) [L4415] COND FALSE !(__VERIFIER_nondet_int()) [L4431] COND FALSE !(__VERIFIER_nondet_int()) [L4447] COND FALSE !(__VERIFIER_nondet_int()) [L4463] COND FALSE !(__VERIFIER_nondet_int()) [L4479] COND FALSE !(__VERIFIER_nondet_int()) [L4495] COND FALSE !(__VERIFIER_nondet_int()) [L4511] COND FALSE !(__VERIFIER_nondet_int()) [L4527] COND TRUE __VERIFIER_nondet_int() [L4529] COND TRUE 1 [L4531] method_id = 18 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=0, P5=0, q=2, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=1, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4533] COND FALSE !(0) [L4537] q = 4 [L4539] this_spacecraft_cLSAM_ASCENT=this_spacecraft_cLSAM_ASCENT [L4539] this_spacecraft_cCM=this_spacecraft_cCM [L4539] this_spacecraft_cSM=this_spacecraft_cSM [L4539] this_spacecraft_cLSAM_DESCENT=this_spacecraft_cLSAM_DESCENT [L4539] this_spacecraft_cEDS=this_spacecraft_cEDS [L4539] this_spacecraft_cLAS=0 [L4539] this_spacecraft_cStage2=this_spacecraft_cStage2 [L4539] this_spacecraft_cStage1=this_spacecraft_cStage1 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=0, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L44] COND TRUE 1 [L47] _Bool P1=__VERIFIER_nondet_int(); [L48] _Bool P2=__VERIFIER_nondet_int(); [L49] int P3=__VERIFIER_nondet_int(); [L50] _Bool P4=__VERIFIER_nondet_int(); [L51] int P5=__VERIFIER_nondet_int(); [L55] COND FALSE !(q == 0) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L74] COND FALSE !(q == 1) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L174] COND FALSE !(q == 2) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L4594] COND FALSE !(q == 3) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=18, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L9014] COND TRUE q == 4 [L9015] COND FALSE !(__VERIFIER_nondet_int()) [L9031] COND FALSE !(__VERIFIER_nondet_int()) [L9047] COND FALSE !(__VERIFIER_nondet_int()) [L9063] COND FALSE !(__VERIFIER_nondet_int()) [L9079] COND FALSE !(__VERIFIER_nondet_int()) [L9095] COND FALSE !(__VERIFIER_nondet_int()) [L9111] COND FALSE !(__VERIFIER_nondet_int()) [L9127] COND FALSE !(__VERIFIER_nondet_int()) [L9143] COND FALSE !(__VERIFIER_nondet_int()) [L9159] COND FALSE !(__VERIFIER_nondet_int()) [L9175] COND FALSE !(__VERIFIER_nondet_int()) [L9191] COND FALSE !(__VERIFIER_nondet_int()) [L9207] COND FALSE !(__VERIFIER_nondet_int()) [L9223] COND FALSE !(__VERIFIER_nondet_int()) [L9239] COND FALSE !(__VERIFIER_nondet_int()) [L9255] COND FALSE !(__VERIFIER_nondet_int()) [L9271] COND FALSE !(__VERIFIER_nondet_int()) [L9287] COND FALSE !(__VERIFIER_nondet_int()) [L9303] COND FALSE !(__VERIFIER_nondet_int()) [L9319] COND FALSE !(__VERIFIER_nondet_int()) [L9335] COND FALSE !(__VERIFIER_nondet_int()) [L9351] COND FALSE !(__VERIFIER_nondet_int()) [L9367] COND FALSE !(__VERIFIER_nondet_int()) [L9383] COND FALSE !(__VERIFIER_nondet_int()) [L9399] COND FALSE !(__VERIFIER_nondet_int()) [L9415] COND FALSE !(__VERIFIER_nondet_int()) [L9431] COND FALSE !(__VERIFIER_nondet_int()) [L9447] COND FALSE !(__VERIFIER_nondet_int()) [L9463] COND FALSE !(__VERIFIER_nondet_int()) [L9479] COND FALSE !(__VERIFIER_nondet_int()) [L9495] COND FALSE !(__VERIFIER_nondet_int()) [L9511] COND FALSE !(__VERIFIER_nondet_int()) [L9527] COND FALSE !(__VERIFIER_nondet_int()) [L9543] COND FALSE !(__VERIFIER_nondet_int()) [L9559] COND FALSE !(__VERIFIER_nondet_int()) [L9575] COND FALSE !(__VERIFIER_nondet_int()) [L9591] COND FALSE !(__VERIFIER_nondet_int()) [L9607] COND FALSE !(__VERIFIER_nondet_int()) [L9623] COND FALSE !(__VERIFIER_nondet_int()) [L9639] COND FALSE !(__VERIFIER_nondet_int()) [L9655] COND FALSE !(__VERIFIER_nondet_int()) [L9671] COND FALSE !(__VERIFIER_nondet_int()) [L9687] COND FALSE !(__VERIFIER_nondet_int()) [L9703] COND FALSE !(__VERIFIER_nondet_int()) [L9719] COND FALSE !(__VERIFIER_nondet_int()) [L9735] COND FALSE !(__VERIFIER_nondet_int()) [L9751] COND FALSE !(__VERIFIER_nondet_int()) [L9767] COND FALSE !(__VERIFIER_nondet_int()) [L9783] COND FALSE !(__VERIFIER_nondet_int()) [L9799] COND FALSE !(__VERIFIER_nondet_int()) [L9815] COND FALSE !(__VERIFIER_nondet_int()) [L9831] COND FALSE !(__VERIFIER_nondet_int()) [L9847] COND FALSE !(__VERIFIER_nondet_int()) [L9863] COND FALSE !(__VERIFIER_nondet_int()) [L9879] COND FALSE !(__VERIFIER_nondet_int()) [L9895] COND FALSE !(__VERIFIER_nondet_int()) [L9911] COND FALSE !(__VERIFIER_nondet_int()) [L9927] COND FALSE !(__VERIFIER_nondet_int()) [L9943] COND FALSE !(__VERIFIER_nondet_int()) [L9959] COND FALSE !(__VERIFIER_nondet_int()) [L9975] COND FALSE !(__VERIFIER_nondet_int()) [L9991] COND FALSE !(__VERIFIER_nondet_int()) [L10007] COND FALSE !(__VERIFIER_nondet_int()) [L10023] COND FALSE !(__VERIFIER_nondet_int()) [L10039] COND FALSE !(__VERIFIER_nondet_int()) [L10055] COND FALSE !(__VERIFIER_nondet_int()) [L10071] COND FALSE !(__VERIFIER_nondet_int()) [L10087] COND FALSE !(__VERIFIER_nondet_int()) [L10103] COND FALSE !(__VERIFIER_nondet_int()) [L10119] COND FALSE !(__VERIFIER_nondet_int()) [L10135] COND FALSE !(__VERIFIER_nondet_int()) [L10151] COND FALSE !(__VERIFIER_nondet_int()) [L10167] COND FALSE !(__VERIFIER_nondet_int()) [L10183] COND FALSE !(__VERIFIER_nondet_int()) [L10199] COND FALSE !(__VERIFIER_nondet_int()) [L10215] COND FALSE !(__VERIFIER_nondet_int()) [L10231] COND FALSE !(__VERIFIER_nondet_int()) [L10247] COND FALSE !(__VERIFIER_nondet_int()) [L10263] COND FALSE !(__VERIFIER_nondet_int()) [L10279] COND FALSE !(__VERIFIER_nondet_int()) [L10295] COND FALSE !(__VERIFIER_nondet_int()) [L10311] COND FALSE !(__VERIFIER_nondet_int()) [L10327] COND FALSE !(__VERIFIER_nondet_int()) [L10343] COND FALSE !(__VERIFIER_nondet_int()) [L10359] COND FALSE !(__VERIFIER_nondet_int()) [L10375] COND FALSE !(__VERIFIER_nondet_int()) [L10391] COND FALSE !(__VERIFIER_nondet_int()) [L10407] COND FALSE !(__VERIFIER_nondet_int()) [L10423] COND FALSE !(__VERIFIER_nondet_int()) [L10439] COND FALSE !(__VERIFIER_nondet_int()) [L10455] COND FALSE !(__VERIFIER_nondet_int()) [L10471] COND FALSE !(__VERIFIER_nondet_int()) [L10487] COND FALSE !(__VERIFIER_nondet_int()) [L10503] COND FALSE !(__VERIFIER_nondet_int()) [L10519] COND FALSE !(__VERIFIER_nondet_int()) [L10535] COND FALSE !(__VERIFIER_nondet_int()) [L10551] COND FALSE !(__VERIFIER_nondet_int()) [L10567] COND FALSE !(__VERIFIER_nondet_int()) [L10583] COND FALSE !(__VERIFIER_nondet_int()) [L10599] COND FALSE !(__VERIFIER_nondet_int()) [L10615] COND FALSE !(__VERIFIER_nondet_int()) [L10631] COND FALSE !(__VERIFIER_nondet_int()) [L10647] COND FALSE !(__VERIFIER_nondet_int()) [L10663] COND FALSE !(__VERIFIER_nondet_int()) [L10679] COND FALSE !(__VERIFIER_nondet_int()) [L10695] COND FALSE !(__VERIFIER_nondet_int()) [L10711] COND FALSE !(__VERIFIER_nondet_int()) [L10727] COND FALSE !(__VERIFIER_nondet_int()) [L10743] COND FALSE !(__VERIFIER_nondet_int()) [L10759] COND FALSE !(__VERIFIER_nondet_int()) [L10775] COND FALSE !(__VERIFIER_nondet_int()) [L10791] COND FALSE !(__VERIFIER_nondet_int()) [L10807] COND FALSE !(__VERIFIER_nondet_int()) [L10823] COND FALSE !(__VERIFIER_nondet_int()) [L10839] COND FALSE !(__VERIFIER_nondet_int()) [L10855] COND FALSE !(__VERIFIER_nondet_int()) [L10871] COND FALSE !(__VERIFIER_nondet_int()) [L10887] COND FALSE !(__VERIFIER_nondet_int()) [L10903] COND FALSE !(__VERIFIER_nondet_int()) [L10919] COND FALSE !(__VERIFIER_nondet_int()) [L10935] COND FALSE !(__VERIFIER_nondet_int()) [L10951] COND FALSE !(__VERIFIER_nondet_int()) [L10967] COND FALSE !(__VERIFIER_nondet_int()) [L10983] COND FALSE !(__VERIFIER_nondet_int()) [L10999] COND FALSE !(__VERIFIER_nondet_int()) [L11015] COND FALSE !(__VERIFIER_nondet_int()) [L11031] COND FALSE !(__VERIFIER_nondet_int()) [L11047] COND FALSE !(__VERIFIER_nondet_int()) [L11063] COND FALSE !(__VERIFIER_nondet_int()) [L11079] COND FALSE !(__VERIFIER_nondet_int()) [L11095] COND FALSE !(__VERIFIER_nondet_int()) [L11111] COND FALSE !(__VERIFIER_nondet_int()) [L11127] COND FALSE !(__VERIFIER_nondet_int()) [L11143] COND FALSE !(__VERIFIER_nondet_int()) [L11159] COND FALSE !(__VERIFIER_nondet_int()) [L11175] COND FALSE !(__VERIFIER_nondet_int()) [L11191] COND FALSE !(__VERIFIER_nondet_int()) [L11207] COND FALSE !(__VERIFIER_nondet_int()) [L11223] COND FALSE !(__VERIFIER_nondet_int()) [L11239] COND FALSE !(__VERIFIER_nondet_int()) [L11255] COND FALSE !(__VERIFIER_nondet_int()) [L11271] COND FALSE !(__VERIFIER_nondet_int()) [L11287] COND FALSE !(__VERIFIER_nondet_int()) [L11303] COND FALSE !(__VERIFIER_nondet_int()) [L11319] COND FALSE !(__VERIFIER_nondet_int()) [L11335] COND FALSE !(__VERIFIER_nondet_int()) [L11351] COND FALSE !(__VERIFIER_nondet_int()) [L11367] COND FALSE !(__VERIFIER_nondet_int()) [L11383] COND FALSE !(__VERIFIER_nondet_int()) [L11399] COND FALSE !(__VERIFIER_nondet_int()) [L11415] COND FALSE !(__VERIFIER_nondet_int()) [L11431] COND FALSE !(__VERIFIER_nondet_int()) [L11447] COND FALSE !(__VERIFIER_nondet_int()) [L11463] COND FALSE !(__VERIFIER_nondet_int()) [L11479] COND FALSE !(__VERIFIER_nondet_int()) [L11495] COND FALSE !(__VERIFIER_nondet_int()) [L11511] COND FALSE !(__VERIFIER_nondet_int()) [L11527] COND FALSE !(__VERIFIER_nondet_int()) [L11543] COND FALSE !(__VERIFIER_nondet_int()) [L11559] COND FALSE !(__VERIFIER_nondet_int()) [L11575] COND FALSE !(__VERIFIER_nondet_int()) [L11591] COND FALSE !(__VERIFIER_nondet_int()) [L11607] COND FALSE !(__VERIFIER_nondet_int()) [L11623] COND FALSE !(__VERIFIER_nondet_int()) [L11639] COND FALSE !(__VERIFIER_nondet_int()) [L11655] COND FALSE !(__VERIFIER_nondet_int()) [L11671] COND FALSE !(__VERIFIER_nondet_int()) [L11687] COND FALSE !(__VERIFIER_nondet_int()) [L11703] COND FALSE !(__VERIFIER_nondet_int()) [L11719] COND FALSE !(__VERIFIER_nondet_int()) [L11735] COND FALSE !(__VERIFIER_nondet_int()) [L11751] COND FALSE !(__VERIFIER_nondet_int()) [L11767] COND FALSE !(__VERIFIER_nondet_int()) [L11783] COND FALSE !(__VERIFIER_nondet_int()) [L11799] COND FALSE !(__VERIFIER_nondet_int()) [L11815] COND FALSE !(__VERIFIER_nondet_int()) [L11831] COND FALSE !(__VERIFIER_nondet_int()) [L11847] COND FALSE !(__VERIFIER_nondet_int()) [L11863] COND FALSE !(__VERIFIER_nondet_int()) [L11879] COND FALSE !(__VERIFIER_nondet_int()) [L11895] COND FALSE !(__VERIFIER_nondet_int()) [L11911] COND FALSE !(__VERIFIER_nondet_int()) [L11927] COND FALSE !(__VERIFIER_nondet_int()) [L11943] COND FALSE !(__VERIFIER_nondet_int()) [L11959] COND FALSE !(__VERIFIER_nondet_int()) [L11975] COND FALSE !(__VERIFIER_nondet_int()) [L11991] COND FALSE !(__VERIFIER_nondet_int()) [L12007] COND FALSE !(__VERIFIER_nondet_int()) [L12023] COND FALSE !(__VERIFIER_nondet_int()) [L12039] COND FALSE !(__VERIFIER_nondet_int()) [L12055] COND FALSE !(__VERIFIER_nondet_int()) [L12071] COND FALSE !(__VERIFIER_nondet_int()) [L12087] COND FALSE !(__VERIFIER_nondet_int()) [L12103] COND FALSE !(__VERIFIER_nondet_int()) [L12119] COND FALSE !(__VERIFIER_nondet_int()) [L12135] COND FALSE !(__VERIFIER_nondet_int()) [L12151] COND FALSE !(__VERIFIER_nondet_int()) [L12167] COND FALSE !(__VERIFIER_nondet_int()) [L12183] COND FALSE !(__VERIFIER_nondet_int()) [L12199] COND FALSE !(__VERIFIER_nondet_int()) [L12215] COND FALSE !(__VERIFIER_nondet_int()) [L12231] COND FALSE !(__VERIFIER_nondet_int()) [L12247] COND FALSE !(__VERIFIER_nondet_int()) [L12263] COND FALSE !(__VERIFIER_nondet_int()) [L12279] COND FALSE !(__VERIFIER_nondet_int()) [L12295] COND FALSE !(__VERIFIER_nondet_int()) [L12311] COND FALSE !(__VERIFIER_nondet_int()) [L12327] COND FALSE !(__VERIFIER_nondet_int()) [L12343] COND FALSE !(__VERIFIER_nondet_int()) [L12359] COND FALSE !(__VERIFIER_nondet_int()) [L12375] COND FALSE !(__VERIFIER_nondet_int()) [L12391] COND FALSE !(__VERIFIER_nondet_int()) [L12407] COND FALSE !(__VERIFIER_nondet_int()) [L12423] COND FALSE !(__VERIFIER_nondet_int()) [L12439] COND FALSE !(__VERIFIER_nondet_int()) [L12455] COND FALSE !(__VERIFIER_nondet_int()) [L12471] COND FALSE !(__VERIFIER_nondet_int()) [L12487] COND FALSE !(__VERIFIER_nondet_int()) [L12503] COND FALSE !(__VERIFIER_nondet_int()) [L12519] COND FALSE !(__VERIFIER_nondet_int()) [L12535] COND FALSE !(__VERIFIER_nondet_int()) [L12551] COND FALSE !(__VERIFIER_nondet_int()) [L12567] COND FALSE !(__VERIFIER_nondet_int()) [L12583] COND FALSE !(__VERIFIER_nondet_int()) [L12599] COND FALSE !(__VERIFIER_nondet_int()) [L12615] COND FALSE !(__VERIFIER_nondet_int()) [L12631] COND FALSE !(__VERIFIER_nondet_int()) [L12647] COND FALSE !(__VERIFIER_nondet_int()) [L12663] COND FALSE !(__VERIFIER_nondet_int()) [L12679] COND FALSE !(__VERIFIER_nondet_int()) [L12695] COND FALSE !(__VERIFIER_nondet_int()) [L12711] COND FALSE !(__VERIFIER_nondet_int()) [L12727] COND FALSE !(__VERIFIER_nondet_int()) [L12743] COND FALSE !(__VERIFIER_nondet_int()) [L12759] COND FALSE !(__VERIFIER_nondet_int()) [L12775] COND FALSE !(__VERIFIER_nondet_int()) [L12791] COND FALSE !(__VERIFIER_nondet_int()) [L12807] COND FALSE !(__VERIFIER_nondet_int()) [L12823] COND FALSE !(__VERIFIER_nondet_int()) [L12839] COND FALSE !(__VERIFIER_nondet_int()) [L12855] COND FALSE !(__VERIFIER_nondet_int()) [L12871] COND FALSE !(__VERIFIER_nondet_int()) [L12887] COND FALSE !(__VERIFIER_nondet_int()) [L12903] COND FALSE !(__VERIFIER_nondet_int()) [L12919] COND FALSE !(__VERIFIER_nondet_int()) [L12935] COND FALSE !(__VERIFIER_nondet_int()) [L12951] COND FALSE !(__VERIFIER_nondet_int()) [L12967] COND FALSE !(__VERIFIER_nondet_int()) [L12983] COND FALSE !(__VERIFIER_nondet_int()) [L12999] COND FALSE !(__VERIFIER_nondet_int()) [L13015] COND FALSE !(__VERIFIER_nondet_int()) [L13031] COND FALSE !(__VERIFIER_nondet_int()) [L13047] COND FALSE !(__VERIFIER_nondet_int()) [L13063] COND FALSE !(__VERIFIER_nondet_int()) [L13079] COND FALSE !(__VERIFIER_nondet_int()) [L13095] COND FALSE !(__VERIFIER_nondet_int()) [L13111] COND FALSE !(__VERIFIER_nondet_int()) [L13127] COND FALSE !(__VERIFIER_nondet_int()) [L13143] COND FALSE !(__VERIFIER_nondet_int()) [L13159] COND FALSE !(__VERIFIER_nondet_int()) [L13175] COND FALSE !(__VERIFIER_nondet_int()) [L13191] COND FALSE !(__VERIFIER_nondet_int()) [L13207] COND FALSE !(__VERIFIER_nondet_int()) [L13223] COND FALSE !(__VERIFIER_nondet_int()) [L13239] COND FALSE !(__VERIFIER_nondet_int()) [L13255] COND FALSE !(__VERIFIER_nondet_int()) [L13271] COND FALSE !(__VERIFIER_nondet_int()) [L13287] COND FALSE !(__VERIFIER_nondet_int()) [L13303] COND FALSE !(__VERIFIER_nondet_int()) [L13319] COND FALSE !(__VERIFIER_nondet_int()) [L13335] COND FALSE !(__VERIFIER_nondet_int()) [L13351] COND FALSE !(__VERIFIER_nondet_int()) [L13367] COND FALSE !(__VERIFIER_nondet_int()) [L13383] COND FALSE !(__VERIFIER_nondet_int()) [L13399] COND FALSE !(__VERIFIER_nondet_int()) [L13415] COND TRUE __VERIFIER_nondet_int() [L13417] COND TRUE 1 [L13419] method_id = 21 VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L13421] COND TRUE (!this_spacecraft_cEDS && (!this_spacecraft_cLSAM_ASCENT && (!this_spacecraft_cSM && !this_spacecraft_cLAS))) VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] [L39960] __VERIFIER_error() VAL [m_abort=13, m_abortPassiveLAScompletion=17, m_CEV=12, m_completion=2, m_deOrbit=21, m_edsSeparation=6, m_eiBurn=9, m_enterOrbitOps=14, m_failure=15, m_lasJettison=18, m_loiBurn=4, m_lsamAscentBurn=19, m_lsamAscentRendezvous=7, m_lsamRendezvous=10, m_lsamSeparation=16, m_smSeparation=8, m_srbIgnition=20, m_stage1Separation=5, m_stage2Separation=1, m_teiBurn=11, m_tliBurn=3, method_id=21, P1=1, P2=0, P3=0, P4=1, P5=0, q=4, this_spacecraft_cCM=1, this_spacecraft_cEDS=0, this_spacecraft_cLAS=0, this_spacecraft_cLSAM_ASCENT=0, this_spacecraft_cLSAM_DESCENT=0, this_spacecraft_cSM=0, this_spacecraft_cStage1=1, this_spacecraft_cStage2=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 7499 locations, 1 error locations. UNSAFE Result, 12.8s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 151654 SDtfs, 62164 SDslu, 110918 SDs, 0 SdLazy, 3248 SolverSat, 1202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33822occurred in iteration=19, 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: 2.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 448 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 5237 NumberOfCodeBlocks, 5237 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4628 ConstructedInterpolants, 0 QuantifiedInterpolants, 6037119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 267/267 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...