java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:08:05,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:08:05,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:08:06,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:08:06,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:08:06,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:08:06,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:08:06,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:08:06,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:08:06,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:08:06,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:08:06,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:08:06,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:08:06,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:08:06,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:08:06,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:08:06,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:08:06,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:08:06,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:08:06,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:08:06,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:08:06,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:08:06,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:08:06,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:08:06,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:08:06,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:08:06,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:08:06,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:08:06,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:08:06,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:08:06,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:08:06,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:08:06,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:08:06,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:08:06,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:08:06,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:08:06,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:08:06,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:08:06,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:08:06,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:08:06,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:08:06,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:08:06,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:08:06,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:08:06,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:08:06,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:08:06,062 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:08:06,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:08:06,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:08:06,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:08:06,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:08:06,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:08:06,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:08:06,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:08:06,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:08:06,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:08:06,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:08:06,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:08:06,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:08:06,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:08:06,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:08:06,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:08:06,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:08:06,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:08:06,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:08:06,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:08:06,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:08:06,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:08:06,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:08:06,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:08:06,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:08:06,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:08:06,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:08:06,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:08:06,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:08:06,392 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:08:06,393 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-15 01:08:06,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f65562a/d1ba8421da9a487b847988e1488c91ad/FLAG3aa551f5c [2019-10-15 01:08:07,006 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:08:07,010 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-15 01:08:07,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f65562a/d1ba8421da9a487b847988e1488c91ad/FLAG3aa551f5c [2019-10-15 01:08:07,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f65562a/d1ba8421da9a487b847988e1488c91ad [2019-10-15 01:08:07,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:08:07,247 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:08:07,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:07,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:08:07,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:08:07,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:07" (1/1) ... [2019-10-15 01:08:07,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc1a0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:07, skipping insertion in model container [2019-10-15 01:08:07,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:07" (1/1) ... [2019-10-15 01:08:07,263 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:08:07,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:08:08,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:08,078 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:08:08,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:08,263 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:08:08,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08 WrapperNode [2019-10-15 01:08:08,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:08,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:08:08,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:08:08,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:08:08,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:08:08,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:08:08,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:08:08,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:08:08,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-15 01:08:08,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:08:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:08:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:08:08,545 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:08:08,546 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:08:08,546 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:08:08,547 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:08:08,547 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:08:08,548 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:08:08,548 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:08:08,548 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:08:08,548 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:08:08,549 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:08:08,549 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:08:08,549 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:08:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:08:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:08:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:08:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:08:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:08:08,554 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:08:08,554 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:08:08,554 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:08:08,554 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:08:08,554 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:08:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:08:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:08:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:08:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:08:08,555 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:08:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:08:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:08:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:08:08,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:08:08,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:08:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:08:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:08:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:08:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:08:08,559 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:08:08,559 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:08:08,559 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:08:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:08:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:08:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:08:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:08:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:08:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:08:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:08:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:08:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:08:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:08:08,561 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:08:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:08:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-15 01:08:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:08:08,562 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:08:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:08:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-15 01:08:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:08:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:08:08,563 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:08:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:08:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:08:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:08:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:08:08,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:08:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:08:08,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:08:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:08:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:08:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:08:08,566 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:08:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:08:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:08:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:08:08,567 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:08:08,568 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:08:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:08:08,569 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:08:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:08:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:08:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:08:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:08:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:08:08,570 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:08:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:08:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:08:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:08:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:08:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:08,571 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:08:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:08:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:08:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:08:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:08:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:08:08,572 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:08:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:08:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:08:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:08:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:08:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:08:08,573 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:08:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:08:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:08:08,574 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:08:08,575 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:08:08,576 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:08:08,577 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:08:08,578 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:08:08,580 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:08:08,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:08:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:08:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:08:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:08:08,592 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:08:08,593 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:08:08,593 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:08:08,593 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:08:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:08:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:08:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-15 01:08:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:08:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:08:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-15 01:08:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:08:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:08:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:08:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:08:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:08:08,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:08:10,751 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:08:10,751 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:08:10,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:10 BoogieIcfgContainer [2019-10-15 01:08:10,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:08:10,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:08:10,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:08:10,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:08:10,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:08:07" (1/3) ... [2019-10-15 01:08:10,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a082407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:10, skipping insertion in model container [2019-10-15 01:08:10,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08" (2/3) ... [2019-10-15 01:08:10,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a082407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:10, skipping insertion in model container [2019-10-15 01:08:10,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:10" (3/3) ... [2019-10-15 01:08:10,762 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product03.cil.c [2019-10-15 01:08:10,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:08:10,783 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:08:10,794 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:08:10,823 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:08:10,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:08:10,824 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:08:10,824 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:08:10,824 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:08:10,824 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:08:10,824 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:08:10,824 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:08:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states. [2019-10-15 01:08:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:08:10,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:10,879 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:10,881 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2136153508, now seen corresponding path program 1 times [2019-10-15 01:08:10,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:10,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317235776] [2019-10-15 01:08:10,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:10,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:10,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:11,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317235776] [2019-10-15 01:08:11,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:11,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:11,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963331831] [2019-10-15 01:08:11,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:11,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:11,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:11,504 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 4 states. [2019-10-15 01:08:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:11,706 INFO L93 Difference]: Finished difference Result 1126 states and 1818 transitions. [2019-10-15 01:08:11,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:11,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:08:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:11,742 INFO L225 Difference]: With dead ends: 1126 [2019-10-15 01:08:11,742 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 01:08:11,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 01:08:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-15 01:08:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 01:08:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 900 transitions. [2019-10-15 01:08:11,855 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 900 transitions. Word has length 135 [2019-10-15 01:08:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:11,856 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 900 transitions. [2019-10-15 01:08:11,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 900 transitions. [2019-10-15 01:08:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:08:11,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:11,866 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:11,866 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1459337121, now seen corresponding path program 1 times [2019-10-15 01:08:11,867 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:11,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713424] [2019-10-15 01:08:11,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:11,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:11,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:12,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713424] [2019-10-15 01:08:12,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:12,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:12,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125639756] [2019-10-15 01:08:12,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:12,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:12,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:12,076 INFO L87 Difference]: Start difference. First operand 566 states and 900 transitions. Second operand 4 states. [2019-10-15 01:08:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:12,181 INFO L93 Difference]: Finished difference Result 1099 states and 1761 transitions. [2019-10-15 01:08:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:12,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-15 01:08:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:12,189 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:08:12,189 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 01:08:12,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 01:08:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-15 01:08:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 01:08:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 899 transitions. [2019-10-15 01:08:12,249 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 899 transitions. Word has length 136 [2019-10-15 01:08:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:12,251 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 899 transitions. [2019-10-15 01:08:12,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 899 transitions. [2019-10-15 01:08:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:08:12,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:12,267 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:12,268 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:12,268 INFO L82 PathProgramCache]: Analyzing trace with hash -901760384, now seen corresponding path program 1 times [2019-10-15 01:08:12,268 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:12,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678544942] [2019-10-15 01:08:12,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:12,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:12,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:12,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678544942] [2019-10-15 01:08:12,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:12,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:12,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418178725] [2019-10-15 01:08:12,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:12,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:12,479 INFO L87 Difference]: Start difference. First operand 566 states and 899 transitions. Second operand 4 states. [2019-10-15 01:08:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:12,585 INFO L93 Difference]: Finished difference Result 1099 states and 1760 transitions. [2019-10-15 01:08:12,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:12,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 01:08:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:12,595 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:08:12,596 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 01:08:12,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 01:08:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-15 01:08:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 01:08:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 898 transitions. [2019-10-15 01:08:12,649 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 898 transitions. Word has length 137 [2019-10-15 01:08:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:12,650 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 898 transitions. [2019-10-15 01:08:12,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 898 transitions. [2019-10-15 01:08:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:08:12,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:12,658 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:12,658 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash -448114181, now seen corresponding path program 1 times [2019-10-15 01:08:12,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:12,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129916557] [2019-10-15 01:08:12,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:12,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:12,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:12,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129916557] [2019-10-15 01:08:12,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:12,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:12,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331849077] [2019-10-15 01:08:12,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:12,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:12,891 INFO L87 Difference]: Start difference. First operand 566 states and 898 transitions. Second operand 4 states. [2019-10-15 01:08:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:13,048 INFO L93 Difference]: Finished difference Result 1099 states and 1759 transitions. [2019-10-15 01:08:13,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:13,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:08:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:13,054 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:08:13,055 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 01:08:13,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 01:08:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-15 01:08:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 01:08:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 897 transitions. [2019-10-15 01:08:13,086 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 897 transitions. Word has length 138 [2019-10-15 01:08:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:13,087 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 897 transitions. [2019-10-15 01:08:13,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 897 transitions. [2019-10-15 01:08:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:08:13,093 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:13,093 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:13,094 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:13,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1078652764, now seen corresponding path program 1 times [2019-10-15 01:08:13,094 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:13,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219797204] [2019-10-15 01:08:13,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:13,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219797204] [2019-10-15 01:08:13,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:13,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:13,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606358794] [2019-10-15 01:08:13,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:13,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:13,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:13,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:13,219 INFO L87 Difference]: Start difference. First operand 566 states and 897 transitions. Second operand 4 states. [2019-10-15 01:08:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:13,280 INFO L93 Difference]: Finished difference Result 1099 states and 1758 transitions. [2019-10-15 01:08:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:13,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:08:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:13,285 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:08:13,285 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 01:08:13,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 01:08:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-15 01:08:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 01:08:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 896 transitions. [2019-10-15 01:08:13,310 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 896 transitions. Word has length 139 [2019-10-15 01:08:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:13,311 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 896 transitions. [2019-10-15 01:08:13,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 896 transitions. [2019-10-15 01:08:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:08:13,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:13,315 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:13,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1512424343, now seen corresponding path program 1 times [2019-10-15 01:08:13,316 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:13,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690375987] [2019-10-15 01:08:13,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:13,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690375987] [2019-10-15 01:08:13,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:13,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:08:13,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563799128] [2019-10-15 01:08:13,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:08:13,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:13,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:08:13,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:08:13,470 INFO L87 Difference]: Start difference. First operand 566 states and 896 transitions. Second operand 10 states. [2019-10-15 01:08:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:13,692 INFO L93 Difference]: Finished difference Result 1104 states and 1765 transitions. [2019-10-15 01:08:13,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:13,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-15 01:08:13,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:13,698 INFO L225 Difference]: With dead ends: 1104 [2019-10-15 01:08:13,698 INFO L226 Difference]: Without dead ends: 575 [2019-10-15 01:08:13,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-10-15 01:08:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2019-10-15 01:08:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-15 01:08:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 906 transitions. [2019-10-15 01:08:13,732 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 906 transitions. Word has length 140 [2019-10-15 01:08:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:13,732 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 906 transitions. [2019-10-15 01:08:13,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:08:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 906 transitions. [2019-10-15 01:08:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:08:13,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:13,740 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:13,740 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash 525841654, now seen corresponding path program 1 times [2019-10-15 01:08:13,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:13,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650888236] [2019-10-15 01:08:13,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:13,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650888236] [2019-10-15 01:08:13,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:13,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:13,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137185274] [2019-10-15 01:08:13,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:13,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:13,856 INFO L87 Difference]: Start difference. First operand 573 states and 906 transitions. Second operand 4 states. [2019-10-15 01:08:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:13,914 INFO L93 Difference]: Finished difference Result 1105 states and 1766 transitions. [2019-10-15 01:08:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:13,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:08:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:13,920 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:08:13,920 INFO L226 Difference]: Without dead ends: 569 [2019-10-15 01:08:13,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-15 01:08:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-15 01:08:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-15 01:08:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 899 transitions. [2019-10-15 01:08:13,947 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 899 transitions. Word has length 140 [2019-10-15 01:08:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:13,947 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 899 transitions. [2019-10-15 01:08:13,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 899 transitions. [2019-10-15 01:08:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:08:13,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:13,952 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:13,953 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1915884638, now seen corresponding path program 1 times [2019-10-15 01:08:13,953 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:13,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486517868] [2019-10-15 01:08:13,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:14,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486517868] [2019-10-15 01:08:14,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:14,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:14,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993013848] [2019-10-15 01:08:14,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:14,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:14,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:14,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:14,079 INFO L87 Difference]: Start difference. First operand 569 states and 899 transitions. Second operand 6 states. [2019-10-15 01:08:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:14,361 INFO L93 Difference]: Finished difference Result 1118 states and 1790 transitions. [2019-10-15 01:08:14,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:08:14,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:08:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:14,405 INFO L225 Difference]: With dead ends: 1118 [2019-10-15 01:08:14,406 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:08:14,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:08:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-10-15 01:08:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 900 transitions. [2019-10-15 01:08:14,441 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 900 transitions. Word has length 141 [2019-10-15 01:08:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:14,441 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 900 transitions. [2019-10-15 01:08:14,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 900 transitions. [2019-10-15 01:08:14,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:08:14,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:14,446 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:14,446 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash 625839962, now seen corresponding path program 1 times [2019-10-15 01:08:14,446 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:14,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823359710] [2019-10-15 01:08:14,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:14,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823359710] [2019-10-15 01:08:14,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:14,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:14,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700028845] [2019-10-15 01:08:14,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:14,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:14,611 INFO L87 Difference]: Start difference. First operand 574 states and 900 transitions. Second operand 6 states. [2019-10-15 01:08:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:14,827 INFO L93 Difference]: Finished difference Result 1081 states and 1705 transitions. [2019-10-15 01:08:14,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:14,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-15 01:08:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:14,832 INFO L225 Difference]: With dead ends: 1081 [2019-10-15 01:08:14,832 INFO L226 Difference]: Without dead ends: 574 [2019-10-15 01:08:14,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-15 01:08:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-15 01:08:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 896 transitions. [2019-10-15 01:08:14,857 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 896 transitions. Word has length 142 [2019-10-15 01:08:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:14,858 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 896 transitions. [2019-10-15 01:08:14,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 896 transitions. [2019-10-15 01:08:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:08:14,862 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:14,862 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:14,862 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:14,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1831211677, now seen corresponding path program 1 times [2019-10-15 01:08:14,863 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:14,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650660449] [2019-10-15 01:08:14,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:14,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650660449] [2019-10-15 01:08:14,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:14,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:14,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39556067] [2019-10-15 01:08:14,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:14,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:14,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:14,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:14,987 INFO L87 Difference]: Start difference. First operand 574 states and 896 transitions. Second operand 6 states. [2019-10-15 01:08:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:15,214 INFO L93 Difference]: Finished difference Result 1081 states and 1701 transitions. [2019-10-15 01:08:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:15,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:08:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:15,219 INFO L225 Difference]: With dead ends: 1081 [2019-10-15 01:08:15,219 INFO L226 Difference]: Without dead ends: 574 [2019-10-15 01:08:15,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-15 01:08:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-15 01:08:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 892 transitions. [2019-10-15 01:08:15,242 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 892 transitions. Word has length 143 [2019-10-15 01:08:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:15,243 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 892 transitions. [2019-10-15 01:08:15,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 892 transitions. [2019-10-15 01:08:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:08:15,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:15,247 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:15,247 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1553880605, now seen corresponding path program 1 times [2019-10-15 01:08:15,248 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:15,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575041697] [2019-10-15 01:08:15,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:15,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575041697] [2019-10-15 01:08:15,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:15,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:08:15,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483338471] [2019-10-15 01:08:15,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:08:15,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:08:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:08:15,365 INFO L87 Difference]: Start difference. First operand 574 states and 892 transitions. Second operand 7 states. [2019-10-15 01:08:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:15,488 INFO L93 Difference]: Finished difference Result 1084 states and 1701 transitions. [2019-10-15 01:08:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:15,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:08:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:15,496 INFO L225 Difference]: With dead ends: 1084 [2019-10-15 01:08:15,496 INFO L226 Difference]: Without dead ends: 556 [2019-10-15 01:08:15,499 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-15 01:08:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 553. [2019-10-15 01:08:15,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-15 01:08:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 855 transitions. [2019-10-15 01:08:15,526 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 855 transitions. Word has length 143 [2019-10-15 01:08:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:15,527 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 855 transitions. [2019-10-15 01:08:15,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:08:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 855 transitions. [2019-10-15 01:08:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:08:15,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:15,531 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:15,532 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:15,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1810773505, now seen corresponding path program 1 times [2019-10-15 01:08:15,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:15,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812220121] [2019-10-15 01:08:15,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:15,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812220121] [2019-10-15 01:08:15,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:15,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:15,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782215429] [2019-10-15 01:08:15,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:15,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:15,663 INFO L87 Difference]: Start difference. First operand 553 states and 855 transitions. Second operand 6 states. [2019-10-15 01:08:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:15,818 INFO L93 Difference]: Finished difference Result 1060 states and 1660 transitions. [2019-10-15 01:08:15,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:15,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:08:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:15,824 INFO L225 Difference]: With dead ends: 1060 [2019-10-15 01:08:15,824 INFO L226 Difference]: Without dead ends: 553 [2019-10-15 01:08:15,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-15 01:08:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-15 01:08:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-15 01:08:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 854 transitions. [2019-10-15 01:08:15,851 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 854 transitions. Word has length 144 [2019-10-15 01:08:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:15,851 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 854 transitions. [2019-10-15 01:08:15,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 854 transitions. [2019-10-15 01:08:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:08:15,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:15,856 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:15,856 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1997404776, now seen corresponding path program 1 times [2019-10-15 01:08:15,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:15,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455496071] [2019-10-15 01:08:15,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:15,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455496071] [2019-10-15 01:08:15,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:15,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:15,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523503577] [2019-10-15 01:08:15,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:15,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:15,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:15,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:15,987 INFO L87 Difference]: Start difference. First operand 553 states and 854 transitions. Second operand 6 states. [2019-10-15 01:08:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,159 INFO L93 Difference]: Finished difference Result 1060 states and 1659 transitions. [2019-10-15 01:08:16,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:16,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:08:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,166 INFO L225 Difference]: With dead ends: 1060 [2019-10-15 01:08:16,166 INFO L226 Difference]: Without dead ends: 553 [2019-10-15 01:08:16,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-15 01:08:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-15 01:08:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-15 01:08:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 853 transitions. [2019-10-15 01:08:16,186 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 853 transitions. Word has length 145 [2019-10-15 01:08:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,187 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 853 transitions. [2019-10-15 01:08:16,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 853 transitions. [2019-10-15 01:08:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:08:16,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,191 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:16,191 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1659299750, now seen corresponding path program 1 times [2019-10-15 01:08:16,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207833649] [2019-10-15 01:08:16,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:16,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207833649] [2019-10-15 01:08:16,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:16,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:16,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674843222] [2019-10-15 01:08:16,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:16,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:16,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:16,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:16,299 INFO L87 Difference]: Start difference. First operand 553 states and 853 transitions. Second operand 4 states. [2019-10-15 01:08:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,364 INFO L93 Difference]: Finished difference Result 1060 states and 1658 transitions. [2019-10-15 01:08:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:16,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-15 01:08:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,369 INFO L225 Difference]: With dead ends: 1060 [2019-10-15 01:08:16,369 INFO L226 Difference]: Without dead ends: 553 [2019-10-15 01:08:16,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:08:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-15 01:08:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-15 01:08:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-15 01:08:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 852 transitions. [2019-10-15 01:08:16,389 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 852 transitions. Word has length 146 [2019-10-15 01:08:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,389 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 852 transitions. [2019-10-15 01:08:16,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 852 transitions. [2019-10-15 01:08:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:08:16,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,393 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:16,393 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1328525148, now seen corresponding path program 1 times [2019-10-15 01:08:16,394 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327897483] [2019-10-15 01:08:16,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:16,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327897483] [2019-10-15 01:08:16,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:16,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:08:16,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128492390] [2019-10-15 01:08:16,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:08:16,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:16,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:08:16,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:08:16,564 INFO L87 Difference]: Start difference. First operand 553 states and 852 transitions. Second operand 12 states. [2019-10-15 01:08:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,818 INFO L93 Difference]: Finished difference Result 1066 states and 1668 transitions. [2019-10-15 01:08:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:08:16,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-15 01:08:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,823 INFO L225 Difference]: With dead ends: 1066 [2019-10-15 01:08:16,823 INFO L226 Difference]: Without dead ends: 560 [2019-10-15 01:08:16,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-15 01:08:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2019-10-15 01:08:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-10-15 01:08:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 858 transitions. [2019-10-15 01:08:16,845 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 858 transitions. Word has length 146 [2019-10-15 01:08:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,845 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 858 transitions. [2019-10-15 01:08:16,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:08:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 858 transitions. [2019-10-15 01:08:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:08:16,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,849 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:16,849 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,850 INFO L82 PathProgramCache]: Analyzing trace with hash -685285033, now seen corresponding path program 1 times [2019-10-15 01:08:16,850 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926201537] [2019-10-15 01:08:16,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:08:17,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926201537] [2019-10-15 01:08:17,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017821849] [2019-10-15 01:08:17,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:17,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:08:17,900 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:08:18,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:18,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-15 01:08:18,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181019730] [2019-10-15 01:08:18,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:18,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:18,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:18,238 INFO L87 Difference]: Start difference. First operand 558 states and 858 transitions. Second operand 5 states. [2019-10-15 01:08:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:19,125 INFO L93 Difference]: Finished difference Result 1071 states and 1701 transitions. [2019-10-15 01:08:19,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:19,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:08:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:19,129 INFO L225 Difference]: With dead ends: 1071 [2019-10-15 01:08:19,130 INFO L226 Difference]: Without dead ends: 566 [2019-10-15 01:08:19,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:08:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-15 01:08:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-15 01:08:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-15 01:08:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 871 transitions. [2019-10-15 01:08:19,161 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 871 transitions. Word has length 147 [2019-10-15 01:08:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:19,161 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 871 transitions. [2019-10-15 01:08:19,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 871 transitions. [2019-10-15 01:08:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:08:19,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:19,165 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:19,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:19,373 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:19,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash 901109553, now seen corresponding path program 1 times [2019-10-15 01:08:19,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:19,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126338027] [2019-10-15 01:08:19,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:08:19,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126338027] [2019-10-15 01:08:19,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709109147] [2019-10-15 01:08:19,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:20,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:20,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:08:20,305 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:08:20,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:20,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:08:20,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999082709] [2019-10-15 01:08:20,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:20,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:20,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:20,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:20,645 INFO L87 Difference]: Start difference. First operand 566 states and 871 transitions. Second operand 5 states. [2019-10-15 01:08:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:21,371 INFO L93 Difference]: Finished difference Result 1087 states and 1724 transitions. [2019-10-15 01:08:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:21,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:08:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:21,377 INFO L225 Difference]: With dead ends: 1087 [2019-10-15 01:08:21,377 INFO L226 Difference]: Without dead ends: 574 [2019-10-15 01:08:21,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-15 01:08:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-15 01:08:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 884 transitions. [2019-10-15 01:08:21,406 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 884 transitions. Word has length 150 [2019-10-15 01:08:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:21,407 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 884 transitions. [2019-10-15 01:08:21,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 884 transitions. [2019-10-15 01:08:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:08:21,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:21,411 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:21,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:21,626 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash -844488677, now seen corresponding path program 1 times [2019-10-15 01:08:21,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:21,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023459555] [2019-10-15 01:08:21,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:08:21,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023459555] [2019-10-15 01:08:21,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622260256] [2019-10-15 01:08:21,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:22,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:22,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:08:22,385 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:08:22,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:22,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-15 01:08:22,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635835053] [2019-10-15 01:08:22,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:22,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:22,703 INFO L87 Difference]: Start difference. First operand 574 states and 884 transitions. Second operand 5 states. [2019-10-15 01:08:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:23,568 INFO L93 Difference]: Finished difference Result 1103 states and 1747 transitions. [2019-10-15 01:08:23,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:23,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:08:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:23,575 INFO L225 Difference]: With dead ends: 1103 [2019-10-15 01:08:23,575 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:08:23,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:08:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:08:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:08:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:08:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 897 transitions. [2019-10-15 01:08:23,607 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 897 transitions. Word has length 153 [2019-10-15 01:08:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:23,607 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 897 transitions. [2019-10-15 01:08:23,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 897 transitions. [2019-10-15 01:08:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:08:23,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:23,613 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:23,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:23,821 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash 142602349, now seen corresponding path program 1 times [2019-10-15 01:08:23,822 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827979665] [2019-10-15 01:08:23,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:08:24,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827979665] [2019-10-15 01:08:24,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597481013] [2019-10-15 01:08:24,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:24,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:24,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:08:24,886 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:08:25,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:25,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 16 [2019-10-15 01:08:25,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577879485] [2019-10-15 01:08:25,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:25,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:25,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:25,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:08:25,181 INFO L87 Difference]: Start difference. First operand 582 states and 897 transitions. Second operand 5 states. [2019-10-15 01:08:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:26,041 INFO L93 Difference]: Finished difference Result 1119 states and 1770 transitions. [2019-10-15 01:08:26,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:26,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-15 01:08:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:26,047 INFO L225 Difference]: With dead ends: 1119 [2019-10-15 01:08:26,048 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:08:26,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 312 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:08:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:08:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:08:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 910 transitions. [2019-10-15 01:08:26,073 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 910 transitions. Word has length 156 [2019-10-15 01:08:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:26,074 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 910 transitions. [2019-10-15 01:08:26,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 910 transitions. [2019-10-15 01:08:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:08:26,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:26,078 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:26,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:26,286 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:26,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1711898401, now seen corresponding path program 1 times [2019-10-15 01:08:26,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:26,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767794039] [2019-10-15 01:08:26,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:26,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:08:26,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767794039] [2019-10-15 01:08:26,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740081590] [2019-10-15 01:08:26,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:26,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:08:26,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:08:27,107 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:08:27,239 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:08:27,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-15 01:08:27,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511325278] [2019-10-15 01:08:27,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:27,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:27,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:27,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:27,241 INFO L87 Difference]: Start difference. First operand 590 states and 910 transitions. Second operand 6 states. [2019-10-15 01:08:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:27,853 INFO L93 Difference]: Finished difference Result 1670 states and 2664 transitions. [2019-10-15 01:08:27,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:27,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-15 01:08:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:27,864 INFO L225 Difference]: With dead ends: 1670 [2019-10-15 01:08:27,864 INFO L226 Difference]: Without dead ends: 1133 [2019-10-15 01:08:27,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-10-15 01:08:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1124. [2019-10-15 01:08:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-15 01:08:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1774 transitions. [2019-10-15 01:08:27,911 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1774 transitions. Word has length 159 [2019-10-15 01:08:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:27,912 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1774 transitions. [2019-10-15 01:08:27,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1774 transitions. [2019-10-15 01:08:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:08:27,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:27,916 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:28,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:28,123 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:28,123 INFO L82 PathProgramCache]: Analyzing trace with hash 372939816, now seen corresponding path program 1 times [2019-10-15 01:08:28,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:28,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036030279] [2019-10-15 01:08:28,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:08:28,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036030279] [2019-10-15 01:08:28,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180207323] [2019-10-15 01:08:28,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:28,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 2627 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-15 01:08:28,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:08:28,945 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:08:29,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:29,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-15 01:08:29,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574835954] [2019-10-15 01:08:29,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:29,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:08:29,317 INFO L87 Difference]: Start difference. First operand 1124 states and 1774 transitions. Second operand 9 states. [2019-10-15 01:08:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:34,539 INFO L93 Difference]: Finished difference Result 3435 states and 5537 transitions. [2019-10-15 01:08:34,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:34,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-15 01:08:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:34,561 INFO L225 Difference]: With dead ends: 3435 [2019-10-15 01:08:34,561 INFO L226 Difference]: Without dead ends: 2364 [2019-10-15 01:08:34,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:08:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-10-15 01:08:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2333. [2019-10-15 01:08:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2019-10-15 01:08:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 3744 transitions. [2019-10-15 01:08:34,725 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 3744 transitions. Word has length 164 [2019-10-15 01:08:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:34,727 INFO L462 AbstractCegarLoop]: Abstraction has 2333 states and 3744 transitions. [2019-10-15 01:08:34,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3744 transitions. [2019-10-15 01:08:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:08:34,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:34,738 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:34,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:34,956 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:34,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1587249477, now seen corresponding path program 1 times [2019-10-15 01:08:34,957 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:34,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479745375] [2019-10-15 01:08:34,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:34,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:34,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:08:35,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479745375] [2019-10-15 01:08:35,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:35,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:35,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156956446] [2019-10-15 01:08:35,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:35,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:35,123 INFO L87 Difference]: Start difference. First operand 2333 states and 3744 transitions. Second operand 9 states. [2019-10-15 01:08:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:35,352 INFO L93 Difference]: Finished difference Result 4538 states and 7325 transitions. [2019-10-15 01:08:35,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:35,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-15 01:08:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:35,371 INFO L225 Difference]: With dead ends: 4538 [2019-10-15 01:08:35,372 INFO L226 Difference]: Without dead ends: 2252 [2019-10-15 01:08:35,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-10-15 01:08:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2248. [2019-10-15 01:08:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-10-15 01:08:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3617 transitions. [2019-10-15 01:08:35,525 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3617 transitions. Word has length 167 [2019-10-15 01:08:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:35,525 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 3617 transitions. [2019-10-15 01:08:35,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3617 transitions. [2019-10-15 01:08:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-15 01:08:35,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:35,531 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:08:35,531 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash -994214802, now seen corresponding path program 1 times [2019-10-15 01:08:35,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:35,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122600560] [2019-10-15 01:08:35,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:35,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:35,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:08:35,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122600560] [2019-10-15 01:08:35,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956375232] [2019-10-15 01:08:35,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:36,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:08:36,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:08:36,261 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:08:36,514 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:08:36,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 13 [2019-10-15 01:08:36,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992033170] [2019-10-15 01:08:36,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:08:36,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:36,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:08:36,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:36,518 INFO L87 Difference]: Start difference. First operand 2248 states and 3617 transitions. Second operand 7 states. [2019-10-15 01:08:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:36,632 INFO L93 Difference]: Finished difference Result 4619 states and 7510 transitions. [2019-10-15 01:08:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:36,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-15 01:08:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:36,649 INFO L225 Difference]: With dead ends: 4619 [2019-10-15 01:08:36,650 INFO L226 Difference]: Without dead ends: 2424 [2019-10-15 01:08:36,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 341 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-10-15 01:08:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2416. [2019-10-15 01:08:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2019-10-15 01:08:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 3906 transitions. [2019-10-15 01:08:36,758 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 3906 transitions. Word has length 170 [2019-10-15 01:08:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:36,758 INFO L462 AbstractCegarLoop]: Abstraction has 2416 states and 3906 transitions. [2019-10-15 01:08:36,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:08:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3906 transitions. [2019-10-15 01:08:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-15 01:08:36,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:36,762 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:08:36,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:36,973 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash -123748720, now seen corresponding path program 1 times [2019-10-15 01:08:36,973 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:36,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180802554] [2019-10-15 01:08:36,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:36,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:36,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:08:37,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180802554] [2019-10-15 01:08:37,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652596293] [2019-10-15 01:08:37,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:37,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-15 01:08:37,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:08:37,814 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:08:38,195 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:38,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-15 01:08:38,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929772147] [2019-10-15 01:08:38,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:38,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:38,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:38,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:08:38,197 INFO L87 Difference]: Start difference. First operand 2416 states and 3906 transitions. Second operand 9 states.