java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:41,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:41,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:41,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:41,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:41,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:41,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:41,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:41,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:41,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:41,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:41,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:41,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:41,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:41,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:41,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:41,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:41,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:41,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:41,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:41,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:41,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:41,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:41,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:41,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:41,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:41,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:41,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:41,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:41,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:41,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:41,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:41,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:41,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:41,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:41,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:41,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:41,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:41,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:41,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:41,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:41,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:10:41,911 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:41,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:41,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:41,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:41,915 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:41,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:41,916 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:41,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:41,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:41,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:41,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:41,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:41,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:41,917 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:41,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:41,918 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:41,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:41,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:41,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:41,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:41,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:41,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:41,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:41,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:41,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:41,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:41,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:41,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:41,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:10:42,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:42,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:42,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:42,242 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:42,243 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:42,244 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-15 01:10:42,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a55941ac/96e5864fc9fc455dbdbdefb4acda4ae4/FLAG9d870f1a8 [2019-10-15 01:10:43,012 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:43,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-15 01:10:43,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a55941ac/96e5864fc9fc455dbdbdefb4acda4ae4/FLAG9d870f1a8 [2019-10-15 01:10:43,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a55941ac/96e5864fc9fc455dbdbdefb4acda4ae4 [2019-10-15 01:10:43,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:43,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:43,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:43,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:43,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:43,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:43" (1/1) ... [2019-10-15 01:10:43,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e56ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:43, skipping insertion in model container [2019-10-15 01:10:43,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:43" (1/1) ... [2019-10-15 01:10:43,225 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:43,316 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:43,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:44,011 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:44,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:44,295 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:44,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44 WrapperNode [2019-10-15 01:10:44,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:44,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:44,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:44,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:44,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... [2019-10-15 01:10:44,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... [2019-10-15 01:10:44,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... [2019-10-15 01:10:44,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... [2019-10-15 01:10:44,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... [2019-10-15 01:10:44,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... [2019-10-15 01:10:44,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... [2019-10-15 01:10:44,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:44,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:44,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:44,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:44,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:44,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:44,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:44,614 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:44,615 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:44,620 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:44,621 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:44,621 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:44,621 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:44,621 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:44,621 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:44,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:44,622 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:44,622 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:44,622 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:44,622 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-15 01:10:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-15 01:10:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:44,627 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:44,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:44,628 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:44,628 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:44,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:44,629 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:44,637 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:44,638 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:44,639 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:44,641 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:44,641 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:44,641 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:44,641 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:44,641 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:44,642 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:44,642 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:44,642 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:44,642 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:44,642 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-15 01:10:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-15 01:10:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:46,963 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:46,963 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:46,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:46 BoogieIcfgContainer [2019-10-15 01:10:46,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:46,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:46,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:46,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:46,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:43" (1/3) ... [2019-10-15 01:10:46,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b19380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:46, skipping insertion in model container [2019-10-15 01:10:46,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:44" (2/3) ... [2019-10-15 01:10:46,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b19380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:46, skipping insertion in model container [2019-10-15 01:10:46,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:46" (3/3) ... [2019-10-15 01:10:46,981 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product26.cil.c [2019-10-15 01:10:46,993 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:47,007 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:47,022 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:47,076 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:47,076 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:47,076 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:47,077 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:47,077 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:47,077 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:47,077 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:47,078 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states. [2019-10-15 01:10:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:10:47,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:47,163 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:47,170 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:47,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1751841435, now seen corresponding path program 1 times [2019-10-15 01:10:47,187 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:47,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179933596] [2019-10-15 01:10:47,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:47,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:47,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179933596] [2019-10-15 01:10:47,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:47,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:47,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377449340] [2019-10-15 01:10:47,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:47,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:47,978 INFO L87 Difference]: Start difference. First operand 797 states. Second operand 7 states. [2019-10-15 01:10:48,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,251 INFO L93 Difference]: Finished difference Result 1259 states and 2038 transitions. [2019-10-15 01:10:48,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:48,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-15 01:10:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,285 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 01:10:48,286 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:10:48,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:10:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-15 01:10:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-15 01:10:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1014 transitions. [2019-10-15 01:10:48,442 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1014 transitions. Word has length 93 [2019-10-15 01:10:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,443 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1014 transitions. [2019-10-15 01:10:48,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1014 transitions. [2019-10-15 01:10:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:48,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,449 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,449 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash 449544218, now seen corresponding path program 1 times [2019-10-15 01:10:48,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485358523] [2019-10-15 01:10:48,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:48,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485358523] [2019-10-15 01:10:48,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:48,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:48,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335206083] [2019-10-15 01:10:48,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:48,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:48,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:48,728 INFO L87 Difference]: Start difference. First operand 636 states and 1014 transitions. Second operand 4 states. [2019-10-15 01:10:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:48,888 INFO L93 Difference]: Finished difference Result 1238 states and 1993 transitions. [2019-10-15 01:10:48,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:48,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-15 01:10:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:48,894 INFO L225 Difference]: With dead ends: 1238 [2019-10-15 01:10:48,895 INFO L226 Difference]: Without dead ends: 618 [2019-10-15 01:10:48,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-15 01:10:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-15 01:10:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-15 01:10:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 981 transitions. [2019-10-15 01:10:48,929 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 981 transitions. Word has length 94 [2019-10-15 01:10:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:48,929 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 981 transitions. [2019-10-15 01:10:48,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2019-10-15 01:10:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-15 01:10:48,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:48,935 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:48,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash 451716357, now seen corresponding path program 1 times [2019-10-15 01:10:48,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:48,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073186956] [2019-10-15 01:10:48,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:48,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:49,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073186956] [2019-10-15 01:10:49,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:49,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:49,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174164834] [2019-10-15 01:10:49,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:49,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:49,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:49,118 INFO L87 Difference]: Start difference. First operand 618 states and 981 transitions. Second operand 7 states. [2019-10-15 01:10:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:49,240 INFO L93 Difference]: Finished difference Result 1207 states and 1935 transitions. [2019-10-15 01:10:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:49,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-15 01:10:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:49,246 INFO L225 Difference]: With dead ends: 1207 [2019-10-15 01:10:49,246 INFO L226 Difference]: Without dead ends: 612 [2019-10-15 01:10:49,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-15 01:10:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-15 01:10:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-15 01:10:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 968 transitions. [2019-10-15 01:10:49,279 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 968 transitions. Word has length 94 [2019-10-15 01:10:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:49,280 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 968 transitions. [2019-10-15 01:10:49,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 968 transitions. [2019-10-15 01:10:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-15 01:10:49,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:49,282 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:49,283 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2112280439, now seen corresponding path program 1 times [2019-10-15 01:10:49,283 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:49,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867605342] [2019-10-15 01:10:49,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:49,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867605342] [2019-10-15 01:10:49,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:49,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:49,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362828561] [2019-10-15 01:10:49,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:49,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:49,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:49,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:49,436 INFO L87 Difference]: Start difference. First operand 612 states and 968 transitions. Second operand 7 states. [2019-10-15 01:10:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:49,525 INFO L93 Difference]: Finished difference Result 1195 states and 1909 transitions. [2019-10-15 01:10:49,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:49,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-15 01:10:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:49,534 INFO L225 Difference]: With dead ends: 1195 [2019-10-15 01:10:49,534 INFO L226 Difference]: Without dead ends: 606 [2019-10-15 01:10:49,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-15 01:10:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-15 01:10:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-15 01:10:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 955 transitions. [2019-10-15 01:10:49,581 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 955 transitions. Word has length 95 [2019-10-15 01:10:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:49,582 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 955 transitions. [2019-10-15 01:10:49,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 955 transitions. [2019-10-15 01:10:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:49,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:49,585 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:49,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2146614103, now seen corresponding path program 1 times [2019-10-15 01:10:49,586 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:49,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789848879] [2019-10-15 01:10:49,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,588 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:49,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789848879] [2019-10-15 01:10:49,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:49,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:49,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195193921] [2019-10-15 01:10:49,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:49,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:49,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:49,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:49,846 INFO L87 Difference]: Start difference. First operand 606 states and 955 transitions. Second operand 7 states. [2019-10-15 01:10:49,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:49,937 INFO L93 Difference]: Finished difference Result 1183 states and 1883 transitions. [2019-10-15 01:10:49,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:49,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:10:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:49,942 INFO L225 Difference]: With dead ends: 1183 [2019-10-15 01:10:49,943 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:10:49,946 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:10:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-15 01:10:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:10:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 942 transitions. [2019-10-15 01:10:49,968 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 942 transitions. Word has length 96 [2019-10-15 01:10:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:49,969 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 942 transitions. [2019-10-15 01:10:49,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 942 transitions. [2019-10-15 01:10:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 01:10:49,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:49,971 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:49,971 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -757672278, now seen corresponding path program 1 times [2019-10-15 01:10:49,972 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:49,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485716358] [2019-10-15 01:10:49,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:50,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485716358] [2019-10-15 01:10:50,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:50,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:50,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041969855] [2019-10-15 01:10:50,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:50,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:50,140 INFO L87 Difference]: Start difference. First operand 600 states and 942 transitions. Second operand 7 states. [2019-10-15 01:10:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:50,232 INFO L93 Difference]: Finished difference Result 1171 states and 1857 transitions. [2019-10-15 01:10:50,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:50,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-15 01:10:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:50,247 INFO L225 Difference]: With dead ends: 1171 [2019-10-15 01:10:50,247 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:10:50,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:10:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-15 01:10:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:10:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 941 transitions. [2019-10-15 01:10:50,282 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 941 transitions. Word has length 96 [2019-10-15 01:10:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:50,283 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 941 transitions. [2019-10-15 01:10:50,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 941 transitions. [2019-10-15 01:10:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-15 01:10:50,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:50,286 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:50,286 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1070802003, now seen corresponding path program 1 times [2019-10-15 01:10:50,287 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:50,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121673248] [2019-10-15 01:10:50,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:50,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121673248] [2019-10-15 01:10:50,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:50,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:50,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919023244] [2019-10-15 01:10:50,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:50,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:50,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:50,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:50,433 INFO L87 Difference]: Start difference. First operand 600 states and 941 transitions. Second operand 5 states. [2019-10-15 01:10:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:50,573 INFO L93 Difference]: Finished difference Result 1170 states and 1854 transitions. [2019-10-15 01:10:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:50,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-15 01:10:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:50,579 INFO L225 Difference]: With dead ends: 1170 [2019-10-15 01:10:50,579 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:10:50,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:10:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-15 01:10:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:10:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 940 transitions. [2019-10-15 01:10:50,606 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 940 transitions. Word has length 97 [2019-10-15 01:10:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:50,607 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 940 transitions. [2019-10-15 01:10:50,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 940 transitions. [2019-10-15 01:10:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-15 01:10:50,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:50,612 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:50,612 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash -647387713, now seen corresponding path program 1 times [2019-10-15 01:10:50,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:50,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200020556] [2019-10-15 01:10:50,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:50,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200020556] [2019-10-15 01:10:50,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:50,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:50,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833456164] [2019-10-15 01:10:50,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:50,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:50,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:50,820 INFO L87 Difference]: Start difference. First operand 600 states and 940 transitions. Second operand 5 states. [2019-10-15 01:10:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:50,915 INFO L93 Difference]: Finished difference Result 1170 states and 1852 transitions. [2019-10-15 01:10:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:50,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-15 01:10:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:50,925 INFO L225 Difference]: With dead ends: 1170 [2019-10-15 01:10:50,925 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:10:50,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:10:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-15 01:10:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:10:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 939 transitions. [2019-10-15 01:10:50,973 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 939 transitions. Word has length 98 [2019-10-15 01:10:50,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:50,976 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 939 transitions. [2019-10-15 01:10:50,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 939 transitions. [2019-10-15 01:10:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:10:50,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:50,979 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:50,979 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:50,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 146491208, now seen corresponding path program 1 times [2019-10-15 01:10:50,980 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:50,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644832890] [2019-10-15 01:10:50,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:50,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:51,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644832890] [2019-10-15 01:10:51,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:51,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:51,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135354569] [2019-10-15 01:10:51,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:51,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:51,180 INFO L87 Difference]: Start difference. First operand 600 states and 939 transitions. Second operand 5 states. [2019-10-15 01:10:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:51,272 INFO L93 Difference]: Finished difference Result 1170 states and 1850 transitions. [2019-10-15 01:10:51,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:51,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-15 01:10:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:51,284 INFO L225 Difference]: With dead ends: 1170 [2019-10-15 01:10:51,284 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:10:51,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:10:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-15 01:10:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:10:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 938 transitions. [2019-10-15 01:10:51,328 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 938 transitions. Word has length 99 [2019-10-15 01:10:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:51,329 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 938 transitions. [2019-10-15 01:10:51,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 938 transitions. [2019-10-15 01:10:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-15 01:10:51,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:51,333 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:51,333 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:51,334 INFO L82 PathProgramCache]: Analyzing trace with hash -460128198, now seen corresponding path program 1 times [2019-10-15 01:10:51,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:51,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923283251] [2019-10-15 01:10:51,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:51,335 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:51,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:51,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923283251] [2019-10-15 01:10:51,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:51,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:51,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667577691] [2019-10-15 01:10:51,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:51,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:51,460 INFO L87 Difference]: Start difference. First operand 600 states and 938 transitions. Second operand 5 states. [2019-10-15 01:10:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:51,534 INFO L93 Difference]: Finished difference Result 1170 states and 1848 transitions. [2019-10-15 01:10:51,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:51,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-15 01:10:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:51,540 INFO L225 Difference]: With dead ends: 1170 [2019-10-15 01:10:51,540 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:10:51,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:10:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-15 01:10:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:10:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 937 transitions. [2019-10-15 01:10:51,577 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 937 transitions. Word has length 100 [2019-10-15 01:10:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:51,629 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 937 transitions. [2019-10-15 01:10:51,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 937 transitions. [2019-10-15 01:10:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:51,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:51,632 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:51,632 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 406639265, now seen corresponding path program 1 times [2019-10-15 01:10:51,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:51,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611900591] [2019-10-15 01:10:51,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:51,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:51,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:51,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611900591] [2019-10-15 01:10:51,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:51,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:51,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708372924] [2019-10-15 01:10:51,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:51,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:51,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:51,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:51,802 INFO L87 Difference]: Start difference. First operand 600 states and 937 transitions. Second operand 9 states. [2019-10-15 01:10:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:51,959 INFO L93 Difference]: Finished difference Result 1172 states and 1847 transitions. [2019-10-15 01:10:51,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:10:51,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-15 01:10:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:51,967 INFO L225 Difference]: With dead ends: 1172 [2019-10-15 01:10:51,967 INFO L226 Difference]: Without dead ends: 600 [2019-10-15 01:10:51,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-15 01:10:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-15 01:10:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-15 01:10:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 936 transitions. [2019-10-15 01:10:51,997 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 936 transitions. Word has length 101 [2019-10-15 01:10:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:51,998 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 936 transitions. [2019-10-15 01:10:51,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 936 transitions. [2019-10-15 01:10:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:52,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:52,001 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:52,001 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:52,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1532522781, now seen corresponding path program 1 times [2019-10-15 01:10:52,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:52,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970987779] [2019-10-15 01:10:52,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:52,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:52,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:52,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970987779] [2019-10-15 01:10:52,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:52,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:10:52,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45192171] [2019-10-15 01:10:52,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:10:52,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:52,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:10:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:52,229 INFO L87 Difference]: Start difference. First operand 600 states and 936 transitions. Second operand 8 states. [2019-10-15 01:10:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:55,353 INFO L93 Difference]: Finished difference Result 2187 states and 3473 transitions. [2019-10-15 01:10:55,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:10:55,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-15 01:10:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:55,366 INFO L225 Difference]: With dead ends: 2187 [2019-10-15 01:10:55,366 INFO L226 Difference]: Without dead ends: 1621 [2019-10-15 01:10:55,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2019-10-15 01:10:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1609. [2019-10-15 01:10:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-10-15 01:10:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2515 transitions. [2019-10-15 01:10:55,439 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2515 transitions. Word has length 101 [2019-10-15 01:10:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:55,439 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 2515 transitions. [2019-10-15 01:10:55,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:10:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2515 transitions. [2019-10-15 01:10:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-15 01:10:55,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:55,441 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:55,441 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash -756173853, now seen corresponding path program 1 times [2019-10-15 01:10:55,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:55,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648501966] [2019-10-15 01:10:55,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:55,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:55,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:55,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648501966] [2019-10-15 01:10:55,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238924199] [2019-10-15 01:10:55,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:56,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:56,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:56,262 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:56,410 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:56,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:56,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457271217] [2019-10-15 01:10:56,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:56,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:56,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:56,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:56,413 INFO L87 Difference]: Start difference. First operand 1609 states and 2515 transitions. Second operand 3 states. [2019-10-15 01:10:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:56,633 INFO L93 Difference]: Finished difference Result 4631 states and 7375 transitions. [2019-10-15 01:10:56,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:56,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-15 01:10:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:56,663 INFO L225 Difference]: With dead ends: 4631 [2019-10-15 01:10:56,664 INFO L226 Difference]: Without dead ends: 3056 [2019-10-15 01:10:56,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2019-10-15 01:10:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2950. [2019-10-15 01:10:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states. [2019-10-15 01:10:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 4676 transitions. [2019-10-15 01:10:56,847 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 4676 transitions. Word has length 101 [2019-10-15 01:10:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:56,847 INFO L462 AbstractCegarLoop]: Abstraction has 2950 states and 4676 transitions. [2019-10-15 01:10:56,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:56,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 4676 transitions. [2019-10-15 01:10:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-15 01:10:56,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:56,849 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:57,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:57,065 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1355747995, now seen corresponding path program 1 times [2019-10-15 01:10:57,067 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:57,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908217735] [2019-10-15 01:10:57,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:57,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:57,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:57,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908217735] [2019-10-15 01:10:57,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954807421] [2019-10-15 01:10:57,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:58,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 2952 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:58,072 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:58,182 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:58,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:58,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156320790] [2019-10-15 01:10:58,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:58,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:58,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:58,189 INFO L87 Difference]: Start difference. First operand 2950 states and 4676 transitions. Second operand 3 states. [2019-10-15 01:10:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:58,378 INFO L93 Difference]: Finished difference Result 6479 states and 10340 transitions. [2019-10-15 01:10:58,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:58,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-15 01:10:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:58,411 INFO L225 Difference]: With dead ends: 6479 [2019-10-15 01:10:58,411 INFO L226 Difference]: Without dead ends: 3563 [2019-10-15 01:10:58,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-10-15 01:10:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3469. [2019-10-15 01:10:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3469 states. [2019-10-15 01:10:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 5506 transitions. [2019-10-15 01:10:58,652 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 5506 transitions. Word has length 102 [2019-10-15 01:10:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:58,652 INFO L462 AbstractCegarLoop]: Abstraction has 3469 states and 5506 transitions. [2019-10-15 01:10:58,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 5506 transitions. [2019-10-15 01:10:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:10:58,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:58,655 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:58,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:58,863 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:58,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1285320346, now seen corresponding path program 1 times [2019-10-15 01:10:58,864 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:58,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108537230] [2019-10-15 01:10:58,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:58,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:58,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:59,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108537230] [2019-10-15 01:10:59,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:59,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:59,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77588051] [2019-10-15 01:10:59,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:59,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:59,032 INFO L87 Difference]: Start difference. First operand 3469 states and 5506 transitions. Second operand 7 states. [2019-10-15 01:11:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:02,469 INFO L93 Difference]: Finished difference Result 10283 states and 16714 transitions. [2019-10-15 01:11:02,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:02,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-10-15 01:11:02,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:02,520 INFO L225 Difference]: With dead ends: 10283 [2019-10-15 01:11:02,520 INFO L226 Difference]: Without dead ends: 6848 [2019-10-15 01:11:02,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2019-10-15 01:11:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 6760. [2019-10-15 01:11:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6760 states. [2019-10-15 01:11:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6760 states to 6760 states and 10906 transitions. [2019-10-15 01:11:02,876 INFO L78 Accepts]: Start accepts. Automaton has 6760 states and 10906 transitions. Word has length 104 [2019-10-15 01:11:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:02,876 INFO L462 AbstractCegarLoop]: Abstraction has 6760 states and 10906 transitions. [2019-10-15 01:11:02,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 6760 states and 10906 transitions. [2019-10-15 01:11:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-15 01:11:02,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:02,878 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:02,879 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1140684113, now seen corresponding path program 1 times [2019-10-15 01:11:02,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:02,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807889480] [2019-10-15 01:11:02,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:02,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:02,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:03,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807889480] [2019-10-15 01:11:03,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:03,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:03,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228692300] [2019-10-15 01:11:03,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:03,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:03,015 INFO L87 Difference]: Start difference. First operand 6760 states and 10906 transitions. Second operand 4 states. [2019-10-15 01:11:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:03,323 INFO L93 Difference]: Finished difference Result 13478 states and 21949 transitions. [2019-10-15 01:11:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:03,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-15 01:11:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:03,416 INFO L225 Difference]: With dead ends: 13478 [2019-10-15 01:11:03,417 INFO L226 Difference]: Without dead ends: 6752 [2019-10-15 01:11:03,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2019-10-15 01:11:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6730. [2019-10-15 01:11:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6730 states. [2019-10-15 01:11:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6730 states to 6730 states and 10818 transitions. [2019-10-15 01:11:03,850 INFO L78 Accepts]: Start accepts. Automaton has 6730 states and 10818 transitions. Word has length 105 [2019-10-15 01:11:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:03,851 INFO L462 AbstractCegarLoop]: Abstraction has 6730 states and 10818 transitions. [2019-10-15 01:11:03,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6730 states and 10818 transitions. [2019-10-15 01:11:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:11:03,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:03,853 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:03,853 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:03,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1975309189, now seen corresponding path program 1 times [2019-10-15 01:11:03,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:03,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174293305] [2019-10-15 01:11:03,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:11:03,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174293305] [2019-10-15 01:11:03,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:03,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:03,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747387094] [2019-10-15 01:11:03,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:03,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:03,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:03,995 INFO L87 Difference]: Start difference. First operand 6730 states and 10818 transitions. Second operand 7 states. [2019-10-15 01:11:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:07,962 INFO L93 Difference]: Finished difference Result 20144 states and 33268 transitions. [2019-10-15 01:11:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:07,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-15 01:11:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:08,044 INFO L225 Difference]: With dead ends: 20144 [2019-10-15 01:11:08,044 INFO L226 Difference]: Without dead ends: 13448 [2019-10-15 01:11:08,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13448 states. [2019-10-15 01:11:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13448 to 13320. [2019-10-15 01:11:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13320 states. [2019-10-15 01:11:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13320 states to 13320 states and 21889 transitions. [2019-10-15 01:11:08,609 INFO L78 Accepts]: Start accepts. Automaton has 13320 states and 21889 transitions. Word has length 113 [2019-10-15 01:11:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:08,611 INFO L462 AbstractCegarLoop]: Abstraction has 13320 states and 21889 transitions. [2019-10-15 01:11:08,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 13320 states and 21889 transitions. [2019-10-15 01:11:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:11:08,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:08,613 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:08,614 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash -2114200266, now seen corresponding path program 1 times [2019-10-15 01:11:08,614 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:08,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012052175] [2019-10-15 01:11:08,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:08,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:08,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:11:08,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012052175] [2019-10-15 01:11:08,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:08,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:08,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636110863] [2019-10-15 01:11:08,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:08,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:08,725 INFO L87 Difference]: Start difference. First operand 13320 states and 21889 transitions. Second operand 4 states. [2019-10-15 01:11:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:09,305 INFO L93 Difference]: Finished difference Result 26668 states and 44300 transitions. [2019-10-15 01:11:09,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:09,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:11:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:09,403 INFO L225 Difference]: With dead ends: 26668 [2019-10-15 01:11:09,404 INFO L226 Difference]: Without dead ends: 13376 [2019-10-15 01:11:09,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13376 states. [2019-10-15 01:11:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13376 to 13328. [2019-10-15 01:11:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13328 states. [2019-10-15 01:11:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13328 states to 13328 states and 21840 transitions. [2019-10-15 01:11:09,972 INFO L78 Accepts]: Start accepts. Automaton has 13328 states and 21840 transitions. Word has length 114 [2019-10-15 01:11:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:09,972 INFO L462 AbstractCegarLoop]: Abstraction has 13328 states and 21840 transitions. [2019-10-15 01:11:09,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 13328 states and 21840 transitions. [2019-10-15 01:11:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:11:09,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:09,974 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:11:09,975 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -927294885, now seen corresponding path program 1 times [2019-10-15 01:11:09,975 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:09,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034599513] [2019-10-15 01:11:09,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:09,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:09,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:11:10,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034599513] [2019-10-15 01:11:10,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348733781] [2019-10-15 01:11:10,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:11,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 3299 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 01:11:11,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:11:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:11:11,256 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:11:11,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:11:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-15 01:11:11,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:11:11,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 9] total 25 [2019-10-15 01:11:11,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164369547] [2019-10-15 01:11:11,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:11:11,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:11,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:11:11,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:11:11,728 INFO L87 Difference]: Start difference. First operand 13328 states and 21840 transitions. Second operand 9 states.