java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:53,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:53,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:53,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:53,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:53,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:53,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:53,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:53,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:53,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:53,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:53,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:53,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:53,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:53,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:53,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:53,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:53,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:53,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:53,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:53,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:53,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:53,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:53,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:53,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:53,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:53,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:53,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:53,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:53,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:53,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:53,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:53,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:53,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:53,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:53,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:53,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:53,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:53,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:53,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:53,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:53,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:10:53,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:53,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:53,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:53,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:53,981 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:53,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:53,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:53,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:53,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:53,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:53,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:53,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:53,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:53,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:53,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:53,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:53,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:53,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:53,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:53,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:53,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:53,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:53,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:53,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:53,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:53,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:53,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:53,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:53,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:10:54,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:54,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:54,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:54,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:54,320 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:54,321 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-10-13 21:10:54,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26fdaa5e/337f302c751d4309bd689c26fc81cc0a/FLAG09fcf96c4 [2019-10-13 21:10:55,041 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:55,041 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-10-13 21:10:55,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26fdaa5e/337f302c751d4309bd689c26fc81cc0a/FLAG09fcf96c4 [2019-10-13 21:10:55,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26fdaa5e/337f302c751d4309bd689c26fc81cc0a [2019-10-13 21:10:55,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:55,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:55,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:55,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:55,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:55,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:55" (1/1) ... [2019-10-13 21:10:55,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443ffe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:55, skipping insertion in model container [2019-10-13 21:10:55,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:55" (1/1) ... [2019-10-13 21:10:55,250 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:55,344 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:56,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:56,044 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:56,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:56,259 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:56,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56 WrapperNode [2019-10-13 21:10:56,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:56,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:56,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:56,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:56,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:56,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:56,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:56,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:56,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:56,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:56,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:56,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:56,565 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:56,565 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:56,572 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:56,572 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:56,572 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:10:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:56,573 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:56,576 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:56,577 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:56,578 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:56,581 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:56,582 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:56,583 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:56,585 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:56,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:56,591 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:10:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:56,596 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:56,608 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:56,614 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:56,615 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:56,616 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:56,617 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:56,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:56,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:58,873 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:58,874 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:58,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:58 BoogieIcfgContainer [2019-10-13 21:10:58,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:58,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:58,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:58,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:58,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:55" (1/3) ... [2019-10-13 21:10:58,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64991eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:58, skipping insertion in model container [2019-10-13 21:10:58,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (2/3) ... [2019-10-13 21:10:58,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64991eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:58, skipping insertion in model container [2019-10-13 21:10:58,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:58" (3/3) ... [2019-10-13 21:10:58,885 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2019-10-13 21:10:58,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:58,909 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:58,921 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:58,969 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:58,970 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:58,970 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:58,970 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:58,970 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:58,970 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:58,970 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:58,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-10-13 21:10:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:10:59,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:59,042 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:59,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:59,057 INFO L82 PathProgramCache]: Analyzing trace with hash -517241816, now seen corresponding path program 1 times [2019-10-13 21:10:59,067 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:59,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509211410] [2019-10-13 21:10:59,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:59,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509211410] [2019-10-13 21:10:59,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:59,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:59,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146278990] [2019-10-13 21:10:59,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:59,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:59,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:59,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:59,681 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-10-13 21:10:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:59,921 INFO L93 Difference]: Finished difference Result 1179 states and 1917 transitions. [2019-10-13 21:10:59,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:59,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:10:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:59,949 INFO L225 Difference]: With dead ends: 1179 [2019-10-13 21:10:59,949 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:10:59,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:11:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:11:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:11:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 960 transitions. [2019-10-13 21:11:00,095 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 960 transitions. Word has length 107 [2019-10-13 21:11:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:00,096 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 960 transitions. [2019-10-13 21:11:00,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 960 transitions. [2019-10-13 21:11:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:11:00,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:00,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:00,105 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1593007226, now seen corresponding path program 1 times [2019-10-13 21:11:00,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:00,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180769609] [2019-10-13 21:11:00,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:00,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180769609] [2019-10-13 21:11:00,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:00,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:00,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771427063] [2019-10-13 21:11:00,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:00,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:00,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:00,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:00,360 INFO L87 Difference]: Start difference. First operand 598 states and 960 transitions. Second operand 4 states. [2019-10-13 21:11:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:00,446 INFO L93 Difference]: Finished difference Result 1159 states and 1878 transitions. [2019-10-13 21:11:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:00,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 21:11:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:00,452 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:11:00,452 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:11:00,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:11:00,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:11:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:11:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 959 transitions. [2019-10-13 21:11:00,497 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 959 transitions. Word has length 110 [2019-10-13 21:11:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:00,497 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 959 transitions. [2019-10-13 21:11:00,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 959 transitions. [2019-10-13 21:11:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:11:00,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:00,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:00,502 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:00,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2107821335, now seen corresponding path program 1 times [2019-10-13 21:11:00,503 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:00,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128770621] [2019-10-13 21:11:00,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:00,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128770621] [2019-10-13 21:11:00,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:00,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:00,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509056157] [2019-10-13 21:11:00,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:00,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:00,649 INFO L87 Difference]: Start difference. First operand 598 states and 959 transitions. Second operand 4 states. [2019-10-13 21:11:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:00,737 INFO L93 Difference]: Finished difference Result 1159 states and 1877 transitions. [2019-10-13 21:11:00,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:00,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 21:11:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:00,747 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:11:00,748 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:11:00,753 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:11:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:11:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:11:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:11:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-10-13 21:11:00,802 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 111 [2019-10-13 21:11:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:00,848 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-10-13 21:11:00,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-10-13 21:11:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:11:00,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:00,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:00,858 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:00,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:00,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1729710442, now seen corresponding path program 1 times [2019-10-13 21:11:00,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:00,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724122866] [2019-10-13 21:11:00,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:01,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724122866] [2019-10-13 21:11:01,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:01,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:01,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820294230] [2019-10-13 21:11:01,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:01,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:01,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:01,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:01,024 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-10-13 21:11:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:01,086 INFO L93 Difference]: Finished difference Result 1159 states and 1876 transitions. [2019-10-13 21:11:01,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:01,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:11:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:01,091 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:11:01,092 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:11:01,095 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:11:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:11:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:11:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:11:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-10-13 21:11:01,118 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 112 [2019-10-13 21:11:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:01,118 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-10-13 21:11:01,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-10-13 21:11:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:11:01,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:01,123 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:01,123 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1243956083, now seen corresponding path program 1 times [2019-10-13 21:11:01,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:01,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214209106] [2019-10-13 21:11:01,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:01,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214209106] [2019-10-13 21:11:01,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:01,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:01,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616068622] [2019-10-13 21:11:01,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:01,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:01,240 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-10-13 21:11:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:01,298 INFO L93 Difference]: Finished difference Result 1159 states and 1875 transitions. [2019-10-13 21:11:01,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:01,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:11:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:01,303 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:11:01,304 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:11:01,307 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:11:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:11:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:11:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:11:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-10-13 21:11:01,330 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 113 [2019-10-13 21:11:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:01,331 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-10-13 21:11:01,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-10-13 21:11:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:11:01,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:01,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:01,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash 616405170, now seen corresponding path program 1 times [2019-10-13 21:11:01,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:01,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976469258] [2019-10-13 21:11:01,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:01,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976469258] [2019-10-13 21:11:01,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:01,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:11:01,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266913219] [2019-10-13 21:11:01,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:11:01,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:01,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:11:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:01,516 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 10 states. [2019-10-13 21:11:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:01,834 INFO L93 Difference]: Finished difference Result 1117 states and 1795 transitions. [2019-10-13 21:11:01,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:01,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-13 21:11:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:01,846 INFO L225 Difference]: With dead ends: 1117 [2019-10-13 21:11:01,847 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:11:01,851 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:11:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:11:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2019-10-13 21:11:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 21:11:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 965 transitions. [2019-10-13 21:11:01,941 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 965 transitions. Word has length 114 [2019-10-13 21:11:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:01,943 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 965 transitions. [2019-10-13 21:11:01,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:11:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 965 transitions. [2019-10-13 21:11:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:11:01,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:01,954 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:01,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1035922001, now seen corresponding path program 1 times [2019-10-13 21:11:01,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:01,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994911455] [2019-10-13 21:11:01,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:02,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994911455] [2019-10-13 21:11:02,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:02,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681476939] [2019-10-13 21:11:02,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:02,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:02,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:02,076 INFO L87 Difference]: Start difference. First operand 605 states and 965 transitions. Second operand 4 states. [2019-10-13 21:11:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,132 INFO L93 Difference]: Finished difference Result 1165 states and 1881 transitions. [2019-10-13 21:11:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:02,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:11:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,141 INFO L225 Difference]: With dead ends: 1165 [2019-10-13 21:11:02,141 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:11:02,144 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:11:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:11:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:11:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:11:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 942 transitions. [2019-10-13 21:11:02,166 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 942 transitions. Word has length 114 [2019-10-13 21:11:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,167 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 942 transitions. [2019-10-13 21:11:02,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 942 transitions. [2019-10-13 21:11:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:11:02,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,171 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,172 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1806095573, now seen corresponding path program 1 times [2019-10-13 21:11:02,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399545144] [2019-10-13 21:11:02,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:02,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399545144] [2019-10-13 21:11:02,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:02,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503365864] [2019-10-13 21:11:02,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:02,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:02,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:02,328 INFO L87 Difference]: Start difference. First operand 592 states and 942 transitions. Second operand 6 states. [2019-10-13 21:11:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,543 INFO L93 Difference]: Finished difference Result 1105 states and 1773 transitions. [2019-10-13 21:11:02,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:02,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-13 21:11:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,548 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:11:02,549 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:11:02,552 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:11:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:11:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:11:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:11:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 938 transitions. [2019-10-13 21:11:02,574 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 938 transitions. Word has length 115 [2019-10-13 21:11:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,575 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 938 transitions. [2019-10-13 21:11:02,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 938 transitions. [2019-10-13 21:11:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:11:02,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,578 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 36368181, now seen corresponding path program 1 times [2019-10-13 21:11:02,583 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755952455] [2019-10-13 21:11:02,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:02,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755952455] [2019-10-13 21:11:02,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:02,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033069824] [2019-10-13 21:11:02,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:02,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:02,793 INFO L87 Difference]: Start difference. First operand 592 states and 938 transitions. Second operand 6 states. [2019-10-13 21:11:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,016 INFO L93 Difference]: Finished difference Result 1105 states and 1769 transitions. [2019-10-13 21:11:03,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:03,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-13 21:11:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,026 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:11:03,026 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:11:03,029 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:11:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:11:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:11:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:11:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 934 transitions. [2019-10-13 21:11:03,052 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 934 transitions. Word has length 116 [2019-10-13 21:11:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,053 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 934 transitions. [2019-10-13 21:11:03,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 934 transitions. [2019-10-13 21:11:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:11:03,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,056 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,057 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1408982758, now seen corresponding path program 1 times [2019-10-13 21:11:03,057 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233737615] [2019-10-13 21:11:03,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:03,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233737615] [2019-10-13 21:11:03,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:03,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689497704] [2019-10-13 21:11:03,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:03,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:03,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:03,219 INFO L87 Difference]: Start difference. First operand 592 states and 934 transitions. Second operand 6 states. [2019-10-13 21:11:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,415 INFO L93 Difference]: Finished difference Result 1105 states and 1765 transitions. [2019-10-13 21:11:03,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:03,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-13 21:11:03,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,421 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:11:03,421 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:11:03,428 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:11:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:11:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:11:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:11:03,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 930 transitions. [2019-10-13 21:11:03,449 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 930 transitions. Word has length 117 [2019-10-13 21:11:03,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,449 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 930 transitions. [2019-10-13 21:11:03,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 930 transitions. [2019-10-13 21:11:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:11:03,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,453 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,454 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -954122854, now seen corresponding path program 1 times [2019-10-13 21:11:03,454 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39326017] [2019-10-13 21:11:03,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:03,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39326017] [2019-10-13 21:11:03,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:03,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227673304] [2019-10-13 21:11:03,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:03,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:03,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:03,621 INFO L87 Difference]: Start difference. First operand 592 states and 930 transitions. Second operand 7 states. [2019-10-13 21:11:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,712 INFO L93 Difference]: Finished difference Result 1105 states and 1761 transitions. [2019-10-13 21:11:03,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:03,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-13 21:11:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,721 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:11:03,721 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:11:03,725 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:11:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:11:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:11:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:11:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 896 transitions. [2019-10-13 21:11:03,756 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 896 transitions. Word has length 117 [2019-10-13 21:11:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,756 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 896 transitions. [2019-10-13 21:11:03,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 896 transitions. [2019-10-13 21:11:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:11:03,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,761 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1388598246, now seen corresponding path program 1 times [2019-10-13 21:11:03,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103302456] [2019-10-13 21:11:03,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:03,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103302456] [2019-10-13 21:11:03,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:03,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166439770] [2019-10-13 21:11:03,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:03,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:03,946 INFO L87 Difference]: Start difference. First operand 571 states and 896 transitions. Second operand 6 states. [2019-10-13 21:11:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,088 INFO L93 Difference]: Finished difference Result 1084 states and 1727 transitions. [2019-10-13 21:11:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:04,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-13 21:11:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,093 INFO L225 Difference]: With dead ends: 1084 [2019-10-13 21:11:04,094 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:11:04,097 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:11:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:11:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:11:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:11:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 895 transitions. [2019-10-13 21:11:04,121 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 895 transitions. Word has length 118 [2019-10-13 21:11:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,123 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 895 transitions. [2019-10-13 21:11:04,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 895 transitions. [2019-10-13 21:11:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:11:04,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,127 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,127 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1119912287, now seen corresponding path program 1 times [2019-10-13 21:11:04,128 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879996342] [2019-10-13 21:11:04,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:04,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879996342] [2019-10-13 21:11:04,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:04,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:04,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108155625] [2019-10-13 21:11:04,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:04,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:04,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:04,263 INFO L87 Difference]: Start difference. First operand 571 states and 895 transitions. Second operand 6 states. [2019-10-13 21:11:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,368 INFO L93 Difference]: Finished difference Result 1084 states and 1726 transitions. [2019-10-13 21:11:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:04,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 21:11:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,375 INFO L225 Difference]: With dead ends: 1084 [2019-10-13 21:11:04,376 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:11:04,381 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:11:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:11:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:11:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:11:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-10-13 21:11:04,412 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 119 [2019-10-13 21:11:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,413 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-10-13 21:11:04,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-10-13 21:11:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:11:04,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,419 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,419 INFO L82 PathProgramCache]: Analyzing trace with hash -844049153, now seen corresponding path program 1 times [2019-10-13 21:11:04,420 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029893497] [2019-10-13 21:11:04,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:04,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029893497] [2019-10-13 21:11:04,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:04,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:11:04,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040729943] [2019-10-13 21:11:04,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:11:04,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:11:04,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:04,719 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 12 states. [2019-10-13 21:11:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,901 INFO L93 Difference]: Finished difference Result 1085 states and 1725 transitions. [2019-10-13 21:11:04,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:11:04,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-13 21:11:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,907 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:11:04,907 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:11:04,911 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:11:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:11:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:11:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:11:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-10-13 21:11:04,934 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 120 [2019-10-13 21:11:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,936 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-10-13 21:11:04,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:11:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-10-13 21:11:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:11:04,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,940 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 704955672, now seen corresponding path program 1 times [2019-10-13 21:11:04,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612768272] [2019-10-13 21:11:04,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:05,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612768272] [2019-10-13 21:11:05,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:05,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:05,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806368411] [2019-10-13 21:11:05,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:05,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:05,130 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 9 states. [2019-10-13 21:11:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:09,451 INFO L93 Difference]: Finished difference Result 1082 states and 1739 transitions. [2019-10-13 21:11:09,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:11:09,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-13 21:11:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:09,458 INFO L225 Difference]: With dead ends: 1082 [2019-10-13 21:11:09,459 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:11:09,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:11:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-13 21:11:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-13 21:11:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 912 transitions. [2019-10-13 21:11:09,497 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 912 transitions. Word has length 121 [2019-10-13 21:11:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:09,497 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 912 transitions. [2019-10-13 21:11:09,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 912 transitions. [2019-10-13 21:11:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:11:09,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:09,501 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:09,501 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash 949783563, now seen corresponding path program 1 times [2019-10-13 21:11:09,502 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:09,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753837337] [2019-10-13 21:11:09,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:09,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753837337] [2019-10-13 21:11:09,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:09,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:11:09,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390776257] [2019-10-13 21:11:09,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:11:09,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:11:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:09,695 INFO L87 Difference]: Start difference. First operand 575 states and 912 transitions. Second operand 8 states. [2019-10-13 21:11:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:16,060 INFO L93 Difference]: Finished difference Result 2026 states and 3340 transitions. [2019-10-13 21:11:16,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:11:16,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-13 21:11:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:16,077 INFO L225 Difference]: With dead ends: 2026 [2019-10-13 21:11:16,077 INFO L226 Difference]: Without dead ends: 1517 [2019-10-13 21:11:16,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:11:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-10-13 21:11:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1478. [2019-10-13 21:11:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2019-10-13 21:11:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2365 transitions. [2019-10-13 21:11:16,164 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2365 transitions. Word has length 122 [2019-10-13 21:11:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:16,165 INFO L462 AbstractCegarLoop]: Abstraction has 1478 states and 2365 transitions. [2019-10-13 21:11:16,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:11:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2365 transitions. [2019-10-13 21:11:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:11:16,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:16,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:16,170 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:16,171 INFO L82 PathProgramCache]: Analyzing trace with hash 360253614, now seen corresponding path program 1 times [2019-10-13 21:11:16,171 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:16,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635066271] [2019-10-13 21:11:16,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:16,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635066271] [2019-10-13 21:11:16,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:16,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880724744] [2019-10-13 21:11:16,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:16,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:16,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:16,337 INFO L87 Difference]: Start difference. First operand 1478 states and 2365 transitions. Second operand 9 states. [2019-10-13 21:11:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:23,802 INFO L93 Difference]: Finished difference Result 4735 states and 7800 transitions. [2019-10-13 21:11:23,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:11:23,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-13 21:11:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:23,828 INFO L225 Difference]: With dead ends: 4735 [2019-10-13 21:11:23,828 INFO L226 Difference]: Without dead ends: 3323 [2019-10-13 21:11:23,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:11:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2019-10-13 21:11:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3100. [2019-10-13 21:11:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-10-13 21:11:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 5020 transitions. [2019-10-13 21:11:23,995 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 5020 transitions. Word has length 128 [2019-10-13 21:11:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:23,995 INFO L462 AbstractCegarLoop]: Abstraction has 3100 states and 5020 transitions. [2019-10-13 21:11:23,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 5020 transitions. [2019-10-13 21:11:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:11:23,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:23,999 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:23,999 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:23,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash 352494255, now seen corresponding path program 1 times [2019-10-13 21:11:24,000 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:24,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421895859] [2019-10-13 21:11:24,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:24,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:24,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:24,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421895859] [2019-10-13 21:11:24,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:24,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:24,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688439032] [2019-10-13 21:11:24,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:24,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:24,137 INFO L87 Difference]: Start difference. First operand 3100 states and 5020 transitions. Second operand 7 states. [2019-10-13 21:11:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:28,514 INFO L93 Difference]: Finished difference Result 7942 states and 13084 transitions. [2019-10-13 21:11:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:11:28,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-13 21:11:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:28,562 INFO L225 Difference]: With dead ends: 7942 [2019-10-13 21:11:28,562 INFO L226 Difference]: Without dead ends: 5720 [2019-10-13 21:11:28,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:11:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2019-10-13 21:11:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5627. [2019-10-13 21:11:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2019-10-13 21:11:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 9190 transitions. [2019-10-13 21:11:29,031 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 9190 transitions. Word has length 128 [2019-10-13 21:11:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:29,032 INFO L462 AbstractCegarLoop]: Abstraction has 5627 states and 9190 transitions. [2019-10-13 21:11:29,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 9190 transitions. [2019-10-13 21:11:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:11:29,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:29,040 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:29,040 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash 219395717, now seen corresponding path program 1 times [2019-10-13 21:11:29,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:29,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991344413] [2019-10-13 21:11:29,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:29,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991344413] [2019-10-13 21:11:29,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:29,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:29,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854885747] [2019-10-13 21:11:29,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:29,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:29,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:29,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:29,208 INFO L87 Difference]: Start difference. First operand 5627 states and 9190 transitions. Second operand 5 states. [2019-10-13 21:11:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:29,452 INFO L93 Difference]: Finished difference Result 10384 states and 17048 transitions. [2019-10-13 21:11:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:29,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-13 21:11:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:29,506 INFO L225 Difference]: With dead ends: 10384 [2019-10-13 21:11:29,506 INFO L226 Difference]: Without dead ends: 5745 [2019-10-13 21:11:29,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2019-10-13 21:11:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 5679. [2019-10-13 21:11:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-10-13 21:11:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 9263 transitions. [2019-10-13 21:11:29,853 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 9263 transitions. Word has length 133 [2019-10-13 21:11:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:29,854 INFO L462 AbstractCegarLoop]: Abstraction has 5679 states and 9263 transitions. [2019-10-13 21:11:29,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 9263 transitions. [2019-10-13 21:11:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:11:29,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:29,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:29,858 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1503957235, now seen corresponding path program 1 times [2019-10-13 21:11:29,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:29,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982519575] [2019-10-13 21:11:29,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:29,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982519575] [2019-10-13 21:11:29,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:29,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:29,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058586625] [2019-10-13 21:11:29,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:29,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:29,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:29,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:29,996 INFO L87 Difference]: Start difference. First operand 5679 states and 9263 transitions. Second operand 7 states.