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_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:20,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:20,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:20,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:20,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:20,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:20,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:20,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:20,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:20,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:20,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:20,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:20,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:20,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:20,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:20,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:20,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:20,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:20,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:20,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:20,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:20,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:20,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:20,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:20,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:20,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:20,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:20,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:20,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:20,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:20,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:20,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:20,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:20,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:20,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:20,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:20,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:20,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:20,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:20,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:20,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:20,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:10:20,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:20,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:20,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:20,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:20,875 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:20,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:20,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:20,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:20,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:20,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:20,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:20,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:20,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:20,880 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:20,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:20,881 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:20,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:20,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:20,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:20,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:20,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:20,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:20,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:20,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:20,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:20,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:20,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:20,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:20,886 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:10:21,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:21,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:21,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:21,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:21,187 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:21,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-10-13 21:10:21,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4cff2480/a4e5a92dd1b54b9091d3dc144da7348a/FLAGeb7fb1d61 [2019-10-13 21:10:21,947 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:21,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-10-13 21:10:21,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4cff2480/a4e5a92dd1b54b9091d3dc144da7348a/FLAGeb7fb1d61 [2019-10-13 21:10:22,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4cff2480/a4e5a92dd1b54b9091d3dc144da7348a [2019-10-13 21:10:22,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:22,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:22,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:22,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:22,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:22,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:22" (1/1) ... [2019-10-13 21:10:22,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26809f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:22, skipping insertion in model container [2019-10-13 21:10:22,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:22" (1/1) ... [2019-10-13 21:10:22,152 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:22,234 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:22,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:22,999 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:23,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:23,304 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:23,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23 WrapperNode [2019-10-13 21:10:23,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:23,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:23,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:23,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:23,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:23,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:23,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:23,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:23,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:23,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:23,609 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:23,610 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:23,610 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:23,610 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:23,610 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:23,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:23,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:23,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:23,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:23,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:23,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:23,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-13 21:10:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-13 21:10:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:10:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:10:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:23,623 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:23,627 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:10:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:10:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-13 21:10:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-13 21:10:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:25,919 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:25,919 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:25,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:25 BoogieIcfgContainer [2019-10-13 21:10:25,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:25,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:25,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:25,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:25,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:22" (1/3) ... [2019-10-13 21:10:25,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f51ec2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:25, skipping insertion in model container [2019-10-13 21:10:25,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (2/3) ... [2019-10-13 21:10:25,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f51ec2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:25, skipping insertion in model container [2019-10-13 21:10:25,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:25" (3/3) ... [2019-10-13 21:10:25,932 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product03.cil.c [2019-10-13 21:10:25,945 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:25,956 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:25,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:26,024 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:26,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:26,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:26,025 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:26,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:26,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:26,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:26,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-10-13 21:10:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:26,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:26,121 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:26,125 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash 370351368, now seen corresponding path program 1 times [2019-10-13 21:10:26,145 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:26,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945197210] [2019-10-13 21:10:26,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:26,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:26,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:26,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945197210] [2019-10-13 21:10:26,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:26,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:26,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381337538] [2019-10-13 21:10:26,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:26,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:26,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:26,936 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-10-13 21:10:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:27,128 INFO L93 Difference]: Finished difference Result 1161 states and 1887 transitions. [2019-10-13 21:10:27,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:27,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-13 21:10:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:27,162 INFO L225 Difference]: With dead ends: 1161 [2019-10-13 21:10:27,164 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:10:27,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:10:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:10:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:10:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-10-13 21:10:27,322 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 133 [2019-10-13 21:10:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:27,322 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-10-13 21:10:27,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-10-13 21:10:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:10:27,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:27,334 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:27,334 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:27,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:27,335 INFO L82 PathProgramCache]: Analyzing trace with hash -743808276, now seen corresponding path program 1 times [2019-10-13 21:10:27,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:27,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159678423] [2019-10-13 21:10:27,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:27,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159678423] [2019-10-13 21:10:27,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:27,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:27,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730393994] [2019-10-13 21:10:27,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:27,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:27,618 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-10-13 21:10:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:27,795 INFO L93 Difference]: Finished difference Result 1141 states and 1848 transitions. [2019-10-13 21:10:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:27,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:10:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:27,804 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:10:27,804 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:10:27,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:10:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:10:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:10:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-10-13 21:10:27,863 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 136 [2019-10-13 21:10:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:27,866 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-10-13 21:10:27,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-10-13 21:10:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:10:27,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:27,884 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:27,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:27,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1971987191, now seen corresponding path program 1 times [2019-10-13 21:10:27,886 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:27,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077427199] [2019-10-13 21:10:27,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:28,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077427199] [2019-10-13 21:10:28,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:28,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400111939] [2019-10-13 21:10:28,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:28,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:28,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:28,051 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-10-13 21:10:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,119 INFO L93 Difference]: Finished difference Result 1141 states and 1847 transitions. [2019-10-13 21:10:28,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:10:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,125 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:10:28,126 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:10:28,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:10:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:10:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:10:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-10-13 21:10:28,155 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 137 [2019-10-13 21:10:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,155 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-10-13 21:10:28,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-10-13 21:10:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:10:28,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,161 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:28,161 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1254078520, now seen corresponding path program 1 times [2019-10-13 21:10:28,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839477386] [2019-10-13 21:10:28,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:28,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839477386] [2019-10-13 21:10:28,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:28,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573286841] [2019-10-13 21:10:28,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:28,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:28,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:28,310 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-10-13 21:10:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,377 INFO L93 Difference]: Finished difference Result 1141 states and 1846 transitions. [2019-10-13 21:10:28,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:10:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,385 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:10:28,385 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:10:28,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:10:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:10:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:10:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-13 21:10:28,420 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 138 [2019-10-13 21:10:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,421 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-13 21:10:28,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-13 21:10:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:10:28,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,429 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:28,429 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash 300720275, now seen corresponding path program 1 times [2019-10-13 21:10:28,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443522555] [2019-10-13 21:10:28,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:28,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443522555] [2019-10-13 21:10:28,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:28,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711355362] [2019-10-13 21:10:28,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:28,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:28,684 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-13 21:10:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,753 INFO L93 Difference]: Finished difference Result 1141 states and 1845 transitions. [2019-10-13 21:10:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:10:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,759 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:10:28,759 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:10:28,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:10:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:10:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:10:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-10-13 21:10:28,783 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 139 [2019-10-13 21:10:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,783 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-10-13 21:10:28,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-10-13 21:10:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:28,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,788 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:28,788 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash -261536604, now seen corresponding path program 1 times [2019-10-13 21:10:28,789 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230223769] [2019-10-13 21:10:28,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:28,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230223769] [2019-10-13 21:10:28,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:28,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047017638] [2019-10-13 21:10:28,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:28,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:28,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:28,975 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-10-13 21:10:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,146 INFO L93 Difference]: Finished difference Result 1099 states and 1765 transitions. [2019-10-13 21:10:29,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:29,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:10:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,152 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:10:29,152 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:10:29,154 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-13 21:10:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:10:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-10-13 21:10:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:10:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-10-13 21:10:29,193 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 140 [2019-10-13 21:10:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,194 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-10-13 21:10:29,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-10-13 21:10:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:29,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,200 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:29,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash 433110403, now seen corresponding path program 1 times [2019-10-13 21:10:29,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890546726] [2019-10-13 21:10:29,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:29,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890546726] [2019-10-13 21:10:29,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:29,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667289108] [2019-10-13 21:10:29,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:29,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:29,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:29,396 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-10-13 21:10:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,461 INFO L93 Difference]: Finished difference Result 1147 states and 1851 transitions. [2019-10-13 21:10:29,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:29,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:10:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,470 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:10:29,471 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:29,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-10-13 21:10:29,496 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 140 [2019-10-13 21:10:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,496 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-10-13 21:10:29,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-10-13 21:10:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:10:29,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,504 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:29,504 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1772555127, now seen corresponding path program 1 times [2019-10-13 21:10:29,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419250622] [2019-10-13 21:10:29,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:29,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419250622] [2019-10-13 21:10:29,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:29,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685247908] [2019-10-13 21:10:29,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:29,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:29,703 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-10-13 21:10:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,945 INFO L93 Difference]: Finished difference Result 1087 states and 1743 transitions. [2019-10-13 21:10:29,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:29,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:10:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,951 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:10:29,951 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:29,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-10-13 21:10:29,983 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 141 [2019-10-13 21:10:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,985 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-10-13 21:10:29,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-10-13 21:10:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:10:29,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,990 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:29,990 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,991 INFO L82 PathProgramCache]: Analyzing trace with hash -235226265, now seen corresponding path program 1 times [2019-10-13 21:10:29,991 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206778941] [2019-10-13 21:10:29,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:30,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206778941] [2019-10-13 21:10:30,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:30,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568832884] [2019-10-13 21:10:30,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:30,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:30,154 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-10-13 21:10:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,407 INFO L93 Difference]: Finished difference Result 1087 states and 1739 transitions. [2019-10-13 21:10:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:30,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:10:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,413 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:10:30,413 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:30,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-10-13 21:10:30,447 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 142 [2019-10-13 21:10:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,447 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-10-13 21:10:30,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-10-13 21:10:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:10:30,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,453 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:30,453 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1655770492, now seen corresponding path program 1 times [2019-10-13 21:10:30,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458397646] [2019-10-13 21:10:30,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:30,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458397646] [2019-10-13 21:10:30,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:30,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270010861] [2019-10-13 21:10:30,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:30,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:30,618 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-10-13 21:10:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,808 INFO L93 Difference]: Finished difference Result 1087 states and 1735 transitions. [2019-10-13 21:10:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:30,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:10:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,815 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:10:30,815 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:30,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-10-13 21:10:30,840 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 143 [2019-10-13 21:10:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,841 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-10-13 21:10:30,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-10-13 21:10:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:10:30,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,846 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:30,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1584723460, now seen corresponding path program 1 times [2019-10-13 21:10:30,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247683723] [2019-10-13 21:10:30,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:30,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247683723] [2019-10-13 21:10:30,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:30,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850323940] [2019-10-13 21:10:30,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:30,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:30,984 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-10-13 21:10:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,065 INFO L93 Difference]: Finished difference Result 1087 states and 1731 transitions. [2019-10-13 21:10:31,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:31,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:10:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,071 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:10:31,071 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:10:31,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:10:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:10:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:10:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-10-13 21:10:31,093 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 143 [2019-10-13 21:10:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,094 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-10-13 21:10:31,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-10-13 21:10:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:10:31,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,125 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:31,125 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash -145161716, now seen corresponding path program 1 times [2019-10-13 21:10:31,126 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780550793] [2019-10-13 21:10:31,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:31,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780550793] [2019-10-13 21:10:31,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:31,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741659893] [2019-10-13 21:10:31,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:31,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:31,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:31,263 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-10-13 21:10:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,400 INFO L93 Difference]: Finished difference Result 1066 states and 1697 transitions. [2019-10-13 21:10:31,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:10:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,406 INFO L225 Difference]: With dead ends: 1066 [2019-10-13 21:10:31,406 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:10:31,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:10:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:10:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:10:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-10-13 21:10:31,437 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 144 [2019-10-13 21:10:31,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,438 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-10-13 21:10:31,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-10-13 21:10:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:10:31,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,446 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:31,446 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,447 INFO L82 PathProgramCache]: Analyzing trace with hash -431774847, now seen corresponding path program 1 times [2019-10-13 21:10:31,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395072451] [2019-10-13 21:10:31,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:31,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395072451] [2019-10-13 21:10:31,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:31,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111367864] [2019-10-13 21:10:31,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:31,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:31,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:31,632 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-10-13 21:10:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,744 INFO L93 Difference]: Finished difference Result 1066 states and 1696 transitions. [2019-10-13 21:10:31,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:10:31,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,750 INFO L225 Difference]: With dead ends: 1066 [2019-10-13 21:10:31,750 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:10:31,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:10:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:10:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:10:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-10-13 21:10:31,771 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 145 [2019-10-13 21:10:31,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,772 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-10-13 21:10:31,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-10-13 21:10:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:10:31,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,777 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:31,777 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1019136847, now seen corresponding path program 1 times [2019-10-13 21:10:31,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210604939] [2019-10-13 21:10:31,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:31,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210604939] [2019-10-13 21:10:31,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:31,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616137055] [2019-10-13 21:10:31,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:31,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:31,988 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 12 states. [2019-10-13 21:10:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:32,173 INFO L93 Difference]: Finished difference Result 1067 states and 1695 transitions. [2019-10-13 21:10:32,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:32,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:10:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:32,179 INFO L225 Difference]: With dead ends: 1067 [2019-10-13 21:10:32,179 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:10:32,182 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-13 21:10:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:10:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:10:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:10:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-10-13 21:10:32,204 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 146 [2019-10-13 21:10:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:32,205 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-10-13 21:10:32,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-10-13 21:10:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:10:32,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:32,211 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:32,211 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1801631980, now seen corresponding path program 1 times [2019-10-13 21:10:32,212 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:32,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810571975] [2019-10-13 21:10:32,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:32,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810571975] [2019-10-13 21:10:32,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645278065] [2019-10-13 21:10:32,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:32,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:33,110 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:33,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:33,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:10:33,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286750012] [2019-10-13 21:10:33,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:33,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:33,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:33,967 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 5 states. [2019-10-13 21:10:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:34,851 INFO L93 Difference]: Finished difference Result 1066 states and 1720 transitions. [2019-10-13 21:10:34,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:34,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:10:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:34,859 INFO L225 Difference]: With dead ends: 1066 [2019-10-13 21:10:34,860 INFO L226 Difference]: Without dead ends: 570 [2019-10-13 21:10:34,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-13 21:10:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-10-13 21:10:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-10-13 21:10:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 891 transitions. [2019-10-13 21:10:34,914 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 891 transitions. Word has length 147 [2019-10-13 21:10:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:34,914 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 891 transitions. [2019-10-13 21:10:34,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 891 transitions. [2019-10-13 21:10:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:10:34,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:34,919 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:35,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:35,127 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash -550201376, now seen corresponding path program 1 times [2019-10-13 21:10:35,128 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:35,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936122080] [2019-10-13 21:10:35,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:35,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936122080] [2019-10-13 21:10:35,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435414631] [2019-10-13 21:10:35,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:35,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:35,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:35,972 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:36,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:36,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:10:36,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425308766] [2019-10-13 21:10:36,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:36,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:36,612 INFO L87 Difference]: Start difference. First operand 570 states and 891 transitions. Second operand 5 states. [2019-10-13 21:10:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:37,453 INFO L93 Difference]: Finished difference Result 1082 states and 1743 transitions. [2019-10-13 21:10:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:37,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-13 21:10:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:37,462 INFO L225 Difference]: With dead ends: 1082 [2019-10-13 21:10:37,462 INFO L226 Difference]: Without dead ends: 578 [2019-10-13 21:10:37,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 285 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-13 21:10:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-13 21:10:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-13 21:10:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 904 transitions. [2019-10-13 21:10:37,498 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 904 transitions. Word has length 149 [2019-10-13 21:10:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,498 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 904 transitions. [2019-10-13 21:10:37,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 904 transitions. [2019-10-13 21:10:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:10:37,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,506 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:37,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:37,713 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1423243564, now seen corresponding path program 1 times [2019-10-13 21:10:37,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344987529] [2019-10-13 21:10:37,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:38,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344987529] [2019-10-13 21:10:38,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317234129] [2019-10-13 21:10:38,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:38,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:38,975 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:39,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:39,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:10:39,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212833068] [2019-10-13 21:10:39,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:39,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:39,761 INFO L87 Difference]: Start difference. First operand 578 states and 904 transitions. Second operand 5 states. [2019-10-13 21:10:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,659 INFO L93 Difference]: Finished difference Result 1098 states and 1766 transitions. [2019-10-13 21:10:40,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:40,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-13 21:10:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,666 INFO L225 Difference]: With dead ends: 1098 [2019-10-13 21:10:40,666 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:10:40,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 289 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:10:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-13 21:10:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-13 21:10:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 917 transitions. [2019-10-13 21:10:40,698 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 917 transitions. Word has length 151 [2019-10-13 21:10:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,698 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 917 transitions. [2019-10-13 21:10:40,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 917 transitions. [2019-10-13 21:10:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:10:40,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,704 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:40,912 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1199296360, now seen corresponding path program 1 times [2019-10-13 21:10:40,913 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822873145] [2019-10-13 21:10:40,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:41,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822873145] [2019-10-13 21:10:41,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178719173] [2019-10-13 21:10:41,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:41,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:41,719 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:42,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:42,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2019-10-13 21:10:42,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940551341] [2019-10-13 21:10:42,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:42,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:42,388 INFO L87 Difference]: Start difference. First operand 586 states and 917 transitions. Second operand 5 states. [2019-10-13 21:10:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:43,259 INFO L93 Difference]: Finished difference Result 1114 states and 1789 transitions. [2019-10-13 21:10:43,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:43,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:10:43,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:43,264 INFO L225 Difference]: With dead ends: 1114 [2019-10-13 21:10:43,265 INFO L226 Difference]: Without dead ends: 594 [2019-10-13 21:10:43,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-13 21:10:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-10-13 21:10:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-13 21:10:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 930 transitions. [2019-10-13 21:10:43,288 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 930 transitions. Word has length 153 [2019-10-13 21:10:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:43,289 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 930 transitions. [2019-10-13 21:10:43,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 930 transitions. [2019-10-13 21:10:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:10:43,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:43,295 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:43,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:43,512 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 99391340, now seen corresponding path program 1 times [2019-10-13 21:10:43,513 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:43,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582297161] [2019-10-13 21:10:43,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:10:43,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582297161] [2019-10-13 21:10:43,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121693200] [2019-10-13 21:10:43,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:44,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:44,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:44,387 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:44,701 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:44,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-13 21:10:44,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942833125] [2019-10-13 21:10:44,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:44,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:44,703 INFO L87 Difference]: Start difference. First operand 594 states and 930 transitions. Second operand 9 states. [2019-10-13 21:10:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:46,046 INFO L93 Difference]: Finished difference Result 639 states and 990 transitions. [2019-10-13 21:10:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:46,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-13 21:10:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:46,052 INFO L225 Difference]: With dead ends: 639 [2019-10-13 21:10:46,052 INFO L226 Difference]: Without dead ends: 622 [2019-10-13 21:10:46,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:10:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-13 21:10:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 608. [2019-10-13 21:10:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-13 21:10:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 949 transitions. [2019-10-13 21:10:46,074 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 949 transitions. Word has length 155 [2019-10-13 21:10:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:46,075 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 949 transitions. [2019-10-13 21:10:46,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 949 transitions. [2019-10-13 21:10:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:10:46,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:46,080 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:46,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:46,287 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1851617977, now seen corresponding path program 1 times [2019-10-13 21:10:46,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:46,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601136578] [2019-10-13 21:10:46,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:46,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:46,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:10:46,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601136578] [2019-10-13 21:10:46,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969668167] [2019-10-13 21:10:46,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:47,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 2763 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:10:47,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:47,345 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:47,732 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:47,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-13 21:10:47,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126679862] [2019-10-13 21:10:47,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:47,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:47,736 INFO L87 Difference]: Start difference. First operand 608 states and 949 transitions. Second operand 5 states. [2019-10-13 21:10:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:47,776 INFO L93 Difference]: Finished difference Result 625 states and 969 transitions. [2019-10-13 21:10:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:47,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 21:10:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:47,780 INFO L225 Difference]: With dead ends: 625 [2019-10-13 21:10:47,780 INFO L226 Difference]: Without dead ends: 608 [2019-10-13 21:10:47,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:10:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-13 21:10:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-13 21:10:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-13 21:10:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 947 transitions. [2019-10-13 21:10:47,806 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 947 transitions. Word has length 161 [2019-10-13 21:10:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:47,807 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 947 transitions. [2019-10-13 21:10:47,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 947 transitions. [2019-10-13 21:10:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-13 21:10:47,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:47,814 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:48,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:48,022 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1257406341, now seen corresponding path program 1 times [2019-10-13 21:10:48,023 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:48,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278557550] [2019-10-13 21:10:48,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:10:48,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278557550] [2019-10-13 21:10:48,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396697358] [2019-10-13 21:10:48,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:49,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 2813 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:10:49,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:10:49,261 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:10:49,684 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:49,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-13 21:10:49,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360415698] [2019-10-13 21:10:49,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:49,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:49,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:49,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:49,686 INFO L87 Difference]: Start difference. First operand 608 states and 947 transitions. Second operand 9 states.