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_spec3_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:07,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:07,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:07,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:07,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:07,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:07,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:07,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:08,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:08,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:08,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:08,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:08,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:08,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:08,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:08,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:08,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:08,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:08,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:08,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:08,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:08,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:08,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:08,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:08,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:08,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:08,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:08,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:08,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:08,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:08,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:08,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:08,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:08,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:08,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:08,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:08,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:08,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:08,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:08,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:08,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:08,049 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:10:08,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:08,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:08,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:08,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:08,068 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:08,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:08,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:08,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:08,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:08,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:08,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:08,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:08,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:08,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:08,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:08,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:08,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:08,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:08,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:08,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:08,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:08,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:08,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:08,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:08,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:08,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:08,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:08,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:08,073 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:10:08,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:08,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:08,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:08,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:08,393 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:08,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product01.cil.c [2019-10-15 01:10:08,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c947e5f2e/8e16682d42f745a7a020c5880a29e025/FLAG4f2adbe9e [2019-10-15 01:10:09,165 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:09,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product01.cil.c [2019-10-15 01:10:09,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c947e5f2e/8e16682d42f745a7a020c5880a29e025/FLAG4f2adbe9e [2019-10-15 01:10:09,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c947e5f2e/8e16682d42f745a7a020c5880a29e025 [2019-10-15 01:10:09,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:09,353 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:09,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:09,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:09,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:09,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:09" (1/1) ... [2019-10-15 01:10:09,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4be3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:09, skipping insertion in model container [2019-10-15 01:10:09,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:09" (1/1) ... [2019-10-15 01:10:09,370 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:09,457 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:10,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:10,179 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:10,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:10,464 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:10,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10 WrapperNode [2019-10-15 01:10:10,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:10,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:10,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:10,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:10,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (1/1) ... [2019-10-15 01:10:10,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (1/1) ... [2019-10-15 01:10:10,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (1/1) ... [2019-10-15 01:10:10,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (1/1) ... [2019-10-15 01:10:10,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (1/1) ... [2019-10-15 01:10:10,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (1/1) ... [2019-10-15 01:10:10,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (1/1) ... [2019-10-15 01:10:10,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:10,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:10,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:10,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:10,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (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:10:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:10,763 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:10,764 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:10,765 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:10,765 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:10,765 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:10,765 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:10,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:10,766 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:10,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:10,768 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:10,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:10,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:10,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:10,777 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:10,777 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:10,777 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:10,777 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:10,779 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:10,780 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:10,781 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:10,782 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:10,783 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:10,784 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:10,791 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:10,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:13,261 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:13,261 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:13,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:13 BoogieIcfgContainer [2019-10-15 01:10:13,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:13,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:13,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:13,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:13,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:09" (1/3) ... [2019-10-15 01:10:13,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6212c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:13, skipping insertion in model container [2019-10-15 01:10:13,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:10" (2/3) ... [2019-10-15 01:10:13,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6212c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:13, skipping insertion in model container [2019-10-15 01:10:13,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:13" (3/3) ... [2019-10-15 01:10:13,272 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product01.cil.c [2019-10-15 01:10:13,282 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:13,294 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:13,307 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:13,358 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:13,358 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:13,358 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:13,359 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:13,359 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:13,359 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:13,359 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:13,359 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-10-15 01:10:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:10:13,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,458 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:13,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1682345477, now seen corresponding path program 1 times [2019-10-15 01:10:13,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54566421] [2019-10-15 01:10:13,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:14,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54566421] [2019-10-15 01:10:14,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:14,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:14,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620778752] [2019-10-15 01:10:14,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:14,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:14,297 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 7 states. [2019-10-15 01:10:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:14,612 INFO L93 Difference]: Finished difference Result 1161 states and 1906 transitions. [2019-10-15 01:10:14,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:14,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-10-15 01:10:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:14,658 INFO L225 Difference]: With dead ends: 1161 [2019-10-15 01:10:14,658 INFO L226 Difference]: Without dead ends: 589 [2019-10-15 01:10:14,672 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:10:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-15 01:10:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-10-15 01:10:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:10:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 948 transitions. [2019-10-15 01:10:14,846 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 948 transitions. Word has length 115 [2019-10-15 01:10:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:14,847 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 948 transitions. [2019-10-15 01:10:14,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 948 transitions. [2019-10-15 01:10:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:10:14,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:14,856 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:14,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash 492962916, now seen corresponding path program 1 times [2019-10-15 01:10:14,857 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:14,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141823483] [2019-10-15 01:10:14,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:15,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141823483] [2019-10-15 01:10:15,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:15,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:15,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340000560] [2019-10-15 01:10:15,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:15,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:15,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:15,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:15,052 INFO L87 Difference]: Start difference. First operand 587 states and 948 transitions. Second operand 4 states. [2019-10-15 01:10:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:15,143 INFO L93 Difference]: Finished difference Result 1140 states and 1861 transitions. [2019-10-15 01:10:15,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:15,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-15 01:10:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:15,150 INFO L225 Difference]: With dead ends: 1140 [2019-10-15 01:10:15,150 INFO L226 Difference]: Without dead ends: 569 [2019-10-15 01:10:15,154 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:10:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-15 01:10:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-15 01:10:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-15 01:10:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 915 transitions. [2019-10-15 01:10:15,198 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 915 transitions. Word has length 116 [2019-10-15 01:10:15,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:15,200 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 915 transitions. [2019-10-15 01:10:15,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 915 transitions. [2019-10-15 01:10:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:10:15,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:15,206 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:15,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1591926986, now seen corresponding path program 1 times [2019-10-15 01:10:15,207 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:15,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496868239] [2019-10-15 01:10:15,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:15,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496868239] [2019-10-15 01:10:15,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:15,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:15,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772205786] [2019-10-15 01:10:15,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:15,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:15,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:15,434 INFO L87 Difference]: Start difference. First operand 569 states and 915 transitions. Second operand 7 states. [2019-10-15 01:10:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:15,534 INFO L93 Difference]: Finished difference Result 1109 states and 1803 transitions. [2019-10-15 01:10:15,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:15,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-10-15 01:10:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:15,540 INFO L225 Difference]: With dead ends: 1109 [2019-10-15 01:10:15,540 INFO L226 Difference]: Without dead ends: 563 [2019-10-15 01:10:15,544 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:10:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-15 01:10:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-15 01:10:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-15 01:10:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 902 transitions. [2019-10-15 01:10:15,574 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 902 transitions. Word has length 116 [2019-10-15 01:10:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:15,575 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 902 transitions. [2019-10-15 01:10:15,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 902 transitions. [2019-10-15 01:10:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:10:15,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:15,579 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:15,579 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1250073911, now seen corresponding path program 1 times [2019-10-15 01:10:15,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:15,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817251663] [2019-10-15 01:10:15,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:15,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817251663] [2019-10-15 01:10:15,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:15,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:15,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439558507] [2019-10-15 01:10:15,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:15,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:15,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:15,757 INFO L87 Difference]: Start difference. First operand 563 states and 902 transitions. Second operand 7 states. [2019-10-15 01:10:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:15,854 INFO L93 Difference]: Finished difference Result 1097 states and 1777 transitions. [2019-10-15 01:10:15,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:15,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-15 01:10:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:15,860 INFO L225 Difference]: With dead ends: 1097 [2019-10-15 01:10:15,860 INFO L226 Difference]: Without dead ends: 557 [2019-10-15 01:10:15,863 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:10:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-15 01:10:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-10-15 01:10:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-15 01:10:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 889 transitions. [2019-10-15 01:10:15,887 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 889 transitions. Word has length 117 [2019-10-15 01:10:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:15,888 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 889 transitions. [2019-10-15 01:10:15,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 889 transitions. [2019-10-15 01:10:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:10:15,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:15,892 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:15,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:15,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 803183822, now seen corresponding path program 1 times [2019-10-15 01:10:15,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:15,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712865456] [2019-10-15 01:10:15,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:16,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712865456] [2019-10-15 01:10:16,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:16,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:16,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903385538] [2019-10-15 01:10:16,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:16,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:16,108 INFO L87 Difference]: Start difference. First operand 557 states and 889 transitions. Second operand 7 states. [2019-10-15 01:10:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:16,219 INFO L93 Difference]: Finished difference Result 1085 states and 1751 transitions. [2019-10-15 01:10:16,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:16,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-15 01:10:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:16,231 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:10:16,232 INFO L226 Difference]: Without dead ends: 551 [2019-10-15 01:10:16,235 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:10:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-15 01:10:16,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-15 01:10:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-15 01:10:16,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 876 transitions. [2019-10-15 01:10:16,259 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 876 transitions. Word has length 118 [2019-10-15 01:10:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:16,259 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 876 transitions. [2019-10-15 01:10:16,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 876 transitions. [2019-10-15 01:10:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:10:16,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:16,263 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:16,263 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -377403377, now seen corresponding path program 1 times [2019-10-15 01:10:16,264 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:16,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345951745] [2019-10-15 01:10:16,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:16,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345951745] [2019-10-15 01:10:16,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:16,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:16,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181493919] [2019-10-15 01:10:16,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:16,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:16,412 INFO L87 Difference]: Start difference. First operand 551 states and 876 transitions. Second operand 7 states. [2019-10-15 01:10:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:16,496 INFO L93 Difference]: Finished difference Result 1073 states and 1725 transitions. [2019-10-15 01:10:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:16,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-15 01:10:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:16,502 INFO L225 Difference]: With dead ends: 1073 [2019-10-15 01:10:16,502 INFO L226 Difference]: Without dead ends: 551 [2019-10-15 01:10:16,506 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:10:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-15 01:10:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-15 01:10:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-15 01:10:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 875 transitions. [2019-10-15 01:10:16,529 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 875 transitions. Word has length 118 [2019-10-15 01:10:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:16,530 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 875 transitions. [2019-10-15 01:10:16,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 875 transitions. [2019-10-15 01:10:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:10:16,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:16,534 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:16,534 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:16,535 INFO L82 PathProgramCache]: Analyzing trace with hash -9363571, now seen corresponding path program 1 times [2019-10-15 01:10:16,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:16,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662519059] [2019-10-15 01:10:16,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:16,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662519059] [2019-10-15 01:10:16,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:16,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:16,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115935493] [2019-10-15 01:10:16,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:16,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:16,669 INFO L87 Difference]: Start difference. First operand 551 states and 875 transitions. Second operand 5 states. [2019-10-15 01:10:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:16,744 INFO L93 Difference]: Finished difference Result 1072 states and 1722 transitions. [2019-10-15 01:10:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:16,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-15 01:10:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:16,749 INFO L225 Difference]: With dead ends: 1072 [2019-10-15 01:10:16,750 INFO L226 Difference]: Without dead ends: 551 [2019-10-15 01:10:16,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-15 01:10:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-15 01:10:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-15 01:10:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 874 transitions. [2019-10-15 01:10:16,779 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 874 transitions. Word has length 119 [2019-10-15 01:10:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:16,780 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 874 transitions. [2019-10-15 01:10:16,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 874 transitions. [2019-10-15 01:10:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:10:16,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:16,784 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:16,784 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1274402062, now seen corresponding path program 1 times [2019-10-15 01:10:16,785 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:16,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560184707] [2019-10-15 01:10:16,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:16,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:16,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560184707] [2019-10-15 01:10:16,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:16,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:16,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580961473] [2019-10-15 01:10:16,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:16,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:16,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:16,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:16,987 INFO L87 Difference]: Start difference. First operand 551 states and 874 transitions. Second operand 5 states. [2019-10-15 01:10:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:17,060 INFO L93 Difference]: Finished difference Result 1072 states and 1720 transitions. [2019-10-15 01:10:17,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:17,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:10:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:17,068 INFO L225 Difference]: With dead ends: 1072 [2019-10-15 01:10:17,068 INFO L226 Difference]: Without dead ends: 551 [2019-10-15 01:10:17,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-15 01:10:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-15 01:10:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-15 01:10:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 873 transitions. [2019-10-15 01:10:17,097 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 873 transitions. Word has length 120 [2019-10-15 01:10:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:17,098 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 873 transitions. [2019-10-15 01:10:17,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 873 transitions. [2019-10-15 01:10:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:10:17,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:17,102 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:17,102 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1402359096, now seen corresponding path program 1 times [2019-10-15 01:10:17,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:17,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004161489] [2019-10-15 01:10:17,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:17,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004161489] [2019-10-15 01:10:17,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:17,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:17,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591990205] [2019-10-15 01:10:17,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:17,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:17,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:17,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:17,261 INFO L87 Difference]: Start difference. First operand 551 states and 873 transitions. Second operand 5 states. [2019-10-15 01:10:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:17,334 INFO L93 Difference]: Finished difference Result 1072 states and 1718 transitions. [2019-10-15 01:10:17,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:17,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-15 01:10:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:17,339 INFO L225 Difference]: With dead ends: 1072 [2019-10-15 01:10:17,339 INFO L226 Difference]: Without dead ends: 551 [2019-10-15 01:10:17,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-15 01:10:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-15 01:10:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-15 01:10:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 872 transitions. [2019-10-15 01:10:17,366 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 872 transitions. Word has length 121 [2019-10-15 01:10:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:17,367 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 872 transitions. [2019-10-15 01:10:17,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 872 transitions. [2019-10-15 01:10:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:10:17,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:17,371 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:17,371 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1993568105, now seen corresponding path program 1 times [2019-10-15 01:10:17,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:17,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690470623] [2019-10-15 01:10:17,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:17,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690470623] [2019-10-15 01:10:17,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:17,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:17,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016505424] [2019-10-15 01:10:17,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:17,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:17,512 INFO L87 Difference]: Start difference. First operand 551 states and 872 transitions. Second operand 5 states. [2019-10-15 01:10:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:17,608 INFO L93 Difference]: Finished difference Result 1072 states and 1716 transitions. [2019-10-15 01:10:17,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:17,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-15 01:10:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:17,620 INFO L225 Difference]: With dead ends: 1072 [2019-10-15 01:10:17,620 INFO L226 Difference]: Without dead ends: 551 [2019-10-15 01:10:17,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-15 01:10:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-15 01:10:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-15 01:10:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 871 transitions. [2019-10-15 01:10:17,658 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 871 transitions. Word has length 122 [2019-10-15 01:10:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:17,660 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 871 transitions. [2019-10-15 01:10:17,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 871 transitions. [2019-10-15 01:10:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:10:17,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:17,665 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:17,666 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash 369306115, now seen corresponding path program 1 times [2019-10-15 01:10:17,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:17,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287717801] [2019-10-15 01:10:17,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:17,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:18,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287717801] [2019-10-15 01:10:18,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:18,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:10:18,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668072338] [2019-10-15 01:10:18,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:10:18,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:18,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:10:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:18,048 INFO L87 Difference]: Start difference. First operand 551 states and 871 transitions. Second operand 8 states. [2019-10-15 01:10:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:20,578 INFO L93 Difference]: Finished difference Result 1991 states and 3207 transitions. [2019-10-15 01:10:20,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:10:20,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-15 01:10:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:20,593 INFO L225 Difference]: With dead ends: 1991 [2019-10-15 01:10:20,593 INFO L226 Difference]: Without dead ends: 1474 [2019-10-15 01:10:20,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-10-15 01:10:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1462. [2019-10-15 01:10:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2019-10-15 01:10:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 2316 transitions. [2019-10-15 01:10:20,660 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 2316 transitions. Word has length 123 [2019-10-15 01:10:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:20,660 INFO L462 AbstractCegarLoop]: Abstraction has 1462 states and 2316 transitions. [2019-10-15 01:10:20,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:10:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 2316 transitions. [2019-10-15 01:10:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:10:20,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:20,663 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:20,664 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:20,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1777046166, now seen corresponding path program 1 times [2019-10-15 01:10:20,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:20,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16610888] [2019-10-15 01:10:20,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:20,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:20,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:20,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16610888] [2019-10-15 01:10:20,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057427127] [2019-10-15 01:10:20,846 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:10:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:21,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 2970 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:21,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:21,633 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:21,739 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:21,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:21,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883734560] [2019-10-15 01:10:21,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:21,740 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:21,741 INFO L87 Difference]: Start difference. First operand 1462 states and 2316 transitions. Second operand 3 states. [2019-10-15 01:10:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:21,876 INFO L93 Difference]: Finished difference Result 4190 states and 6778 transitions. [2019-10-15 01:10:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:21,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-15 01:10:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:21,898 INFO L225 Difference]: With dead ends: 4190 [2019-10-15 01:10:21,898 INFO L226 Difference]: Without dead ends: 2762 [2019-10-15 01:10:21,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2019-10-15 01:10:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2656. [2019-10-15 01:10:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-10-15 01:10:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 4276 transitions. [2019-10-15 01:10:22,035 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 4276 transitions. Word has length 128 [2019-10-15 01:10:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:22,036 INFO L462 AbstractCegarLoop]: Abstraction has 2656 states and 4276 transitions. [2019-10-15 01:10:22,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 4276 transitions. [2019-10-15 01:10:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:10:22,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:22,041 INFO L380 BasicCegarLoop]: trace histogram [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:10:22,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:22,248 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:22,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1317574381, now seen corresponding path program 1 times [2019-10-15 01:10:22,249 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:22,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082385039] [2019-10-15 01:10:22,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:22,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:22,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:22,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082385039] [2019-10-15 01:10:22,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:22,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:22,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923619011] [2019-10-15 01:10:22,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:22,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:22,450 INFO L87 Difference]: Start difference. First operand 2656 states and 4276 transitions. Second operand 7 states. [2019-10-15 01:10:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:24,864 INFO L93 Difference]: Finished difference Result 7872 states and 12947 transitions. [2019-10-15 01:10:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:24,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-10-15 01:10:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:24,911 INFO L225 Difference]: With dead ends: 7872 [2019-10-15 01:10:24,912 INFO L226 Difference]: Without dead ends: 5250 [2019-10-15 01:10:24,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2019-10-15 01:10:25,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5166. [2019-10-15 01:10:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-10-15 01:10:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 8423 transitions. [2019-10-15 01:10:25,385 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 8423 transitions. Word has length 132 [2019-10-15 01:10:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:25,385 INFO L462 AbstractCegarLoop]: Abstraction has 5166 states and 8423 transitions. [2019-10-15 01:10:25,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 8423 transitions. [2019-10-15 01:10:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:10:25,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:25,393 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 01:10:25,394 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash -436249760, now seen corresponding path program 1 times [2019-10-15 01:10:25,395 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:25,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293133248] [2019-10-15 01:10:25,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:25,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:25,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:25,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293133248] [2019-10-15 01:10:25,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935531021] [2019-10-15 01:10:25,663 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:10:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:26,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 2971 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:26,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:26,299 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:26,407 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:26,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:26,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816505415] [2019-10-15 01:10:26,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:26,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:26,409 INFO L87 Difference]: Start difference. First operand 5166 states and 8423 transitions. Second operand 3 states. [2019-10-15 01:10:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:26,648 INFO L93 Difference]: Finished difference Result 11391 states and 18751 transitions. [2019-10-15 01:10:26,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:26,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-15 01:10:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:26,712 INFO L225 Difference]: With dead ends: 11391 [2019-10-15 01:10:26,712 INFO L226 Difference]: Without dead ends: 6259 [2019-10-15 01:10:26,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2019-10-15 01:10:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 6070. [2019-10-15 01:10:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6070 states. [2019-10-15 01:10:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6070 states to 6070 states and 9897 transitions. [2019-10-15 01:10:27,082 INFO L78 Accepts]: Start accepts. Automaton has 6070 states and 9897 transitions. Word has length 129 [2019-10-15 01:10:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:27,085 INFO L462 AbstractCegarLoop]: Abstraction has 6070 states and 9897 transitions. [2019-10-15 01:10:27,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 9897 transitions. [2019-10-15 01:10:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:10:27,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:27,089 INFO L380 BasicCegarLoop]: trace histogram [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:10:27,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:27,296 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1363748022, now seen corresponding path program 1 times [2019-10-15 01:10:27,298 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:27,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431027507] [2019-10-15 01:10:27,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:27,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:27,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:27,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431027507] [2019-10-15 01:10:27,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:27,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:27,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885563001] [2019-10-15 01:10:27,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:27,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:27,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:27,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:27,410 INFO L87 Difference]: Start difference. First operand 6070 states and 9897 transitions. Second operand 4 states. [2019-10-15 01:10:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:27,699 INFO L93 Difference]: Finished difference Result 12098 states and 19931 transitions. [2019-10-15 01:10:27,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:27,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-15 01:10:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:27,749 INFO L225 Difference]: With dead ends: 12098 [2019-10-15 01:10:27,750 INFO L226 Difference]: Without dead ends: 6062 [2019-10-15 01:10:27,778 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:10:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2019-10-15 01:10:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 6040. [2019-10-15 01:10:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6040 states. [2019-10-15 01:10:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6040 states to 6040 states and 9809 transitions. [2019-10-15 01:10:28,027 INFO L78 Accepts]: Start accepts. Automaton has 6040 states and 9809 transitions. Word has length 132 [2019-10-15 01:10:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:28,028 INFO L462 AbstractCegarLoop]: Abstraction has 6040 states and 9809 transitions. [2019-10-15 01:10:28,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6040 states and 9809 transitions. [2019-10-15 01:10:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:10:28,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:28,033 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:28,033 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:28,034 INFO L82 PathProgramCache]: Analyzing trace with hash -645502412, now seen corresponding path program 1 times [2019-10-15 01:10:28,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:28,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935256902] [2019-10-15 01:10:28,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:28,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:28,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:10:28,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935256902] [2019-10-15 01:10:28,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:28,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:28,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202307386] [2019-10-15 01:10:28,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:28,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:28,188 INFO L87 Difference]: Start difference. First operand 6040 states and 9809 transitions. Second operand 7 states. [2019-10-15 01:10:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:31,052 INFO L93 Difference]: Finished difference Result 18074 states and 30004 transitions. [2019-10-15 01:10:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:31,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-15 01:10:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:31,136 INFO L225 Difference]: With dead ends: 18074 [2019-10-15 01:10:31,136 INFO L226 Difference]: Without dead ends: 12068 [2019-10-15 01:10:31,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12068 states. [2019-10-15 01:10:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12068 to 11940. [2019-10-15 01:10:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2019-10-15 01:10:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 19689 transitions. [2019-10-15 01:10:31,660 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 19689 transitions. Word has length 140 [2019-10-15 01:10:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:31,662 INFO L462 AbstractCegarLoop]: Abstraction has 11940 states and 19689 transitions. [2019-10-15 01:10:31,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 19689 transitions. [2019-10-15 01:10:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:10:31,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:31,667 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:31,667 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1819027569, now seen corresponding path program 1 times [2019-10-15 01:10:31,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:31,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25239482] [2019-10-15 01:10:31,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:31,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:31,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:10:31,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25239482] [2019-10-15 01:10:31,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:31,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:31,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044068883] [2019-10-15 01:10:31,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:31,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:31,791 INFO L87 Difference]: Start difference. First operand 11940 states and 19689 transitions. Second operand 4 states. [2019-10-15 01:10:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:32,188 INFO L93 Difference]: Finished difference Result 23908 states and 39885 transitions. [2019-10-15 01:10:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:32,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-15 01:10:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:32,285 INFO L225 Difference]: With dead ends: 23908 [2019-10-15 01:10:32,285 INFO L226 Difference]: Without dead ends: 11996 [2019-10-15 01:10:32,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11996 states. [2019-10-15 01:10:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11996 to 11948. [2019-10-15 01:10:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11948 states. [2019-10-15 01:10:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11948 states to 11948 states and 19640 transitions. [2019-10-15 01:10:32,951 INFO L78 Accepts]: Start accepts. Automaton has 11948 states and 19640 transitions. Word has length 141 [2019-10-15 01:10:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:32,952 INFO L462 AbstractCegarLoop]: Abstraction has 11948 states and 19640 transitions. [2019-10-15 01:10:32,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 11948 states and 19640 transitions. [2019-10-15 01:10:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:10:32,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:32,963 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:32,964 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1952473812, now seen corresponding path program 1 times [2019-10-15 01:10:32,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:32,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567304615] [2019-10-15 01:10:32,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:32,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:32,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:33,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567304615] [2019-10-15 01:10:33,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:33,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:33,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935243736] [2019-10-15 01:10:33,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:33,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:33,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:33,387 INFO L87 Difference]: Start difference. First operand 11948 states and 19640 transitions. Second operand 7 states. [2019-10-15 01:10:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:36,784 INFO L93 Difference]: Finished difference Result 35914 states and 60647 transitions. [2019-10-15 01:10:36,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:36,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-10-15 01:10:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:36,985 INFO L225 Difference]: With dead ends: 35914 [2019-10-15 01:10:36,986 INFO L226 Difference]: Without dead ends: 24000 [2019-10-15 01:10:37,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24000 states. [2019-10-15 01:10:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24000 to 23804. [2019-10-15 01:10:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23804 states. [2019-10-15 01:10:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23804 states to 23804 states and 39994 transitions. [2019-10-15 01:10:37,920 INFO L78 Accepts]: Start accepts. Automaton has 23804 states and 39994 transitions. Word has length 150 [2019-10-15 01:10:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:37,921 INFO L462 AbstractCegarLoop]: Abstraction has 23804 states and 39994 transitions. [2019-10-15 01:10:37,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 23804 states and 39994 transitions. [2019-10-15 01:10:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:10:37,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:37,927 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:37,927 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash 48665393, now seen corresponding path program 1 times [2019-10-15 01:10:37,928 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:37,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535985599] [2019-10-15 01:10:37,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:37,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:37,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 01:10:38,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535985599] [2019-10-15 01:10:38,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:38,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:38,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344767310] [2019-10-15 01:10:38,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:38,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:38,043 INFO L87 Difference]: Start difference. First operand 23804 states and 39994 transitions. Second operand 4 states. [2019-10-15 01:10:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:38,867 INFO L93 Difference]: Finished difference Result 47704 states and 81377 transitions. [2019-10-15 01:10:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:38,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-15 01:10:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:39,056 INFO L225 Difference]: With dead ends: 47704 [2019-10-15 01:10:39,056 INFO L226 Difference]: Without dead ends: 23926 [2019-10-15 01:10:39,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23926 states. [2019-10-15 01:10:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23926 to 23826. [2019-10-15 01:10:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23826 states.