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_spec2_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:22,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:22,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:22,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:22,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:22,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:22,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:22,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:22,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:22,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:22,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:22,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:22,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:22,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:22,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:22,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:22,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:22,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:22,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:22,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:22,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:22,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:22,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:22,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:22,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:22,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:22,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:22,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:22,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:22,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:22,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:22,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:22,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:22,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:22,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:22,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:22,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:22,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:22,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:22,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:22,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:22,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:09:22,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:22,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:22,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:22,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:22,694 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:22,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:22,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:22,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:22,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:22,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:22,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:22,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:22,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:22,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:22,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:22,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:22,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:22,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:22,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:22,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:22,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:22,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:22,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:22,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:22,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:22,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:22,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:22,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:22,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:09:22,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:22,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:23,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:23,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:23,002 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:23,002 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-10-15 01:09:23,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047508610/963a5e8baacc491485d04ba618f63629/FLAG789eaefff [2019-10-15 01:09:23,765 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:23,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-10-15 01:09:23,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047508610/963a5e8baacc491485d04ba618f63629/FLAG789eaefff [2019-10-15 01:09:23,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047508610/963a5e8baacc491485d04ba618f63629 [2019-10-15 01:09:23,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:23,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:23,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:23,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:23,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:23,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:23" (1/1) ... [2019-10-15 01:09:23,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d98df98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:23, skipping insertion in model container [2019-10-15 01:09:23,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:23" (1/1) ... [2019-10-15 01:09:23,980 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:24,068 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:24,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:24,795 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:24,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:25,012 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:25,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25 WrapperNode [2019-10-15 01:09:25,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:25,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:25,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:25,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:25,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:09:25,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:09:25,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:09:25,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:09:25,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:25,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:09:25,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:09:25,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:25,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:09:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:09:25,307 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:09:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:09:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:09:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:25,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:25,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:25,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:25,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:09:25,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:09:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:09:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:09:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:09:25,314 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:09:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:09:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:09:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:09:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:09:25,316 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:09:25,316 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:09:25,316 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:09:25,316 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:09:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:09:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:09:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:09:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:09:25,318 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:09:25,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:09:25,319 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:09:25,319 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:09:25,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:09:25,320 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:09:25,320 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:09:25,320 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:09:25,320 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:09:25,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:09:25,321 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:09:25,321 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:09:25,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:09:25,321 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:09:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:09:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:09:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:09:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:09:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:09:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:09:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:09:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:09:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:09:25,323 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:09:25,324 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:09:25,324 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:09:25,324 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:09:25,324 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:09:25,325 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:09:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:09:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:09:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:09:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:09:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:09:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:09:25,328 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:09:25,328 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:09:25,328 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:09:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:09:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:09:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:09:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:09:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:09:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:09:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:09:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:09:25,332 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:09:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:09:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:09:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:25,335 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:25,336 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:09:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:09:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:09:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:09:25,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:09:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:09:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:09:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:25,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:09:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:09:25,339 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:09:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:09:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:09:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:09:25,340 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:09:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:09:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:09:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:09:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:09:25,341 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:09:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:09:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:09:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:09:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:09:25,342 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:09:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:09:25,343 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:09:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:09:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:09:25,344 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:09:25,345 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:09:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:09:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:09:25,346 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:09:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:09:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:09:25,348 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:09:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:09:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:09:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:09:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:09:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:09:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:09:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:09:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:09:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:09:25,351 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:09:25,354 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:09:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:09:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:09:25,355 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:09:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:09:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:09:25,356 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:09:25,363 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:09:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:09:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:09:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:09:25,364 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:09:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:09:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:09:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:09:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:09:25,365 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:09:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:09:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:09:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:09:25,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:09:27,688 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:09:27,689 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:09:27,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:27 BoogieIcfgContainer [2019-10-15 01:09:27,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:09:27,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:09:27,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:09:27,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:09:27,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:23" (1/3) ... [2019-10-15 01:09:27,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb03b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:27, skipping insertion in model container [2019-10-15 01:09:27,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (2/3) ... [2019-10-15 01:09:27,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb03b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:27, skipping insertion in model container [2019-10-15 01:09:27,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:27" (3/3) ... [2019-10-15 01:09:27,701 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product01.cil.c [2019-10-15 01:09:27,713 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:09:27,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:09:27,735 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:09:27,767 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:09:27,767 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:09:27,767 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:09:27,767 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:09:27,767 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:09:27,767 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:09:27,768 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:09:27,768 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:09:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states. [2019-10-15 01:09:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:09:27,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:27,828 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] [2019-10-15 01:09:27,833 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash 579631, now seen corresponding path program 1 times [2019-10-15 01:09:27,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:27,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758249038] [2019-10-15 01:09:27,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:27,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:27,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:28,456 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-15 01:09:28,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758249038] [2019-10-15 01:09:28,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:28,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:28,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55827722] [2019-10-15 01:09:28,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:28,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:28,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:28,485 INFO L87 Difference]: Start difference. First operand 721 states. Second operand 4 states. [2019-10-15 01:09:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:28,707 INFO L93 Difference]: Finished difference Result 1105 states and 1815 transitions. [2019-10-15 01:09:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:28,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:09:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:28,745 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:09:28,745 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:09:28,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:09:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-15 01:09:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 01:09:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 909 transitions. [2019-10-15 01:09:28,896 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 909 transitions. Word has length 107 [2019-10-15 01:09:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:28,897 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 909 transitions. [2019-10-15 01:09:28,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 909 transitions. [2019-10-15 01:09:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:09:28,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:28,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] [2019-10-15 01:09:28,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:28,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1624649059, now seen corresponding path program 1 times [2019-10-15 01:09:28,907 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:28,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250280913] [2019-10-15 01:09:28,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:28,908 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:28,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:29,069 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-15 01:09:29,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250280913] [2019-10-15 01:09:29,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:29,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:29,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764078955] [2019-10-15 01:09:29,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:29,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:29,075 INFO L87 Difference]: Start difference. First operand 561 states and 909 transitions. Second operand 4 states. [2019-10-15 01:09:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:29,158 INFO L93 Difference]: Finished difference Result 1085 states and 1776 transitions. [2019-10-15 01:09:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:29,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-15 01:09:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:29,166 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:09:29,166 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:09:29,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:09:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-15 01:09:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 01:09:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 908 transitions. [2019-10-15 01:09:29,239 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 908 transitions. Word has length 110 [2019-10-15 01:09:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:29,243 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 908 transitions. [2019-10-15 01:09:29,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 908 transitions. [2019-10-15 01:09:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:09:29,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:29,248 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] [2019-10-15 01:09:29,248 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:29,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1144681058, now seen corresponding path program 1 times [2019-10-15 01:09:29,249 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:29,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910117419] [2019-10-15 01:09:29,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:29,521 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-15 01:09:29,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910117419] [2019-10-15 01:09:29,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:29,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:29,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662260364] [2019-10-15 01:09:29,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:29,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:29,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:29,525 INFO L87 Difference]: Start difference. First operand 561 states and 908 transitions. Second operand 4 states. [2019-10-15 01:09:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:29,602 INFO L93 Difference]: Finished difference Result 1085 states and 1775 transitions. [2019-10-15 01:09:29,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:29,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-15 01:09:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:29,612 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:09:29,613 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:09:29,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:09:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-15 01:09:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 01:09:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 907 transitions. [2019-10-15 01:09:29,658 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 907 transitions. Word has length 111 [2019-10-15 01:09:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:29,659 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 907 transitions. [2019-10-15 01:09:29,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 907 transitions. [2019-10-15 01:09:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:09:29,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:29,664 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-15 01:09:29,664 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1767474887, now seen corresponding path program 1 times [2019-10-15 01:09:29,665 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:29,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267878014] [2019-10-15 01:09:29,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:29,863 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-15 01:09:29,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267878014] [2019-10-15 01:09:29,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:29,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:29,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624219794] [2019-10-15 01:09:29,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:29,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:29,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:29,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:29,869 INFO L87 Difference]: Start difference. First operand 561 states and 907 transitions. Second operand 4 states. [2019-10-15 01:09:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:29,946 INFO L93 Difference]: Finished difference Result 1085 states and 1774 transitions. [2019-10-15 01:09:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:29,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:09:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:29,953 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:09:29,953 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:09:29,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:09:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-15 01:09:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 01:09:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 906 transitions. [2019-10-15 01:09:29,983 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 906 transitions. Word has length 112 [2019-10-15 01:09:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:29,984 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 906 transitions. [2019-10-15 01:09:29,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 906 transitions. [2019-10-15 01:09:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:09:29,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:29,989 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-15 01:09:29,989 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2078820218, now seen corresponding path program 1 times [2019-10-15 01:09:29,990 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:29,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505861885] [2019-10-15 01:09:29,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:30,121 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-15 01:09:30,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505861885] [2019-10-15 01:09:30,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:30,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:30,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079277475] [2019-10-15 01:09:30,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:30,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:30,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:30,124 INFO L87 Difference]: Start difference. First operand 561 states and 906 transitions. Second operand 4 states. [2019-10-15 01:09:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:30,178 INFO L93 Difference]: Finished difference Result 1085 states and 1773 transitions. [2019-10-15 01:09:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:30,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:09:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:30,183 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:09:30,183 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:09:30,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:09:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-15 01:09:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 01:09:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 905 transitions. [2019-10-15 01:09:30,207 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 905 transitions. Word has length 113 [2019-10-15 01:09:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:30,207 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 905 transitions. [2019-10-15 01:09:30,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 905 transitions. [2019-10-15 01:09:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:09:30,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:30,211 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-15 01:09:30,212 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1562015787, now seen corresponding path program 1 times [2019-10-15 01:09:30,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:30,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281024488] [2019-10-15 01:09:30,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:30,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-15 01:09:30,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281024488] [2019-10-15 01:09:30,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:30,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:09:30,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640963206] [2019-10-15 01:09:30,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:09:30,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:30,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:09:30,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:30,493 INFO L87 Difference]: Start difference. First operand 561 states and 905 transitions. Second operand 10 states. [2019-10-15 01:09:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:30,662 INFO L93 Difference]: Finished difference Result 1043 states and 1693 transitions. [2019-10-15 01:09:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:09:30,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-15 01:09:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:30,668 INFO L225 Difference]: With dead ends: 1043 [2019-10-15 01:09:30,668 INFO L226 Difference]: Without dead ends: 570 [2019-10-15 01:09:30,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:09:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-15 01:09:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-10-15 01:09:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 01:09:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-10-15 01:09:30,700 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-10-15 01:09:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:30,700 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-10-15 01:09:30,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:09:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-10-15 01:09:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:09:30,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:30,705 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-15 01:09:30,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1142498956, now seen corresponding path program 1 times [2019-10-15 01:09:30,706 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:30,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890316821] [2019-10-15 01:09:30,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,706 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:30,825 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-15 01:09:30,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890316821] [2019-10-15 01:09:30,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:30,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:30,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950153157] [2019-10-15 01:09:30,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:30,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:30,828 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-10-15 01:09:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:30,876 INFO L93 Difference]: Finished difference Result 1091 states and 1779 transitions. [2019-10-15 01:09:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:30,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:09:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:30,882 INFO L225 Difference]: With dead ends: 1091 [2019-10-15 01:09:30,882 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:30,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 891 transitions. [2019-10-15 01:09:30,907 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 891 transitions. Word has length 114 [2019-10-15 01:09:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:30,907 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 891 transitions. [2019-10-15 01:09:30,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 891 transitions. [2019-10-15 01:09:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:09:30,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:30,911 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-15 01:09:30,911 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:30,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1780568648, now seen corresponding path program 1 times [2019-10-15 01:09:30,912 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:30,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606967797] [2019-10-15 01:09:30,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:31,100 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-15 01:09:31,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606967797] [2019-10-15 01:09:31,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:31,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:31,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145970325] [2019-10-15 01:09:31,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:31,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:31,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:31,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:31,104 INFO L87 Difference]: Start difference. First operand 555 states and 891 transitions. Second operand 6 states. [2019-10-15 01:09:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:31,438 INFO L93 Difference]: Finished difference Result 1031 states and 1671 transitions. [2019-10-15 01:09:31,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:31,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-15 01:09:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:31,446 INFO L225 Difference]: With dead ends: 1031 [2019-10-15 01:09:31,446 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:31,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 887 transitions. [2019-10-15 01:09:31,473 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 887 transitions. Word has length 115 [2019-10-15 01:09:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:31,473 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 887 transitions. [2019-10-15 01:09:31,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 887 transitions. [2019-10-15 01:09:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:09:31,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:31,477 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-15 01:09:31,478 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 38803032, now seen corresponding path program 1 times [2019-10-15 01:09:31,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:31,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338966764] [2019-10-15 01:09:31,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,479 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:31,612 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-15 01:09:31,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338966764] [2019-10-15 01:09:31,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:31,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:31,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998911990] [2019-10-15 01:09:31,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:31,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:31,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:31,614 INFO L87 Difference]: Start difference. First operand 555 states and 887 transitions. Second operand 6 states. [2019-10-15 01:09:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:31,827 INFO L93 Difference]: Finished difference Result 1031 states and 1667 transitions. [2019-10-15 01:09:31,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:31,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-15 01:09:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:31,837 INFO L225 Difference]: With dead ends: 1031 [2019-10-15 01:09:31,838 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:31,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 883 transitions. [2019-10-15 01:09:31,870 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 883 transitions. Word has length 116 [2019-10-15 01:09:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:31,872 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 883 transitions. [2019-10-15 01:09:31,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 883 transitions. [2019-10-15 01:09:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:09:31,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:31,875 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-15 01:09:31,876 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1813626371, now seen corresponding path program 1 times [2019-10-15 01:09:31,876 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:31,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21364783] [2019-10-15 01:09:31,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,047 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-15 01:09:32,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21364783] [2019-10-15 01:09:32,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:32,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599395789] [2019-10-15 01:09:32,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:32,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:32,051 INFO L87 Difference]: Start difference. First operand 555 states and 883 transitions. Second operand 6 states. [2019-10-15 01:09:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,240 INFO L93 Difference]: Finished difference Result 1031 states and 1663 transitions. [2019-10-15 01:09:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:32,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-15 01:09:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,247 INFO L225 Difference]: With dead ends: 1031 [2019-10-15 01:09:32,247 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:32,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 879 transitions. [2019-10-15 01:09:32,280 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 879 transitions. Word has length 117 [2019-10-15 01:09:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,280 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 879 transitions. [2019-10-15 01:09:32,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 879 transitions. [2019-10-15 01:09:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:09:32,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,285 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-15 01:09:32,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1358766467, now seen corresponding path program 1 times [2019-10-15 01:09:32,286 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345753962] [2019-10-15 01:09:32,286 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,477 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-15 01:09:32,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345753962] [2019-10-15 01:09:32,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:32,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51105161] [2019-10-15 01:09:32,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:32,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:32,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:32,479 INFO L87 Difference]: Start difference. First operand 555 states and 879 transitions. Second operand 7 states. [2019-10-15 01:09:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,577 INFO L93 Difference]: Finished difference Result 1031 states and 1659 transitions. [2019-10-15 01:09:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:32,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-15 01:09:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,583 INFO L225 Difference]: With dead ends: 1031 [2019-10-15 01:09:32,584 INFO L226 Difference]: Without dead ends: 534 [2019-10-15 01:09:32,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-15 01:09:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-15 01:09:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-15 01:09:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 845 transitions. [2019-10-15 01:09:32,608 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 845 transitions. Word has length 117 [2019-10-15 01:09:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,609 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 845 transitions. [2019-10-15 01:09:32,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 845 transitions. [2019-10-15 01:09:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:09:32,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,614 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-15 01:09:32,614 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1527772355, now seen corresponding path program 1 times [2019-10-15 01:09:32,615 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507058813] [2019-10-15 01:09:32,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,777 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-15 01:09:32,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507058813] [2019-10-15 01:09:32,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:32,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529943310] [2019-10-15 01:09:32,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:32,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:32,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:32,781 INFO L87 Difference]: Start difference. First operand 534 states and 845 transitions. Second operand 6 states. [2019-10-15 01:09:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,906 INFO L93 Difference]: Finished difference Result 1010 states and 1625 transitions. [2019-10-15 01:09:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:32,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-15 01:09:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,912 INFO L225 Difference]: With dead ends: 1010 [2019-10-15 01:09:32,912 INFO L226 Difference]: Without dead ends: 534 [2019-10-15 01:09:32,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-15 01:09:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-15 01:09:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-15 01:09:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 844 transitions. [2019-10-15 01:09:32,942 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 844 transitions. Word has length 118 [2019-10-15 01:09:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,944 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 844 transitions. [2019-10-15 01:09:32,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 844 transitions. [2019-10-15 01:09:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:09:32,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,948 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-15 01:09:32,948 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 620358210, now seen corresponding path program 1 times [2019-10-15 01:09:32,949 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284930584] [2019-10-15 01:09:32,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,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-15 01:09:33,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284930584] [2019-10-15 01:09:33,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:33,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555188882] [2019-10-15 01:09:33,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:33,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:33,099 INFO L87 Difference]: Start difference. First operand 534 states and 844 transitions. Second operand 6 states. [2019-10-15 01:09:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,198 INFO L93 Difference]: Finished difference Result 1010 states and 1624 transitions. [2019-10-15 01:09:33,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:33,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 01:09:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,203 INFO L225 Difference]: With dead ends: 1010 [2019-10-15 01:09:33,204 INFO L226 Difference]: Without dead ends: 534 [2019-10-15 01:09:33,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-15 01:09:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-15 01:09:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-15 01:09:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 843 transitions. [2019-10-15 01:09:33,234 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 843 transitions. Word has length 119 [2019-10-15 01:09:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,237 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 843 transitions. [2019-10-15 01:09:33,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 843 transitions. [2019-10-15 01:09:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:09:33,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,242 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-15 01:09:33,242 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash -597831004, now seen corresponding path program 1 times [2019-10-15 01:09:33,243 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323329091] [2019-10-15 01:09:33,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,397 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-15 01:09:33,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323329091] [2019-10-15 01:09:33,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:33,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083966618] [2019-10-15 01:09:33,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:33,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:33,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:33,401 INFO L87 Difference]: Start difference. First operand 534 states and 843 transitions. Second operand 4 states. [2019-10-15 01:09:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,449 INFO L93 Difference]: Finished difference Result 1010 states and 1623 transitions. [2019-10-15 01:09:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:33,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-15 01:09:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,455 INFO L225 Difference]: With dead ends: 1010 [2019-10-15 01:09:33,455 INFO L226 Difference]: Without dead ends: 534 [2019-10-15 01:09:33,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-15 01:09:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-15 01:09:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-15 01:09:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 842 transitions. [2019-10-15 01:09:33,481 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 842 transitions. Word has length 120 [2019-10-15 01:09:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,481 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 842 transitions. [2019-10-15 01:09:33,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 842 transitions. [2019-10-15 01:09:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:09:33,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,488 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-15 01:09:33,488 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash 369519650, now seen corresponding path program 1 times [2019-10-15 01:09:33,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165150034] [2019-10-15 01:09:33,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,490 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,692 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-15 01:09:33,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165150034] [2019-10-15 01:09:33,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:33,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898012760] [2019-10-15 01:09:33,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:33,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:33,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:33,695 INFO L87 Difference]: Start difference. First operand 534 states and 842 transitions. Second operand 12 states. [2019-10-15 01:09:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,877 INFO L93 Difference]: Finished difference Result 1011 states and 1622 transitions. [2019-10-15 01:09:33,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:09:33,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-15 01:09:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,883 INFO L225 Difference]: With dead ends: 1011 [2019-10-15 01:09:33,883 INFO L226 Difference]: Without dead ends: 534 [2019-10-15 01:09:33,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-15 01:09:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-15 01:09:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-15 01:09:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 841 transitions. [2019-10-15 01:09:33,915 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 841 transitions. Word has length 120 [2019-10-15 01:09:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,916 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 841 transitions. [2019-10-15 01:09:33,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 841 transitions. [2019-10-15 01:09:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:09:33,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,923 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-15 01:09:33,923 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,923 INFO L82 PathProgramCache]: Analyzing trace with hash 718640905, now seen corresponding path program 1 times [2019-10-15 01:09:33,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660760676] [2019-10-15 01:09:33,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,107 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-15 01:09:34,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660760676] [2019-10-15 01:09:34,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:09:34,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669109617] [2019-10-15 01:09:34,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:34,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:34,116 INFO L87 Difference]: Start difference. First operand 534 states and 841 transitions. Second operand 9 states. [2019-10-15 01:09:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,466 INFO L93 Difference]: Finished difference Result 1008 states and 1636 transitions. [2019-10-15 01:09:37,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:09:37,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-15 01:09:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,472 INFO L225 Difference]: With dead ends: 1008 [2019-10-15 01:09:37,472 INFO L226 Difference]: Without dead ends: 540 [2019-10-15 01:09:37,475 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-15 01:09:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-15 01:09:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-10-15 01:09:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-15 01:09:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 860 transitions. [2019-10-15 01:09:37,503 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 860 transitions. Word has length 121 [2019-10-15 01:09:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,504 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 860 transitions. [2019-10-15 01:09:37,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 860 transitions. [2019-10-15 01:09:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:09:37,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,508 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-15 01:09:37,508 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1721131710, now seen corresponding path program 1 times [2019-10-15 01:09:37,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254947590] [2019-10-15 01:09:37,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,673 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-15 01:09:37,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254947590] [2019-10-15 01:09:37,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:09:37,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960044997] [2019-10-15 01:09:37,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:09:37,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:09:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,675 INFO L87 Difference]: Start difference. First operand 538 states and 860 transitions. Second operand 8 states. [2019-10-15 01:09:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:43,524 INFO L93 Difference]: Finished difference Result 1878 states and 3135 transitions. [2019-10-15 01:09:43,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:09:43,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-15 01:09:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:43,544 INFO L225 Difference]: With dead ends: 1878 [2019-10-15 01:09:43,544 INFO L226 Difference]: Without dead ends: 1406 [2019-10-15 01:09:43,550 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-15 01:09:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2019-10-15 01:09:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1367. [2019-10-15 01:09:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-10-15 01:09:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2211 transitions. [2019-10-15 01:09:43,623 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2211 transitions. Word has length 122 [2019-10-15 01:09:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:43,624 INFO L462 AbstractCegarLoop]: Abstraction has 1367 states and 2211 transitions. [2019-10-15 01:09:43,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:09:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2211 transitions. [2019-10-15 01:09:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:43,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:43,627 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] [2019-10-15 01:09:43,628 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:43,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1283805034, now seen corresponding path program 1 times [2019-10-15 01:09:43,628 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:43,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189864109] [2019-10-15 01:09:43,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:43,788 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-15 01:09:43,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189864109] [2019-10-15 01:09:43,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:43,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:09:43,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382673718] [2019-10-15 01:09:43,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:43,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:43,792 INFO L87 Difference]: Start difference. First operand 1367 states and 2211 transitions. Second operand 9 states. [2019-10-15 01:09:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:50,422 INFO L93 Difference]: Finished difference Result 4315 states and 7169 transitions. [2019-10-15 01:09:50,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:09:50,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-15 01:09:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:50,452 INFO L225 Difference]: With dead ends: 4315 [2019-10-15 01:09:50,453 INFO L226 Difference]: Without dead ends: 3014 [2019-10-15 01:09:50,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:09:50,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-10-15 01:09:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2791. [2019-10-15 01:09:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-10-15 01:09:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4542 transitions. [2019-10-15 01:09:50,617 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4542 transitions. Word has length 128 [2019-10-15 01:09:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:50,617 INFO L462 AbstractCegarLoop]: Abstraction has 2791 states and 4542 transitions. [2019-10-15 01:09:50,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4542 transitions. [2019-10-15 01:09:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:50,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:50,621 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] [2019-10-15 01:09:50,622 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1276045675, now seen corresponding path program 1 times [2019-10-15 01:09:50,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:50,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792262711] [2019-10-15 01:09:50,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:50,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:50,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:50,763 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-15 01:09:50,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792262711] [2019-10-15 01:09:50,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:50,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:50,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456528972] [2019-10-15 01:09:50,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:50,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:50,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:50,767 INFO L87 Difference]: Start difference. First operand 2791 states and 4542 transitions. Second operand 7 states. [2019-10-15 01:09:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:54,969 INFO L93 Difference]: Finished difference Result 7221 states and 11970 transitions. [2019-10-15 01:09:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:09:54,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-15 01:09:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:55,016 INFO L225 Difference]: With dead ends: 7221 [2019-10-15 01:09:55,016 INFO L226 Difference]: Without dead ends: 5205 [2019-10-15 01:09:55,030 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-15 01:09:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2019-10-15 01:09:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5112. [2019-10-15 01:09:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2019-10-15 01:09:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 8394 transitions. [2019-10-15 01:09:55,282 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 8394 transitions. Word has length 128 [2019-10-15 01:09:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:55,283 INFO L462 AbstractCegarLoop]: Abstraction has 5112 states and 8394 transitions. [2019-10-15 01:09:55,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 8394 transitions. [2019-10-15 01:09:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:09:55,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:55,287 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] [2019-10-15 01:09:55,287 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash 421466230, now seen corresponding path program 1 times [2019-10-15 01:09:55,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:55,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299449342] [2019-10-15 01:09:55,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:55,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:55,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:55,416 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-15 01:09:55,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299449342] [2019-10-15 01:09:55,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:55,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:09:55,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914324064] [2019-10-15 01:09:55,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:55,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:55,418 INFO L87 Difference]: Start difference. First operand 5112 states and 8394 transitions. Second operand 5 states. [2019-10-15 01:09:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:55,635 INFO L93 Difference]: Finished difference Result 9457 states and 15616 transitions. [2019-10-15 01:09:55,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:09:55,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 01:09:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:55,705 INFO L225 Difference]: With dead ends: 9457 [2019-10-15 01:09:55,705 INFO L226 Difference]: Without dead ends: 5230 [2019-10-15 01:09:55,743 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-15 01:09:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2019-10-15 01:09:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 5164. [2019-10-15 01:09:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-10-15 01:09:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8467 transitions. [2019-10-15 01:09:56,230 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8467 transitions. Word has length 133 [2019-10-15 01:09:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:56,232 INFO L462 AbstractCegarLoop]: Abstraction has 5164 states and 8467 transitions. [2019-10-15 01:09:56,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8467 transitions. [2019-10-15 01:09:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:09:56,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:56,240 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] [2019-10-15 01:09:56,240 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1968794639, now seen corresponding path program 1 times [2019-10-15 01:09:56,241 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:56,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736519031] [2019-10-15 01:09:56,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:56,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:56,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:56,421 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-15 01:09:56,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736519031] [2019-10-15 01:09:56,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:56,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:56,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323632444] [2019-10-15 01:09:56,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:56,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:56,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:56,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:56,425 INFO L87 Difference]: Start difference. First operand 5164 states and 8467 transitions. Second operand 7 states. [2019-10-15 01:09:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:56,758 INFO L93 Difference]: Finished difference Result 10033 states and 16732 transitions. [2019-10-15 01:09:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:56,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-15 01:09:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:56,800 INFO L225 Difference]: With dead ends: 10033 [2019-10-15 01:09:56,800 INFO L226 Difference]: Without dead ends: 5164 [2019-10-15 01:09:56,822 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-15 01:09:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2019-10-15 01:09:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5164. [2019-10-15 01:09:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-10-15 01:09:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8375 transitions. [2019-10-15 01:09:57,055 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8375 transitions. Word has length 140 [2019-10-15 01:09:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:57,055 INFO L462 AbstractCegarLoop]: Abstraction has 5164 states and 8375 transitions. [2019-10-15 01:09:57,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8375 transitions. [2019-10-15 01:09:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:09:57,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:57,060 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] [2019-10-15 01:09:57,060 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1901521423, now seen corresponding path program 1 times [2019-10-15 01:09:57,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:57,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631463921] [2019-10-15 01:09:57,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:57,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:57,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:57,191 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-15 01:09:57,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631463921] [2019-10-15 01:09:57,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:57,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:57,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044679534] [2019-10-15 01:09:57,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:57,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:57,193 INFO L87 Difference]: Start difference. First operand 5164 states and 8375 transitions. Second operand 7 states.