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_spec9_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:12:07,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:12:07,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:12:07,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:12:07,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:12:07,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:12:07,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:12:07,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:12:07,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:12:07,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:12:07,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:12:07,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:12:07,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:12:07,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:12:07,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:12:07,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:12:07,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:12:07,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:12:07,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:12:07,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:12:07,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:12:07,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:12:07,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:12:07,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:12:07,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:12:07,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:12:07,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:12:07,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:12:07,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:12:07,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:12:07,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:12:07,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:12:07,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:12:07,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:12:07,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:12:07,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:12:07,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:12:07,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:12:07,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:12:07,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:12:07,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:12:07,201 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-13 21:12:07,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:12:07,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:12:07,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:12:07,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:12:07,217 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:12:07,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:12:07,218 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:12:07,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:12:07,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:12:07,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:12:07,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:12:07,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:12:07,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:12:07,219 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:12:07,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:12:07,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:12:07,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:12:07,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:12:07,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:12:07,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:12:07,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:12:07,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:07,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:12:07,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:12:07,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:12:07,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:12:07,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:12:07,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:12:07,222 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-13 21:12:07,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:12:07,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:12:07,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:12:07,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:12:07,549 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:12:07,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-10-13 21:12:07,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c506273b9/234ae688383748bab49a508903c53231/FLAG1eb2eb948 [2019-10-13 21:12:08,283 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:12:08,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-10-13 21:12:08,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c506273b9/234ae688383748bab49a508903c53231/FLAG1eb2eb948 [2019-10-13 21:12:08,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c506273b9/234ae688383748bab49a508903c53231 [2019-10-13 21:12:08,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:12:08,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:12:08,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:08,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:12:08,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:12:08,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:08" (1/1) ... [2019-10-13 21:12:08,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12de4e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:08, skipping insertion in model container [2019-10-13 21:12:08,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:08" (1/1) ... [2019-10-13 21:12:08,516 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:12:08,597 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:12:09,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:09,347 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:12:09,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:09,602 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:12:09,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09 WrapperNode [2019-10-13 21:12:09,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:09,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:12:09,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:12:09,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:12:09,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (1/1) ... [2019-10-13 21:12:09,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (1/1) ... [2019-10-13 21:12:09,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (1/1) ... [2019-10-13 21:12:09,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (1/1) ... [2019-10-13 21:12:09,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (1/1) ... [2019-10-13 21:12:09,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (1/1) ... [2019-10-13 21:12:09,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (1/1) ... [2019-10-13 21:12:09,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:12:09,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:12:09,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:12:09,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:12:09,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (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-13 21:12:09,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:12:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:12:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:12:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:12:09,893 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:12:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:12:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:12:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:12:09,894 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:12:09,895 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:12:09,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:12:09,895 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:12:09,896 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:12:09,896 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:12:09,896 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:12:09,896 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:12:09,897 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:12:09,897 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:12:09,897 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:12:09,897 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:12:09,898 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:12:09,898 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:12:09,898 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:12:09,898 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:12:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:12:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:12:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:12:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:12:09,900 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:12:09,900 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:12:09,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:12:09,900 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:12:09,900 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:12:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:12:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:12:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:12:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:12:09,901 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:12:09,902 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:12:09,902 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:12:09,902 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:12:09,902 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:12:09,902 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:12:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:12:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:12:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:12:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:12:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:12:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:12:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:12:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:12:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:12:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:12:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:12:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:09,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:12:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:12:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:12:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:12:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:12:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:12:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:12:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:12:09,908 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:12:09,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:12:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:12:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:12:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:12:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:12:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:12:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:12:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:12:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:12:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:12:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:12:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:12:09,911 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:12:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:12:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:12:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:12:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:12:09,912 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:12:09,913 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:12:09,914 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:12:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:12:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:12:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:12:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:12:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:12:09,915 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:12:09,916 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:12:09,916 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:12:09,916 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:12:09,916 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:12:09,916 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:12:09,917 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:12:09,917 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:12:09,917 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:12:09,917 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:09,917 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:12:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:12:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:12:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:12:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:12:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:12:09,918 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:12:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:12:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:12:09,919 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:12:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:12:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:12:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:12:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:09,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:12:09,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:12:09,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:12:09,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:12:09,921 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:09,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:12:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:12:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:12:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:12:09,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:12:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:12:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:12:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:12:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:12:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:12:09,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:12:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:12:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:12:12,216 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:12:12,216 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:12:12,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:12 BoogieIcfgContainer [2019-10-13 21:12:12,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:12:12,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:12:12,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:12:12,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:12:12,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:12:08" (1/3) ... [2019-10-13 21:12:12,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec4268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:12, skipping insertion in model container [2019-10-13 21:12:12,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:09" (2/3) ... [2019-10-13 21:12:12,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec4268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:12, skipping insertion in model container [2019-10-13 21:12:12,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:12" (3/3) ... [2019-10-13 21:12:12,228 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product09.cil.c [2019-10-13 21:12:12,240 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:12:12,252 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:12:12,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:12:12,299 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:12:12,299 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:12:12,299 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:12:12,300 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:12:12,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:12:12,300 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:12:12,300 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:12:12,300 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:12:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states. [2019-10-13 21:12:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:12:12,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:12,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:12,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:12,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1110601002, now seen corresponding path program 1 times [2019-10-13 21:12:12,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:12,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839067970] [2019-10-13 21:12:12,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:12,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:12,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:12,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839067970] [2019-10-13 21:12:13,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:13,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:13,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540245597] [2019-10-13 21:12:13,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:13,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:13,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:13,025 INFO L87 Difference]: Start difference. First operand 728 states. Second operand 4 states. [2019-10-13 21:12:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:13,208 INFO L93 Difference]: Finished difference Result 1119 states and 1831 transitions. [2019-10-13 21:12:13,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:13,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 21:12:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:13,248 INFO L225 Difference]: With dead ends: 1119 [2019-10-13 21:12:13,248 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 21:12:13,261 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-13 21:12:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 21:12:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-13 21:12:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 21:12:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 917 transitions. [2019-10-13 21:12:13,433 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 917 transitions. Word has length 109 [2019-10-13 21:12:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:13,434 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 917 transitions. [2019-10-13 21:12:13,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 917 transitions. [2019-10-13 21:12:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:12:13,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:13,446 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:13,446 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:13,448 INFO L82 PathProgramCache]: Analyzing trace with hash 513878495, now seen corresponding path program 1 times [2019-10-13 21:12:13,448 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:13,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014936743] [2019-10-13 21:12:13,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:13,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:13,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:13,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014936743] [2019-10-13 21:12:13,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:13,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:13,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080924053] [2019-10-13 21:12:13,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:13,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:13,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:13,694 INFO L87 Difference]: Start difference. First operand 568 states and 917 transitions. Second operand 4 states. [2019-10-13 21:12:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:13,777 INFO L93 Difference]: Finished difference Result 1099 states and 1792 transitions. [2019-10-13 21:12:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:13,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:12:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:13,783 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:12:13,784 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 21:12:13,787 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-13 21:12:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 21:12:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-13 21:12:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 21:12:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 916 transitions. [2019-10-13 21:12:13,844 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 916 transitions. Word has length 112 [2019-10-13 21:12:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:13,847 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 916 transitions. [2019-10-13 21:12:13,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 916 transitions. [2019-10-13 21:12:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:12:13,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:13,853 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:13,853 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash -899322139, now seen corresponding path program 1 times [2019-10-13 21:12:13,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:13,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669387208] [2019-10-13 21:12:13,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:13,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:13,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:14,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669387208] [2019-10-13 21:12:14,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:14,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:14,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329845343] [2019-10-13 21:12:14,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:14,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:14,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:14,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:14,046 INFO L87 Difference]: Start difference. First operand 568 states and 916 transitions. Second operand 4 states. [2019-10-13 21:12:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:14,120 INFO L93 Difference]: Finished difference Result 1099 states and 1791 transitions. [2019-10-13 21:12:14,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:14,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:12:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:14,133 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:12:14,133 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 21:12:14,138 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-13 21:12:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 21:12:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-13 21:12:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 21:12:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 915 transitions. [2019-10-13 21:12:14,191 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 915 transitions. Word has length 113 [2019-10-13 21:12:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:14,192 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 915 transitions. [2019-10-13 21:12:14,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 915 transitions. [2019-10-13 21:12:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:12:14,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:14,197 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:14,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash 251093531, now seen corresponding path program 1 times [2019-10-13 21:12:14,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:14,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552161795] [2019-10-13 21:12:14,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:14,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:14,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:14,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552161795] [2019-10-13 21:12:14,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:14,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:14,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154602193] [2019-10-13 21:12:14,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:14,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:14,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:14,356 INFO L87 Difference]: Start difference. First operand 568 states and 915 transitions. Second operand 4 states. [2019-10-13 21:12:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:14,440 INFO L93 Difference]: Finished difference Result 1099 states and 1790 transitions. [2019-10-13 21:12:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:14,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:12:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:14,448 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:12:14,448 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 21:12:14,452 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-13 21:12:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 21:12:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-13 21:12:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 21:12:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-10-13 21:12:14,488 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-10-13 21:12:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:14,490 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-10-13 21:12:14,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-10-13 21:12:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:12:14,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:14,495 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:14,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:14,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:14,496 INFO L82 PathProgramCache]: Analyzing trace with hash -730763999, now seen corresponding path program 1 times [2019-10-13 21:12:14,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:14,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054683372] [2019-10-13 21:12:14,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:14,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:14,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:14,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054683372] [2019-10-13 21:12:14,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:14,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:14,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116755652] [2019-10-13 21:12:14,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:14,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:14,655 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-10-13 21:12:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:14,710 INFO L93 Difference]: Finished difference Result 1099 states and 1789 transitions. [2019-10-13 21:12:14,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:14,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-13 21:12:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:14,716 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:12:14,716 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 21:12:14,720 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-13 21:12:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 21:12:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-13 21:12:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 21:12:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 913 transitions. [2019-10-13 21:12:14,744 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 913 transitions. Word has length 115 [2019-10-13 21:12:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:14,745 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 913 transitions. [2019-10-13 21:12:14,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 913 transitions. [2019-10-13 21:12:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:12:14,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:14,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:14,749 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:14,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash 906386007, now seen corresponding path program 1 times [2019-10-13 21:12:14,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:14,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836906326] [2019-10-13 21:12:14,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:14,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:14,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:15,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836906326] [2019-10-13 21:12:15,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:15,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:15,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780915043] [2019-10-13 21:12:15,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:15,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:15,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:15,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:15,100 INFO L87 Difference]: Start difference. First operand 568 states and 913 transitions. Second operand 10 states. [2019-10-13 21:12:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:15,260 INFO L93 Difference]: Finished difference Result 1057 states and 1709 transitions. [2019-10-13 21:12:15,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:15,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-10-13 21:12:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:15,271 INFO L225 Difference]: With dead ends: 1057 [2019-10-13 21:12:15,271 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:12:15,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:12:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:12:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-13 21:12:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-13 21:12:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 922 transitions. [2019-10-13 21:12:15,308 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 922 transitions. Word has length 116 [2019-10-13 21:12:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:15,309 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 922 transitions. [2019-10-13 21:12:15,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 922 transitions. [2019-10-13 21:12:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:12:15,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:15,317 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:15,318 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash 335134774, now seen corresponding path program 1 times [2019-10-13 21:12:15,318 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:15,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923617652] [2019-10-13 21:12:15,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:15,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923617652] [2019-10-13 21:12:15,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:15,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:15,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705908037] [2019-10-13 21:12:15,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:15,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:15,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:15,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:15,434 INFO L87 Difference]: Start difference. First operand 575 states and 922 transitions. Second operand 4 states. [2019-10-13 21:12:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:15,505 INFO L93 Difference]: Finished difference Result 1105 states and 1795 transitions. [2019-10-13 21:12:15,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:15,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-13 21:12:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:15,512 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:12:15,513 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:15,516 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-13 21:12:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 899 transitions. [2019-10-13 21:12:15,542 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 899 transitions. Word has length 116 [2019-10-13 21:12:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:15,542 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 899 transitions. [2019-10-13 21:12:15,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 899 transitions. [2019-10-13 21:12:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:12:15,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:15,547 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:15,547 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1313046375, now seen corresponding path program 1 times [2019-10-13 21:12:15,548 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:15,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480756598] [2019-10-13 21:12:15,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,548 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:15,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480756598] [2019-10-13 21:12:15,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:15,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:15,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980683906] [2019-10-13 21:12:15,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:15,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:15,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:15,701 INFO L87 Difference]: Start difference. First operand 562 states and 899 transitions. Second operand 6 states. [2019-10-13 21:12:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,003 INFO L93 Difference]: Finished difference Result 1045 states and 1687 transitions. [2019-10-13 21:12:16,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:16,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-13 21:12:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,009 INFO L225 Difference]: With dead ends: 1045 [2019-10-13 21:12:16,009 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:16,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 895 transitions. [2019-10-13 21:12:16,038 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 895 transitions. Word has length 117 [2019-10-13 21:12:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:16,041 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 895 transitions. [2019-10-13 21:12:16,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 895 transitions. [2019-10-13 21:12:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:12:16,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:16,045 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:16,045 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1293617158, now seen corresponding path program 1 times [2019-10-13 21:12:16,046 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:16,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42998403] [2019-10-13 21:12:16,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:16,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42998403] [2019-10-13 21:12:16,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:16,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434941598] [2019-10-13 21:12:16,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:16,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:16,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:16,203 INFO L87 Difference]: Start difference. First operand 562 states and 895 transitions. Second operand 6 states. [2019-10-13 21:12:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,408 INFO L93 Difference]: Finished difference Result 1045 states and 1683 transitions. [2019-10-13 21:12:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:16,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-13 21:12:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,414 INFO L225 Difference]: With dead ends: 1045 [2019-10-13 21:12:16,414 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:16,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 891 transitions. [2019-10-13 21:12:16,440 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 891 transitions. Word has length 118 [2019-10-13 21:12:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:16,440 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 891 transitions. [2019-10-13 21:12:16,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 891 transitions. [2019-10-13 21:12:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:12:16,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:16,444 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:16,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1173950530, now seen corresponding path program 1 times [2019-10-13 21:12:16,445 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:16,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394766847] [2019-10-13 21:12:16,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:16,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394766847] [2019-10-13 21:12:16,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:16,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652180581] [2019-10-13 21:12:16,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:16,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:16,579 INFO L87 Difference]: Start difference. First operand 562 states and 891 transitions. Second operand 6 states. [2019-10-13 21:12:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,751 INFO L93 Difference]: Finished difference Result 1045 states and 1679 transitions. [2019-10-13 21:12:16,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:16,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 21:12:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,757 INFO L225 Difference]: With dead ends: 1045 [2019-10-13 21:12:16,757 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:16,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 887 transitions. [2019-10-13 21:12:16,779 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 887 transitions. Word has length 119 [2019-10-13 21:12:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:16,779 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 887 transitions. [2019-10-13 21:12:16,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 887 transitions. [2019-10-13 21:12:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:12:16,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:16,783 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:16,783 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2140246978, now seen corresponding path program 1 times [2019-10-13 21:12:16,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:16,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114613773] [2019-10-13 21:12:16,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:16,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114613773] [2019-10-13 21:12:16,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:16,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060811342] [2019-10-13 21:12:16,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:16,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:16,970 INFO L87 Difference]: Start difference. First operand 562 states and 887 transitions. Second operand 7 states. [2019-10-13 21:12:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,058 INFO L93 Difference]: Finished difference Result 1045 states and 1675 transitions. [2019-10-13 21:12:17,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:12:17,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-10-13 21:12:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,064 INFO L225 Difference]: With dead ends: 1045 [2019-10-13 21:12:17,064 INFO L226 Difference]: Without dead ends: 541 [2019-10-13 21:12:17,067 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-13 21:12:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-13 21:12:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-13 21:12:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-13 21:12:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 853 transitions. [2019-10-13 21:12:17,088 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 853 transitions. Word has length 119 [2019-10-13 21:12:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,088 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 853 transitions. [2019-10-13 21:12:17,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 853 transitions. [2019-10-13 21:12:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:12:17,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,092 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:17,092 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2053075839, now seen corresponding path program 1 times [2019-10-13 21:12:17,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969476049] [2019-10-13 21:12:17,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:17,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969476049] [2019-10-13 21:12:17,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:17,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289324407] [2019-10-13 21:12:17,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:17,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:17,243 INFO L87 Difference]: Start difference. First operand 541 states and 853 transitions. Second operand 6 states. [2019-10-13 21:12:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,336 INFO L93 Difference]: Finished difference Result 1024 states and 1641 transitions. [2019-10-13 21:12:17,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:17,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-13 21:12:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,342 INFO L225 Difference]: With dead ends: 1024 [2019-10-13 21:12:17,342 INFO L226 Difference]: Without dead ends: 541 [2019-10-13 21:12:17,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-13 21:12:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-13 21:12:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-13 21:12:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 852 transitions. [2019-10-13 21:12:17,365 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 852 transitions. Word has length 120 [2019-10-13 21:12:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,366 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 852 transitions. [2019-10-13 21:12:17,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 852 transitions. [2019-10-13 21:12:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:12:17,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,370 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:17,370 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1470960925, now seen corresponding path program 1 times [2019-10-13 21:12:17,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418612609] [2019-10-13 21:12:17,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:17,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418612609] [2019-10-13 21:12:17,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:17,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601645185] [2019-10-13 21:12:17,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:17,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:17,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:17,492 INFO L87 Difference]: Start difference. First operand 541 states and 852 transitions. Second operand 6 states. [2019-10-13 21:12:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,615 INFO L93 Difference]: Finished difference Result 1024 states and 1640 transitions. [2019-10-13 21:12:17,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:17,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-13 21:12:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,622 INFO L225 Difference]: With dead ends: 1024 [2019-10-13 21:12:17,622 INFO L226 Difference]: Without dead ends: 541 [2019-10-13 21:12:17,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-13 21:12:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-13 21:12:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-13 21:12:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 851 transitions. [2019-10-13 21:12:17,653 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 851 transitions. Word has length 121 [2019-10-13 21:12:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,653 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 851 transitions. [2019-10-13 21:12:17,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 851 transitions. [2019-10-13 21:12:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:12:17,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:17,659 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash 470409988, now seen corresponding path program 1 times [2019-10-13 21:12:17,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995080916] [2019-10-13 21:12:17,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:17,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995080916] [2019-10-13 21:12:17,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:12:17,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862219121] [2019-10-13 21:12:17,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:12:17,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:12:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:17,998 INFO L87 Difference]: Start difference. First operand 541 states and 851 transitions. Second operand 12 states. [2019-10-13 21:12:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,222 INFO L93 Difference]: Finished difference Result 1025 states and 1639 transitions. [2019-10-13 21:12:18,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:12:18,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-13 21:12:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,228 INFO L225 Difference]: With dead ends: 1025 [2019-10-13 21:12:18,229 INFO L226 Difference]: Without dead ends: 541 [2019-10-13 21:12:18,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:12:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-13 21:12:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-13 21:12:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-13 21:12:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 850 transitions. [2019-10-13 21:12:18,256 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 850 transitions. Word has length 122 [2019-10-13 21:12:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,256 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 850 transitions. [2019-10-13 21:12:18,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:12:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 850 transitions. [2019-10-13 21:12:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:12:18,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:18,261 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 213763234, now seen corresponding path program 1 times [2019-10-13 21:12:18,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902665942] [2019-10-13 21:12:18,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:18,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902665942] [2019-10-13 21:12:18,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:12:18,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127960654] [2019-10-13 21:12:18,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:12:18,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:12:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:18,436 INFO L87 Difference]: Start difference. First operand 541 states and 850 transitions. Second operand 9 states. [2019-10-13 21:12:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:21,770 INFO L93 Difference]: Finished difference Result 1022 states and 1653 transitions. [2019-10-13 21:12:21,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:12:21,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-10-13 21:12:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:21,777 INFO L225 Difference]: With dead ends: 1022 [2019-10-13 21:12:21,777 INFO L226 Difference]: Without dead ends: 547 [2019-10-13 21:12:21,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-13 21:12:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2019-10-13 21:12:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-13 21:12:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 869 transitions. [2019-10-13 21:12:21,805 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 869 transitions. Word has length 123 [2019-10-13 21:12:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:21,806 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 869 transitions. [2019-10-13 21:12:21,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:12:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 869 transitions. [2019-10-13 21:12:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 21:12:21,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:21,810 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:21,810 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash 121735372, now seen corresponding path program 1 times [2019-10-13 21:12:21,811 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:21,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010777053] [2019-10-13 21:12:21,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:21,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010777053] [2019-10-13 21:12:21,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:21,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:12:21,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394284841] [2019-10-13 21:12:21,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:12:21,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:12:21,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:21,956 INFO L87 Difference]: Start difference. First operand 545 states and 869 transitions. Second operand 8 states. [2019-10-13 21:12:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:27,811 INFO L93 Difference]: Finished difference Result 1906 states and 3168 transitions. [2019-10-13 21:12:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:12:27,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-10-13 21:12:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:27,825 INFO L225 Difference]: With dead ends: 1906 [2019-10-13 21:12:27,825 INFO L226 Difference]: Without dead ends: 1427 [2019-10-13 21:12:27,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:12:27,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-10-13 21:12:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1388. [2019-10-13 21:12:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-10-13 21:12:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2236 transitions. [2019-10-13 21:12:27,901 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2236 transitions. Word has length 124 [2019-10-13 21:12:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:27,902 INFO L462 AbstractCegarLoop]: Abstraction has 1388 states and 2236 transitions. [2019-10-13 21:12:27,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:12:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2236 transitions. [2019-10-13 21:12:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:12:27,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:27,906 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:27,906 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:27,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:27,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1651184340, now seen corresponding path program 1 times [2019-10-13 21:12:27,907 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:27,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367879652] [2019-10-13 21:12:27,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:28,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367879652] [2019-10-13 21:12:28,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:28,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:28,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61123738] [2019-10-13 21:12:28,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:28,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:28,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:28,061 INFO L87 Difference]: Start difference. First operand 1388 states and 2236 transitions. Second operand 7 states. [2019-10-13 21:12:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:32,078 INFO L93 Difference]: Finished difference Result 3556 states and 5866 transitions. [2019-10-13 21:12:32,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:12:32,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-13 21:12:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:32,101 INFO L225 Difference]: With dead ends: 3556 [2019-10-13 21:12:32,102 INFO L226 Difference]: Without dead ends: 2572 [2019-10-13 21:12:32,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:12:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-10-13 21:12:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2516. [2019-10-13 21:12:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2019-10-13 21:12:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4112 transitions. [2019-10-13 21:12:32,244 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4112 transitions. Word has length 130 [2019-10-13 21:12:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:32,245 INFO L462 AbstractCegarLoop]: Abstraction has 2516 states and 4112 transitions. [2019-10-13 21:12:32,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4112 transitions. [2019-10-13 21:12:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:12:32,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:32,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:32,249 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash -220068901, now seen corresponding path program 1 times [2019-10-13 21:12:32,250 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:32,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151747426] [2019-10-13 21:12:32,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:32,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151747426] [2019-10-13 21:12:32,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:32,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:12:32,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203499913] [2019-10-13 21:12:32,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:12:32,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:32,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:12:32,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:32,370 INFO L87 Difference]: Start difference. First operand 2516 states and 4112 transitions. Second operand 5 states. [2019-10-13 21:12:32,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:32,515 INFO L93 Difference]: Finished difference Result 4632 states and 7632 transitions. [2019-10-13 21:12:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:32,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-13 21:12:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:32,536 INFO L225 Difference]: With dead ends: 4632 [2019-10-13 21:12:32,536 INFO L226 Difference]: Without dead ends: 2575 [2019-10-13 21:12:32,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-10-13 21:12:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2542. [2019-10-13 21:12:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-10-13 21:12:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4149 transitions. [2019-10-13 21:12:32,715 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4149 transitions. Word has length 135 [2019-10-13 21:12:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:32,715 INFO L462 AbstractCegarLoop]: Abstraction has 2542 states and 4149 transitions. [2019-10-13 21:12:32,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:12:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4149 transitions. [2019-10-13 21:12:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:12:32,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:32,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:32,720 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1523775240, now seen corresponding path program 1 times [2019-10-13 21:12:32,720 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:32,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025322129] [2019-10-13 21:12:32,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:32,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025322129] [2019-10-13 21:12:32,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:32,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:32,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221553697] [2019-10-13 21:12:32,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:32,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:32,885 INFO L87 Difference]: Start difference. First operand 2542 states and 4149 transitions. Second operand 7 states. [2019-10-13 21:12:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:33,115 INFO L93 Difference]: Finished difference Result 4920 states and 8196 transitions. [2019-10-13 21:12:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:12:33,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-13 21:12:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:33,137 INFO L225 Difference]: With dead ends: 4920 [2019-10-13 21:12:33,137 INFO L226 Difference]: Without dead ends: 2542 [2019-10-13 21:12:33,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-13 21:12:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2019-10-13 21:12:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2019-10-13 21:12:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-10-13 21:12:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4103 transitions. [2019-10-13 21:12:33,274 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4103 transitions. Word has length 142 [2019-10-13 21:12:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:33,276 INFO L462 AbstractCegarLoop]: Abstraction has 2542 states and 4103 transitions. [2019-10-13 21:12:33,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4103 transitions. [2019-10-13 21:12:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:12:33,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:33,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:33,282 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:33,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1238042262, now seen corresponding path program 1 times [2019-10-13 21:12:33,283 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:33,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4384523] [2019-10-13 21:12:33,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:33,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:33,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:12:33,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4384523] [2019-10-13 21:12:33,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:33,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:33,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543110129] [2019-10-13 21:12:33,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:33,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:33,460 INFO L87 Difference]: Start difference. First operand 2542 states and 4103 transitions. Second operand 7 states. [2019-10-13 21:12:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:37,644 INFO L93 Difference]: Finished difference Result 4799 states and 7785 transitions. [2019-10-13 21:12:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:12:37,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-13 21:12:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:37,664 INFO L225 Difference]: With dead ends: 4799 [2019-10-13 21:12:37,664 INFO L226 Difference]: Without dead ends: 2725 [2019-10-13 21:12:37,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:12:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-10-13 21:12:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2658. [2019-10-13 21:12:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-10-13 21:12:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4259 transitions. [2019-10-13 21:12:37,792 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4259 transitions. Word has length 147 [2019-10-13 21:12:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:37,793 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 4259 transitions. [2019-10-13 21:12:37,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4259 transitions. [2019-10-13 21:12:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:12:37,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:37,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:37,798 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash 872238315, now seen corresponding path program 1 times [2019-10-13 21:12:37,799 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:37,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814923188] [2019-10-13 21:12:37,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:37,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:37,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:12:38,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814923188] [2019-10-13 21:12:38,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:38,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 21:12:38,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516418272] [2019-10-13 21:12:38,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:12:38,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:12:38,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:12:38,121 INFO L87 Difference]: Start difference. First operand 2658 states and 4259 transitions. Second operand 11 states.