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_spec14_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:14,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:14,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:14,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:14,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:15,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:15,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:15,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:15,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:15,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:15,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:15,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:15,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:15,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:15,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:15,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:15,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:15,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:15,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:15,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:15,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:15,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:15,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:15,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:15,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:15,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:15,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:15,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:15,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:15,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:15,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:15,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:15,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:15,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:15,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:15,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:15,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:15,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:15,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:15,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:15,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:15,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:09:15,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:15,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:15,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:15,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:15,059 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:15,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:15,059 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:15,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:15,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:15,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:15,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:15,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:15,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:15,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:15,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:15,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:15,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:15,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:15,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:15,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:15,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:15,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:15,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:15,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:15,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:15,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:15,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:15,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:15,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:09:15,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:15,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:15,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:15,386 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:15,386 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:15,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-10-13 21:09:15,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9e540b8/8dbf39dcf2a94b708d069be8bafb4ebd/FLAG6aac0f045 [2019-10-13 21:09:16,163 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:16,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product32.cil.c [2019-10-13 21:09:16,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9e540b8/8dbf39dcf2a94b708d069be8bafb4ebd/FLAG6aac0f045 [2019-10-13 21:09:16,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9e540b8/8dbf39dcf2a94b708d069be8bafb4ebd [2019-10-13 21:09:16,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:16,353 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:16,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:16,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:16,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:16,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:16" (1/1) ... [2019-10-13 21:09:16,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a57a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:16, skipping insertion in model container [2019-10-13 21:09:16,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:16" (1/1) ... [2019-10-13 21:09:16,370 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:16,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:17,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:17,261 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:17,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:17,479 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:17,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17 WrapperNode [2019-10-13 21:09:17,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:17,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:17,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:17,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:17,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... [2019-10-13 21:09:17,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... [2019-10-13 21:09:17,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... [2019-10-13 21:09:17,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... [2019-10-13 21:09:17,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... [2019-10-13 21:09:17,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... [2019-10-13 21:09:17,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... [2019-10-13 21:09:17,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:17,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:17,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:17,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:17,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:17,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:17,755 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:17,756 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:17,757 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:17,758 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:17,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:17,760 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:17,762 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:09:17,763 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:09:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:09:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:17,764 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:17,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:09:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:09:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-13 21:09:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-13 21:09:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:17,770 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:17,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:17,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:17,772 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:17,773 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:17,774 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:17,775 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:17,776 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:17,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:17,778 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:17,779 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:17,780 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:17,781 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:17,781 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:17,781 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:17,781 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:17,781 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:17,781 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:09:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:09:17,782 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:17,783 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-13 21:09:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:20,167 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:20,167 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:20,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:20 BoogieIcfgContainer [2019-10-13 21:09:20,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:20,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:20,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:20,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:20,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:09:16" (1/3) ... [2019-10-13 21:09:20,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec3ba09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:20, skipping insertion in model container [2019-10-13 21:09:20,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:17" (2/3) ... [2019-10-13 21:09:20,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec3ba09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:20, skipping insertion in model container [2019-10-13 21:09:20,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:20" (3/3) ... [2019-10-13 21:09:20,184 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product32.cil.c [2019-10-13 21:09:20,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:20,210 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:20,226 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:20,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:20,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:20,284 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:20,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:20,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:20,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:20,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:20,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states. [2019-10-13 21:09:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:09:20,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,369 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] [2019-10-13 21:09:20,373 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1156947632, now seen corresponding path program 1 times [2019-10-13 21:09:20,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556536956] [2019-10-13 21:09:20,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,392 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,012 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-13 21:09:21,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556536956] [2019-10-13 21:09:21,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:21,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:21,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25552360] [2019-10-13 21:09:21,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:21,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:21,042 INFO L87 Difference]: Start difference. First operand 798 states. Second operand 4 states. [2019-10-13 21:09:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:21,300 INFO L93 Difference]: Finished difference Result 1280 states and 2032 transitions. [2019-10-13 21:09:21,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:21,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-13 21:09:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:21,342 INFO L225 Difference]: With dead ends: 1280 [2019-10-13 21:09:21,342 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:09:21,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:09:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-13 21:09:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:09:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1007 transitions. [2019-10-13 21:09:21,496 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1007 transitions. Word has length 87 [2019-10-13 21:09:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:21,497 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1007 transitions. [2019-10-13 21:09:21,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1007 transitions. [2019-10-13 21:09:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:09:21,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:21,503 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] [2019-10-13 21:09:21,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1296609552, now seen corresponding path program 1 times [2019-10-13 21:09:21,504 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:21,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472589188] [2019-10-13 21:09:21,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,740 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-13 21:09:21,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472589188] [2019-10-13 21:09:21,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:21,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:21,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619526979] [2019-10-13 21:09:21,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:21,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:21,746 INFO L87 Difference]: Start difference. First operand 643 states and 1007 transitions. Second operand 4 states. [2019-10-13 21:09:21,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:21,846 INFO L93 Difference]: Finished difference Result 1253 states and 1975 transitions. [2019-10-13 21:09:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:21,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 21:09:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:21,852 INFO L225 Difference]: With dead ends: 1253 [2019-10-13 21:09:21,852 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:09:21,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:09:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-13 21:09:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:09:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1006 transitions. [2019-10-13 21:09:21,889 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1006 transitions. Word has length 88 [2019-10-13 21:09:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:21,890 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1006 transitions. [2019-10-13 21:09:21,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1006 transitions. [2019-10-13 21:09:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:09:21,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:21,894 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] [2019-10-13 21:09:21,894 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:21,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:21,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1734809644, now seen corresponding path program 1 times [2019-10-13 21:09:21,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:21,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404232133] [2019-10-13 21:09:21,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:22,104 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-13 21:09:22,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404232133] [2019-10-13 21:09:22,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:22,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:22,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929806617] [2019-10-13 21:09:22,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:22,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:22,111 INFO L87 Difference]: Start difference. First operand 643 states and 1006 transitions. Second operand 4 states. [2019-10-13 21:09:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,195 INFO L93 Difference]: Finished difference Result 1253 states and 1974 transitions. [2019-10-13 21:09:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:22,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-13 21:09:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,207 INFO L225 Difference]: With dead ends: 1253 [2019-10-13 21:09:22,207 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:09:22,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:09:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-13 21:09:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:09:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1005 transitions. [2019-10-13 21:09:22,294 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1005 transitions. Word has length 89 [2019-10-13 21:09:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:22,294 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1005 transitions. [2019-10-13 21:09:22,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1005 transitions. [2019-10-13 21:09:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:09:22,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,297 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] [2019-10-13 21:09:22,297 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1457208820, now seen corresponding path program 1 times [2019-10-13 21:09:22,298 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:22,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670530238] [2019-10-13 21:09:22,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:22,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-13 21:09:22,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670530238] [2019-10-13 21:09:22,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:22,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:22,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384289762] [2019-10-13 21:09:22,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:22,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:22,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:22,413 INFO L87 Difference]: Start difference. First operand 643 states and 1005 transitions. Second operand 4 states. [2019-10-13 21:09:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,477 INFO L93 Difference]: Finished difference Result 1253 states and 1973 transitions. [2019-10-13 21:09:22,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:22,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:09:22,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,491 INFO L225 Difference]: With dead ends: 1253 [2019-10-13 21:09:22,491 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:09:22,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:09:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-13 21:09:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:09:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1004 transitions. [2019-10-13 21:09:22,534 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1004 transitions. Word has length 90 [2019-10-13 21:09:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:22,534 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1004 transitions. [2019-10-13 21:09:22,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1004 transitions. [2019-10-13 21:09:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:09:22,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,541 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] [2019-10-13 21:09:22,541 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1221885528, now seen corresponding path program 1 times [2019-10-13 21:09:22,542 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:22,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250182216] [2019-10-13 21:09:22,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:22,690 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-13 21:09:22,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250182216] [2019-10-13 21:09:22,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:22,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:22,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028315801] [2019-10-13 21:09:22,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:22,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:22,692 INFO L87 Difference]: Start difference. First operand 643 states and 1004 transitions. Second operand 4 states. [2019-10-13 21:09:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,756 INFO L93 Difference]: Finished difference Result 1253 states and 1972 transitions. [2019-10-13 21:09:22,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:22,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:09:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,764 INFO L225 Difference]: With dead ends: 1253 [2019-10-13 21:09:22,764 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:09:22,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:09:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-13 21:09:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:09:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1003 transitions. [2019-10-13 21:09:22,792 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1003 transitions. Word has length 91 [2019-10-13 21:09:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:22,793 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1003 transitions. [2019-10-13 21:09:22,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1003 transitions. [2019-10-13 21:09:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:09:22,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,795 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] [2019-10-13 21:09:22,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2113150200, now seen corresponding path program 1 times [2019-10-13 21:09:22,796 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:22,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54851720] [2019-10-13 21:09:22,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,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-13 21:09:23,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54851720] [2019-10-13 21:09:23,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:23,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:09:23,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210207859] [2019-10-13 21:09:23,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:09:23,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:09:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:09:23,030 INFO L87 Difference]: Start difference. First operand 643 states and 1003 transitions. Second operand 10 states. [2019-10-13 21:09:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:23,255 INFO L93 Difference]: Finished difference Result 1258 states and 1979 transitions. [2019-10-13 21:09:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:23,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 21:09:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:23,263 INFO L225 Difference]: With dead ends: 1258 [2019-10-13 21:09:23,264 INFO L226 Difference]: Without dead ends: 652 [2019-10-13 21:09:23,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-10-13 21:09:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 650. [2019-10-13 21:09:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-13 21:09:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1013 transitions. [2019-10-13 21:09:23,364 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1013 transitions. Word has length 92 [2019-10-13 21:09:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,365 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1013 transitions. [2019-10-13 21:09:23,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:09:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1013 transitions. [2019-10-13 21:09:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:09:23,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,370 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] [2019-10-13 21:09:23,370 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2012238233, now seen corresponding path program 1 times [2019-10-13 21:09:23,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605982380] [2019-10-13 21:09:23,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,487 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-13 21:09:23,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605982380] [2019-10-13 21:09:23,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:23,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:23,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731536930] [2019-10-13 21:09:23,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:23,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:23,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:23,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:23,490 INFO L87 Difference]: Start difference. First operand 650 states and 1013 transitions. Second operand 4 states. [2019-10-13 21:09:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:23,552 INFO L93 Difference]: Finished difference Result 1259 states and 1980 transitions. [2019-10-13 21:09:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:23,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:09:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:23,559 INFO L225 Difference]: With dead ends: 1259 [2019-10-13 21:09:23,560 INFO L226 Difference]: Without dead ends: 646 [2019-10-13 21:09:23,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-10-13 21:09:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-10-13 21:09:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-13 21:09:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1006 transitions. [2019-10-13 21:09:23,587 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1006 transitions. Word has length 92 [2019-10-13 21:09:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,587 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 1006 transitions. [2019-10-13 21:09:23,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1006 transitions. [2019-10-13 21:09:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:09:23,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,590 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-13 21:09:23,590 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash 852807042, now seen corresponding path program 1 times [2019-10-13 21:09:23,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7075498] [2019-10-13 21:09:23,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,709 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-13 21:09:23,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7075498] [2019-10-13 21:09:23,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:23,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:23,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479078997] [2019-10-13 21:09:23,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:23,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:23,712 INFO L87 Difference]: Start difference. First operand 646 states and 1006 transitions. Second operand 6 states. [2019-10-13 21:09:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,022 INFO L93 Difference]: Finished difference Result 1272 states and 2004 transitions. [2019-10-13 21:09:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:24,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-13 21:09:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,030 INFO L225 Difference]: With dead ends: 1272 [2019-10-13 21:09:24,030 INFO L226 Difference]: Without dead ends: 654 [2019-10-13 21:09:24,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-13 21:09:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2019-10-13 21:09:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-13 21:09:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-10-13 21:09:24,071 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 93 [2019-10-13 21:09:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:24,073 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-10-13 21:09:24,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-10-13 21:09:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:09:24,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:24,078 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-13 21:09:24,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash -535079125, now seen corresponding path program 1 times [2019-10-13 21:09:24,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913771028] [2019-10-13 21:09:24,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,285 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-13 21:09:24,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913771028] [2019-10-13 21:09:24,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:24,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:24,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302471933] [2019-10-13 21:09:24,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:24,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:24,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:24,289 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 6 states. [2019-10-13 21:09:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,615 INFO L93 Difference]: Finished difference Result 1235 states and 1919 transitions. [2019-10-13 21:09:24,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:24,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-13 21:09:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,623 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:09:24,623 INFO L226 Difference]: Without dead ends: 651 [2019-10-13 21:09:24,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-13 21:09:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-13 21:09:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-13 21:09:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1003 transitions. [2019-10-13 21:09:24,655 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1003 transitions. Word has length 94 [2019-10-13 21:09:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:24,655 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1003 transitions. [2019-10-13 21:09:24,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1003 transitions. [2019-10-13 21:09:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:09:24,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:24,658 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-13 21:09:24,658 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1647609305, now seen corresponding path program 1 times [2019-10-13 21:09:24,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099436214] [2019-10-13 21:09:24,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,820 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-13 21:09:24,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099436214] [2019-10-13 21:09:24,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:24,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:24,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071006590] [2019-10-13 21:09:24,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:24,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:24,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:24,823 INFO L87 Difference]: Start difference. First operand 651 states and 1003 transitions. Second operand 6 states. [2019-10-13 21:09:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,029 INFO L93 Difference]: Finished difference Result 1235 states and 1915 transitions. [2019-10-13 21:09:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:25,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:09:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,035 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:09:25,035 INFO L226 Difference]: Without dead ends: 651 [2019-10-13 21:09:25,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-13 21:09:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-13 21:09:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-13 21:09:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 999 transitions. [2019-10-13 21:09:25,060 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 999 transitions. Word has length 95 [2019-10-13 21:09:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,061 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 999 transitions. [2019-10-13 21:09:25,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 999 transitions. [2019-10-13 21:09:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:09:25,063 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,063 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-13 21:09:25,063 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1752053415, now seen corresponding path program 1 times [2019-10-13 21:09:25,064 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748617307] [2019-10-13 21:09:25,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,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-13 21:09:25,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748617307] [2019-10-13 21:09:25,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:25,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:25,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467891531] [2019-10-13 21:09:25,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:25,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:25,185 INFO L87 Difference]: Start difference. First operand 651 states and 999 transitions. Second operand 7 states. [2019-10-13 21:09:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,282 INFO L93 Difference]: Finished difference Result 1238 states and 1915 transitions. [2019-10-13 21:09:25,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:25,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:09:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,292 INFO L225 Difference]: With dead ends: 1238 [2019-10-13 21:09:25,292 INFO L226 Difference]: Without dead ends: 633 [2019-10-13 21:09:25,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-13 21:09:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2019-10-13 21:09:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-13 21:09:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 962 transitions. [2019-10-13 21:09:25,322 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 962 transitions. Word has length 95 [2019-10-13 21:09:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,323 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 962 transitions. [2019-10-13 21:09:25,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 962 transitions. [2019-10-13 21:09:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:09:25,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,325 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-13 21:09:25,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1480928816, now seen corresponding path program 1 times [2019-10-13 21:09:25,326 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688187281] [2019-10-13 21:09:25,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,454 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-13 21:09:25,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688187281] [2019-10-13 21:09:25,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:25,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:25,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225524825] [2019-10-13 21:09:25,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:25,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:25,458 INFO L87 Difference]: Start difference. First operand 630 states and 962 transitions. Second operand 6 states. [2019-10-13 21:09:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,655 INFO L93 Difference]: Finished difference Result 1214 states and 1874 transitions. [2019-10-13 21:09:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:25,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:09:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,663 INFO L225 Difference]: With dead ends: 1214 [2019-10-13 21:09:25,664 INFO L226 Difference]: Without dead ends: 630 [2019-10-13 21:09:25,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-13 21:09:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-13 21:09:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-13 21:09:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 961 transitions. [2019-10-13 21:09:25,707 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 961 transitions. Word has length 96 [2019-10-13 21:09:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,708 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 961 transitions. [2019-10-13 21:09:25,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 961 transitions. [2019-10-13 21:09:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:09:25,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,710 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-13 21:09:25,711 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1356369204, now seen corresponding path program 1 times [2019-10-13 21:09:25,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598366764] [2019-10-13 21:09:25,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,875 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-13 21:09:25,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598366764] [2019-10-13 21:09:25,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:25,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:25,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021753710] [2019-10-13 21:09:25,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:25,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:25,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:25,879 INFO L87 Difference]: Start difference. First operand 630 states and 961 transitions. Second operand 6 states. [2019-10-13 21:09:26,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:26,013 INFO L93 Difference]: Finished difference Result 1214 states and 1873 transitions. [2019-10-13 21:09:26,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:26,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:09:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:26,018 INFO L225 Difference]: With dead ends: 1214 [2019-10-13 21:09:26,019 INFO L226 Difference]: Without dead ends: 630 [2019-10-13 21:09:26,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-13 21:09:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-13 21:09:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-13 21:09:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 960 transitions. [2019-10-13 21:09:26,053 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 960 transitions. Word has length 97 [2019-10-13 21:09:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:26,055 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 960 transitions. [2019-10-13 21:09:26,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 960 transitions. [2019-10-13 21:09:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:09:26,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:26,057 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-13 21:09:26,057 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:26,057 INFO L82 PathProgramCache]: Analyzing trace with hash -156026571, now seen corresponding path program 1 times [2019-10-13 21:09:26,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:26,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897763042] [2019-10-13 21:09:26,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,262 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-13 21:09:26,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897763042] [2019-10-13 21:09:26,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:26,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:09:26,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39087940] [2019-10-13 21:09:26,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:09:26,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:09:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:26,265 INFO L87 Difference]: Start difference. First operand 630 states and 960 transitions. Second operand 12 states. [2019-10-13 21:09:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:26,551 INFO L93 Difference]: Finished difference Result 1220 states and 1883 transitions. [2019-10-13 21:09:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:09:26,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-13 21:09:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:26,557 INFO L225 Difference]: With dead ends: 1220 [2019-10-13 21:09:26,557 INFO L226 Difference]: Without dead ends: 637 [2019-10-13 21:09:26,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-13 21:09:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 635. [2019-10-13 21:09:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:09:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 966 transitions. [2019-10-13 21:09:26,586 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 966 transitions. Word has length 98 [2019-10-13 21:09:26,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:26,588 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 966 transitions. [2019-10-13 21:09:26,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:09:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 966 transitions. [2019-10-13 21:09:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:09:26,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:26,590 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-13 21:09:26,590 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1563321933, now seen corresponding path program 1 times [2019-10-13 21:09:26,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:26,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438740235] [2019-10-13 21:09:26,591 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,795 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-13 21:09:26,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438740235] [2019-10-13 21:09:26,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:26,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:26,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449761320] [2019-10-13 21:09:26,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:26,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:26,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:26,798 INFO L87 Difference]: Start difference. First operand 635 states and 966 transitions. Second operand 9 states. [2019-10-13 21:09:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:32,467 INFO L93 Difference]: Finished difference Result 1846 states and 2913 transitions. [2019-10-13 21:09:32,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:09:32,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-13 21:09:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:32,478 INFO L225 Difference]: With dead ends: 1846 [2019-10-13 21:09:32,479 INFO L226 Difference]: Without dead ends: 1264 [2019-10-13 21:09:32,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:09:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-10-13 21:09:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1240. [2019-10-13 21:09:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2019-10-13 21:09:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1948 transitions. [2019-10-13 21:09:32,542 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1948 transitions. Word has length 99 [2019-10-13 21:09:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:32,542 INFO L462 AbstractCegarLoop]: Abstraction has 1240 states and 1948 transitions. [2019-10-13 21:09:32,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1948 transitions. [2019-10-13 21:09:32,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:09:32,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:32,544 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-13 21:09:32,544 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:32,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:32,545 INFO L82 PathProgramCache]: Analyzing trace with hash -202638925, now seen corresponding path program 1 times [2019-10-13 21:09:32,545 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:32,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771114230] [2019-10-13 21:09:32,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:32,546 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:32,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:32,670 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-13 21:09:32,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771114230] [2019-10-13 21:09:32,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:32,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:32,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864927171] [2019-10-13 21:09:32,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:32,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:32,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:32,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:32,673 INFO L87 Difference]: Start difference. First operand 1240 states and 1948 transitions. Second operand 6 states. [2019-10-13 21:09:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:33,412 INFO L93 Difference]: Finished difference Result 2445 states and 3942 transitions. [2019-10-13 21:09:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:33,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-13 21:09:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:33,422 INFO L225 Difference]: With dead ends: 2445 [2019-10-13 21:09:33,422 INFO L226 Difference]: Without dead ends: 1258 [2019-10-13 21:09:33,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-13 21:09:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-13 21:09:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-13 21:09:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1968 transitions. [2019-10-13 21:09:33,508 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1968 transitions. Word has length 100 [2019-10-13 21:09:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:33,509 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 1968 transitions. [2019-10-13 21:09:33,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1968 transitions. [2019-10-13 21:09:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:09:33,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:33,512 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-13 21:09:33,512 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1419649865, now seen corresponding path program 1 times [2019-10-13 21:09:33,513 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:33,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664421563] [2019-10-13 21:09:33,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:33,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:33,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:33,743 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-13 21:09:33,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664421563] [2019-10-13 21:09:33,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:33,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:33,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317183810] [2019-10-13 21:09:33,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:33,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:33,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:33,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:33,746 INFO L87 Difference]: Start difference. First operand 1256 states and 1968 transitions. Second operand 9 states. [2019-10-13 21:09:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:39,894 INFO L93 Difference]: Finished difference Result 3904 states and 6289 transitions. [2019-10-13 21:09:39,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:09:39,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-13 21:09:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:39,918 INFO L225 Difference]: With dead ends: 3904 [2019-10-13 21:09:39,918 INFO L226 Difference]: Without dead ends: 2701 [2019-10-13 21:09:39,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:09:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-10-13 21:09:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2646. [2019-10-13 21:09:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2019-10-13 21:09:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 4241 transitions. [2019-10-13 21:09:40,156 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 4241 transitions. Word has length 101 [2019-10-13 21:09:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:40,156 INFO L462 AbstractCegarLoop]: Abstraction has 2646 states and 4241 transitions. [2019-10-13 21:09:40,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 4241 transitions. [2019-10-13 21:09:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:09:40,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:40,159 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-13 21:09:40,160 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash -940794569, now seen corresponding path program 1 times [2019-10-13 21:09:40,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:40,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140651786] [2019-10-13 21:09:40,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:40,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:40,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:40,328 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-13 21:09:40,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140651786] [2019-10-13 21:09:40,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:40,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:40,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459228588] [2019-10-13 21:09:40,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:40,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:40,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:40,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:40,331 INFO L87 Difference]: Start difference. First operand 2646 states and 4241 transitions. Second operand 9 states. [2019-10-13 21:09:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:46,574 INFO L93 Difference]: Finished difference Result 7476 states and 12248 transitions. [2019-10-13 21:09:46,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:09:46,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-13 21:09:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:46,615 INFO L225 Difference]: With dead ends: 7476 [2019-10-13 21:09:46,615 INFO L226 Difference]: Without dead ends: 4889 [2019-10-13 21:09:46,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:09:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2019-10-13 21:09:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4764. [2019-10-13 21:09:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4764 states. [2019-10-13 21:09:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 7713 transitions. [2019-10-13 21:09:47,015 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 7713 transitions. Word has length 102 [2019-10-13 21:09:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:47,015 INFO L462 AbstractCegarLoop]: Abstraction has 4764 states and 7713 transitions. [2019-10-13 21:09:47,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 7713 transitions. [2019-10-13 21:09:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:09:47,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:47,019 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-13 21:09:47,019 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash 865847124, now seen corresponding path program 1 times [2019-10-13 21:09:47,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:47,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960238582] [2019-10-13 21:09:47,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:47,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:47,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:47,150 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-13 21:09:47,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960238582] [2019-10-13 21:09:47,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:47,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:47,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676756691] [2019-10-13 21:09:47,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:47,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:47,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:47,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:47,153 INFO L87 Difference]: Start difference. First operand 4764 states and 7713 transitions. Second operand 9 states. [2019-10-13 21:09:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:47,460 INFO L93 Difference]: Finished difference Result 7226 states and 11678 transitions. [2019-10-13 21:09:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:47,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-13 21:09:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:47,483 INFO L225 Difference]: With dead ends: 7226 [2019-10-13 21:09:47,483 INFO L226 Difference]: Without dead ends: 2509 [2019-10-13 21:09:47,511 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-13 21:09:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-10-13 21:09:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2019-10-13 21:09:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-10-13 21:09:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 4008 transitions. [2019-10-13 21:09:47,619 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 4008 transitions. Word has length 102 [2019-10-13 21:09:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:47,619 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 4008 transitions. [2019-10-13 21:09:47,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4008 transitions. [2019-10-13 21:09:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:09:47,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:47,621 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] [2019-10-13 21:09:47,621 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash 570306491, now seen corresponding path program 1 times [2019-10-13 21:09:47,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:47,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736160780] [2019-10-13 21:09:47,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:47,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:47,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:47,759 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-13 21:09:47,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736160780] [2019-10-13 21:09:47,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:47,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:47,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045185486] [2019-10-13 21:09:47,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:47,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:47,762 INFO L87 Difference]: Start difference. First operand 2507 states and 4008 transitions. Second operand 9 states.