java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:36,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:36,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:36,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:36,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:36,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:36,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:36,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:36,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:36,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:36,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:36,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:36,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:36,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:36,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:36,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:36,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:36,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:36,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:36,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:36,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:36,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:36,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:36,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:36,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:36,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:36,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:36,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:36,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:36,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:36,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:36,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:36,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:36,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:36,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:36,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:36,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:36,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:36,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:36,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:36,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:36,671 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:11:36,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:36,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:36,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:36,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:36,690 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:36,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:36,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:36,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:36,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:36,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:36,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:36,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:36,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:36,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:36,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:36,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:36,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:36,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:36,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:36,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:36,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:36,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:36,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:36,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:36,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:36,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:36,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:36,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:36,695 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:11:36,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:37,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:37,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:37,007 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:37,007 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:37,008 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c [2019-10-13 21:11:37,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35aacb24/9bff0d6f03dd4a1799af1816f096a055/FLAGab4641795 [2019-10-13 21:11:37,698 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:37,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c [2019-10-13 21:11:37,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35aacb24/9bff0d6f03dd4a1799af1816f096a055/FLAGab4641795 [2019-10-13 21:11:37,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35aacb24/9bff0d6f03dd4a1799af1816f096a055 [2019-10-13 21:11:37,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:37,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:37,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:37,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:37,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:37,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:37" (1/1) ... [2019-10-13 21:11:37,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c301fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:37, skipping insertion in model container [2019-10-13 21:11:37,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:37" (1/1) ... [2019-10-13 21:11:37,972 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:38,055 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:38,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:38,794 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:38,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:39,021 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:39,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39 WrapperNode [2019-10-13 21:11:39,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:39,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:39,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:39,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:39,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (1/1) ... [2019-10-13 21:11:39,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (1/1) ... [2019-10-13 21:11:39,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (1/1) ... [2019-10-13 21:11:39,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (1/1) ... [2019-10-13 21:11:39,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (1/1) ... [2019-10-13 21:11:39,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (1/1) ... [2019-10-13 21:11:39,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (1/1) ... [2019-10-13 21:11:39,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:39,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:39,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:39,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:39,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (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:11:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:39,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:39,312 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:39,313 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:39,313 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:11:39,313 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:11:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:39,315 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:39,315 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:39,317 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:39,317 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:39,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:39,320 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:11:39,320 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:11:39,320 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:39,320 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:39,320 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:39,320 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:11:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:11:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:39,322 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:39,322 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:11:39,322 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:11:39,322 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:39,323 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:39,324 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:39,325 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:39,325 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:39,325 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:39,325 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:39,325 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:39,325 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:39,326 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:39,326 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:39,326 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:39,326 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:39,327 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:39,327 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:39,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:39,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:39,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:39,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:39,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:39,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:39,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:39,329 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:39,331 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:11:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:11:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:11:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:11:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:11:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:11:39,338 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:11:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:11:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:39,342 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:39,345 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:39,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:41,441 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:41,442 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:41,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:41 BoogieIcfgContainer [2019-10-13 21:11:41,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:41,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:41,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:41,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:41,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:37" (1/3) ... [2019-10-13 21:11:41,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e39b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:41, skipping insertion in model container [2019-10-13 21:11:41,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:39" (2/3) ... [2019-10-13 21:11:41,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e39b863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:41, skipping insertion in model container [2019-10-13 21:11:41,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:41" (3/3) ... [2019-10-13 21:11:41,455 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2019-10-13 21:11:41,465 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:41,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:41,488 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:41,534 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:41,535 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:41,535 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:41,535 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:41,535 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:41,535 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:41,535 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:41,535 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states. [2019-10-13 21:11:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:11:41,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:41,614 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:41,616 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1013618199, now seen corresponding path program 1 times [2019-10-13 21:11:41,631 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:41,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264960519] [2019-10-13 21:11:41,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:42,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264960519] [2019-10-13 21:11:42,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:42,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:42,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673131300] [2019-10-13 21:11:42,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:42,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:42,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:42,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:42,396 INFO L87 Difference]: Start difference. First operand 821 states. Second operand 7 states. [2019-10-13 21:11:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:42,727 INFO L93 Difference]: Finished difference Result 1321 states and 2120 transitions. [2019-10-13 21:11:42,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:42,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-13 21:11:42,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:42,769 INFO L225 Difference]: With dead ends: 1321 [2019-10-13 21:11:42,769 INFO L226 Difference]: Without dead ends: 669 [2019-10-13 21:11:42,782 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:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-13 21:11:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2019-10-13 21:11:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-13 21:11:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1055 transitions. [2019-10-13 21:11:42,931 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1055 transitions. Word has length 141 [2019-10-13 21:11:42,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:42,931 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 1055 transitions. [2019-10-13 21:11:42,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1055 transitions. [2019-10-13 21:11:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:42,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:42,938 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:42,938 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1339739785, now seen corresponding path program 1 times [2019-10-13 21:11:42,939 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:42,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256431637] [2019-10-13 21:11:42,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:42,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:42,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:43,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256431637] [2019-10-13 21:11:43,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:43,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:43,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437483029] [2019-10-13 21:11:43,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:43,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:43,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:43,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:43,129 INFO L87 Difference]: Start difference. First operand 667 states and 1055 transitions. Second operand 4 states. [2019-10-13 21:11:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:43,193 INFO L93 Difference]: Finished difference Result 1300 states and 2075 transitions. [2019-10-13 21:11:43,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:43,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-13 21:11:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:43,199 INFO L225 Difference]: With dead ends: 1300 [2019-10-13 21:11:43,199 INFO L226 Difference]: Without dead ends: 649 [2019-10-13 21:11:43,203 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:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-13 21:11:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2019-10-13 21:11:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-10-13 21:11:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1022 transitions. [2019-10-13 21:11:43,282 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1022 transitions. Word has length 142 [2019-10-13 21:11:43,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:43,284 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 1022 transitions. [2019-10-13 21:11:43,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1022 transitions. [2019-10-13 21:11:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:43,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:43,297 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:43,297 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -415526825, now seen corresponding path program 1 times [2019-10-13 21:11:43,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:43,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114835138] [2019-10-13 21:11:43,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:43,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114835138] [2019-10-13 21:11:43,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:43,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:43,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561962752] [2019-10-13 21:11:43,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:43,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:43,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:43,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:43,551 INFO L87 Difference]: Start difference. First operand 649 states and 1022 transitions. Second operand 7 states. [2019-10-13 21:11:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:43,649 INFO L93 Difference]: Finished difference Result 1269 states and 2017 transitions. [2019-10-13 21:11:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:43,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-13 21:11:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:43,654 INFO L225 Difference]: With dead ends: 1269 [2019-10-13 21:11:43,655 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:11:43,659 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:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:11:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-13 21:11:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:11:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1009 transitions. [2019-10-13 21:11:43,688 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1009 transitions. Word has length 142 [2019-10-13 21:11:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:43,689 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1009 transitions. [2019-10-13 21:11:43,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1009 transitions. [2019-10-13 21:11:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:11:43,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:43,697 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:43,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:43,698 INFO L82 PathProgramCache]: Analyzing trace with hash -390482629, now seen corresponding path program 1 times [2019-10-13 21:11:43,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:43,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104599881] [2019-10-13 21:11:43,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:43,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104599881] [2019-10-13 21:11:43,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:43,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:43,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855063580] [2019-10-13 21:11:43,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:43,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:43,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:43,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:43,867 INFO L87 Difference]: Start difference. First operand 643 states and 1009 transitions. Second operand 7 states. [2019-10-13 21:11:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:43,978 INFO L93 Difference]: Finished difference Result 1257 states and 1991 transitions. [2019-10-13 21:11:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:43,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:11:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:43,991 INFO L225 Difference]: With dead ends: 1257 [2019-10-13 21:11:43,991 INFO L226 Difference]: Without dead ends: 637 [2019-10-13 21:11:43,998 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:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-13 21:11:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-13 21:11:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-13 21:11:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 996 transitions. [2019-10-13 21:11:44,035 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 996 transitions. Word has length 143 [2019-10-13 21:11:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:44,036 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 996 transitions. [2019-10-13 21:11:44,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 996 transitions. [2019-10-13 21:11:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:44,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:44,042 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:44,043 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:44,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1764754427, now seen corresponding path program 1 times [2019-10-13 21:11:44,043 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:44,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984993024] [2019-10-13 21:11:44,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:44,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984993024] [2019-10-13 21:11:44,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:44,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:44,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985228606] [2019-10-13 21:11:44,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:44,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:44,339 INFO L87 Difference]: Start difference. First operand 637 states and 996 transitions. Second operand 7 states. [2019-10-13 21:11:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:44,434 INFO L93 Difference]: Finished difference Result 1245 states and 1965 transitions. [2019-10-13 21:11:44,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:44,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:44,445 INFO L225 Difference]: With dead ends: 1245 [2019-10-13 21:11:44,445 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 21:11:44,451 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:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 21:11:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-13 21:11:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-13 21:11:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 983 transitions. [2019-10-13 21:11:44,477 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 983 transitions. Word has length 144 [2019-10-13 21:11:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:44,478 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 983 transitions. [2019-10-13 21:11:44,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 983 transitions. [2019-10-13 21:11:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:44,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:44,484 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:44,484 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 525807612, now seen corresponding path program 1 times [2019-10-13 21:11:44,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:44,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156761445] [2019-10-13 21:11:44,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:44,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156761445] [2019-10-13 21:11:44,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:44,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:44,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245778766] [2019-10-13 21:11:44,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:44,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:44,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:44,645 INFO L87 Difference]: Start difference. First operand 631 states and 983 transitions. Second operand 7 states. [2019-10-13 21:11:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:44,726 INFO L93 Difference]: Finished difference Result 1233 states and 1939 transitions. [2019-10-13 21:11:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:44,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:44,738 INFO L225 Difference]: With dead ends: 1233 [2019-10-13 21:11:44,739 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 21:11:44,742 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:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 21:11:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-13 21:11:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-13 21:11:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 982 transitions. [2019-10-13 21:11:44,772 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 982 transitions. Word has length 144 [2019-10-13 21:11:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:44,773 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 982 transitions. [2019-10-13 21:11:44,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 982 transitions. [2019-10-13 21:11:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:11:44,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:44,779 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:44,779 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1236493407, now seen corresponding path program 1 times [2019-10-13 21:11:44,780 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:44,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701331359] [2019-10-13 21:11:44,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:44,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701331359] [2019-10-13 21:11:44,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:44,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:44,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610679212] [2019-10-13 21:11:44,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:44,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:44,977 INFO L87 Difference]: Start difference. First operand 631 states and 982 transitions. Second operand 5 states. [2019-10-13 21:11:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:45,052 INFO L93 Difference]: Finished difference Result 1232 states and 1936 transitions. [2019-10-13 21:11:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:45,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-13 21:11:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:45,057 INFO L225 Difference]: With dead ends: 1232 [2019-10-13 21:11:45,057 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 21:11:45,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 21:11:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-13 21:11:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-13 21:11:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 981 transitions. [2019-10-13 21:11:45,087 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 981 transitions. Word has length 145 [2019-10-13 21:11:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:45,087 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 981 transitions. [2019-10-13 21:11:45,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 981 transitions. [2019-10-13 21:11:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:11:45,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:45,092 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:45,092 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:45,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1973263729, now seen corresponding path program 1 times [2019-10-13 21:11:45,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:45,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020954793] [2019-10-13 21:11:45,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:45,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020954793] [2019-10-13 21:11:45,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:45,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:45,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111667590] [2019-10-13 21:11:45,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:45,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:45,217 INFO L87 Difference]: Start difference. First operand 631 states and 981 transitions. Second operand 5 states. [2019-10-13 21:11:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:45,285 INFO L93 Difference]: Finished difference Result 1232 states and 1934 transitions. [2019-10-13 21:11:45,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:45,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-13 21:11:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:45,291 INFO L225 Difference]: With dead ends: 1232 [2019-10-13 21:11:45,291 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 21:11:45,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 21:11:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-13 21:11:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-13 21:11:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 980 transitions. [2019-10-13 21:11:45,317 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 980 transitions. Word has length 146 [2019-10-13 21:11:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:45,318 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 980 transitions. [2019-10-13 21:11:45,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 980 transitions. [2019-10-13 21:11:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:11:45,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:45,321 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:45,322 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:45,322 INFO L82 PathProgramCache]: Analyzing trace with hash 696479226, now seen corresponding path program 1 times [2019-10-13 21:11:45,322 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:45,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585176458] [2019-10-13 21:11:45,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:45,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585176458] [2019-10-13 21:11:45,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:45,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:45,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365230918] [2019-10-13 21:11:45,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:45,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:45,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:45,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:45,445 INFO L87 Difference]: Start difference. First operand 631 states and 980 transitions. Second operand 5 states. [2019-10-13 21:11:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:45,526 INFO L93 Difference]: Finished difference Result 1232 states and 1932 transitions. [2019-10-13 21:11:45,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:45,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:11:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:45,533 INFO L225 Difference]: With dead ends: 1232 [2019-10-13 21:11:45,534 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 21:11:45,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 21:11:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-13 21:11:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-13 21:11:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 979 transitions. [2019-10-13 21:11:45,566 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 979 transitions. Word has length 147 [2019-10-13 21:11:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:45,567 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 979 transitions. [2019-10-13 21:11:45,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 979 transitions. [2019-10-13 21:11:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:11:45,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:45,574 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:45,574 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:45,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1424004588, now seen corresponding path program 1 times [2019-10-13 21:11:45,575 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:45,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384233399] [2019-10-13 21:11:45,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:45,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384233399] [2019-10-13 21:11:45,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:45,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:45,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173851873] [2019-10-13 21:11:45,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:45,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:45,762 INFO L87 Difference]: Start difference. First operand 631 states and 979 transitions. Second operand 5 states. [2019-10-13 21:11:45,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:45,863 INFO L93 Difference]: Finished difference Result 1232 states and 1930 transitions. [2019-10-13 21:11:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:45,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:11:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:45,871 INFO L225 Difference]: With dead ends: 1232 [2019-10-13 21:11:45,871 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 21:11:45,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 21:11:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-13 21:11:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-13 21:11:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 978 transitions. [2019-10-13 21:11:45,972 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 978 transitions. Word has length 148 [2019-10-13 21:11:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:45,973 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 978 transitions. [2019-10-13 21:11:45,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 978 transitions. [2019-10-13 21:11:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:11:45,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:45,977 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:45,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:45,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:45,978 INFO L82 PathProgramCache]: Analyzing trace with hash -139373675, now seen corresponding path program 1 times [2019-10-13 21:11:45,978 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:45,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722020468] [2019-10-13 21:11:45,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:45,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:46,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722020468] [2019-10-13 21:11:46,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951574286] [2019-10-13 21:11:46,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:46,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 3069 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:46,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:46,803 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:47,002 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:47,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:47,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77461862] [2019-10-13 21:11:47,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:47,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:47,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:47,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:47,004 INFO L87 Difference]: Start difference. First operand 631 states and 978 transitions. Second operand 3 states. [2019-10-13 21:11:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:47,098 INFO L93 Difference]: Finished difference Result 1772 states and 2794 transitions. [2019-10-13 21:11:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:47,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:11:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:47,110 INFO L225 Difference]: With dead ends: 1772 [2019-10-13 21:11:47,111 INFO L226 Difference]: Without dead ends: 1175 [2019-10-13 21:11:47,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-10-13 21:11:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1162. [2019-10-13 21:11:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2019-10-13 21:11:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1819 transitions. [2019-10-13 21:11:47,183 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1819 transitions. Word has length 149 [2019-10-13 21:11:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:47,187 INFO L462 AbstractCegarLoop]: Abstraction has 1162 states and 1819 transitions. [2019-10-13 21:11:47,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1819 transitions. [2019-10-13 21:11:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:47,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:47,192 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:47,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:47,399 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:47,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1718123778, now seen corresponding path program 1 times [2019-10-13 21:11:47,400 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:47,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416767937] [2019-10-13 21:11:47,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:47,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:47,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:47,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416767937] [2019-10-13 21:11:47,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:47,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:47,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231363000] [2019-10-13 21:11:47,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:47,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:47,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:47,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:47,546 INFO L87 Difference]: Start difference. First operand 1162 states and 1819 transitions. Second operand 7 states. [2019-10-13 21:11:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:50,334 INFO L93 Difference]: Finished difference Result 3412 states and 5478 transitions. [2019-10-13 21:11:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:50,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-13 21:11:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:50,354 INFO L225 Difference]: With dead ends: 3412 [2019-10-13 21:11:50,354 INFO L226 Difference]: Without dead ends: 2284 [2019-10-13 21:11:50,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-10-13 21:11:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2218. [2019-10-13 21:11:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2019-10-13 21:11:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3531 transitions. [2019-10-13 21:11:50,450 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3531 transitions. Word has length 153 [2019-10-13 21:11:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:50,451 INFO L462 AbstractCegarLoop]: Abstraction has 2218 states and 3531 transitions. [2019-10-13 21:11:50,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3531 transitions. [2019-10-13 21:11:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:11:50,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:50,457 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:50,457 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1569287416, now seen corresponding path program 1 times [2019-10-13 21:11:50,458 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:50,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293138538] [2019-10-13 21:11:50,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:50,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:50,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293138538] [2019-10-13 21:11:50,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102202921] [2019-10-13 21:11:50,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:51,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 3070 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:51,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:51,418 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:51,598 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:51,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:51,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387446671] [2019-10-13 21:11:51,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:51,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:51,600 INFO L87 Difference]: Start difference. First operand 2218 states and 3531 transitions. Second operand 3 states. [2019-10-13 21:11:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,739 INFO L93 Difference]: Finished difference Result 5472 states and 8794 transitions. [2019-10-13 21:11:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:51,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:11:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,765 INFO L225 Difference]: With dead ends: 5472 [2019-10-13 21:11:51,766 INFO L226 Difference]: Without dead ends: 3288 [2019-10-13 21:11:51,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2019-10-13 21:11:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3188. [2019-10-13 21:11:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-10-13 21:11:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 5091 transitions. [2019-10-13 21:11:51,941 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 5091 transitions. Word has length 150 [2019-10-13 21:11:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:51,944 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 5091 transitions. [2019-10-13 21:11:51,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 5091 transitions. [2019-10-13 21:11:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:51,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:51,957 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:52,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:52,177 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1268257665, now seen corresponding path program 1 times [2019-10-13 21:11:52,178 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954091688] [2019-10-13 21:11:52,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:52,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954091688] [2019-10-13 21:11:52,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451631119] [2019-10-13 21:11:52,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 3088 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:52,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:53,033 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:53,583 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:53,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-13 21:11:53,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984072469] [2019-10-13 21:11:53,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:53,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:53,585 INFO L87 Difference]: Start difference. First operand 3188 states and 5091 transitions. Second operand 4 states. [2019-10-13 21:11:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:53,760 INFO L93 Difference]: Finished difference Result 6414 states and 10329 transitions. [2019-10-13 21:11:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:53,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:11:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:53,789 INFO L225 Difference]: With dead ends: 6414 [2019-10-13 21:11:53,789 INFO L226 Difference]: Without dead ends: 3260 [2019-10-13 21:11:53,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2019-10-13 21:11:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3210. [2019-10-13 21:11:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3210 states. [2019-10-13 21:11:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 5119 transitions. [2019-10-13 21:11:53,954 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 5119 transitions. Word has length 153 [2019-10-13 21:11:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:53,955 INFO L462 AbstractCegarLoop]: Abstraction has 3210 states and 5119 transitions. [2019-10-13 21:11:53,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 5119 transitions. [2019-10-13 21:11:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:53,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:53,963 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:54,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:54,171 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:54,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:54,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1132378497, now seen corresponding path program 1 times [2019-10-13 21:11:54,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:54,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302644814] [2019-10-13 21:11:54,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:54,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302644814] [2019-10-13 21:11:54,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:54,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:54,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774486459] [2019-10-13 21:11:54,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:54,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:54,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:54,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:54,282 INFO L87 Difference]: Start difference. First operand 3210 states and 5119 transitions. Second operand 4 states. [2019-10-13 21:11:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:54,454 INFO L93 Difference]: Finished difference Result 6380 states and 10251 transitions. [2019-10-13 21:11:54,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:54,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:11:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:54,481 INFO L225 Difference]: With dead ends: 6380 [2019-10-13 21:11:54,481 INFO L226 Difference]: Without dead ends: 3204 [2019-10-13 21:11:54,500 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:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2019-10-13 21:11:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3194. [2019-10-13 21:11:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-10-13 21:11:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 5067 transitions. [2019-10-13 21:11:54,632 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 5067 transitions. Word has length 153 [2019-10-13 21:11:54,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:54,632 INFO L462 AbstractCegarLoop]: Abstraction has 3194 states and 5067 transitions. [2019-10-13 21:11:54,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 5067 transitions. [2019-10-13 21:11:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:54,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:54,640 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:54,640 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash -940798830, now seen corresponding path program 1 times [2019-10-13 21:11:54,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:54,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674014552] [2019-10-13 21:11:54,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:54,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:11:54,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674014552] [2019-10-13 21:11:54,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449928304] [2019-10-13 21:11:54,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:55,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 3089 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:11:55,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:55,559 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:55,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:11:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:55,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:55,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-13 21:11:55,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132877462] [2019-10-13 21:11:55,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:55,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:55,833 INFO L87 Difference]: Start difference. First operand 3194 states and 5067 transitions. Second operand 6 states. [2019-10-13 21:11:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:57,174 INFO L93 Difference]: Finished difference Result 8645 states and 13879 transitions. [2019-10-13 21:11:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:57,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-13 21:11:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:57,211 INFO L225 Difference]: With dead ends: 8645 [2019-10-13 21:11:57,212 INFO L226 Difference]: Without dead ends: 5485 [2019-10-13 21:11:57,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2019-10-13 21:11:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5445. [2019-10-13 21:11:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5445 states. [2019-10-13 21:11:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 8508 transitions. [2019-10-13 21:11:57,432 INFO L78 Accepts]: Start accepts. Automaton has 5445 states and 8508 transitions. Word has length 153 [2019-10-13 21:11:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:57,432 INFO L462 AbstractCegarLoop]: Abstraction has 5445 states and 8508 transitions. [2019-10-13 21:11:57,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5445 states and 8508 transitions. [2019-10-13 21:11:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:11:57,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:57,439 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:57,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:57,651 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash -888969153, now seen corresponding path program 1 times [2019-10-13 21:11:57,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:57,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559564234] [2019-10-13 21:11:57,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:11:57,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559564234] [2019-10-13 21:11:57,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:57,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:57,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087258122] [2019-10-13 21:11:57,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:57,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:57,822 INFO L87 Difference]: Start difference. First operand 5445 states and 8508 transitions. Second operand 7 states. [2019-10-13 21:12:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:00,532 INFO L93 Difference]: Finished difference Result 16236 states and 26000 transitions. [2019-10-13 21:12:00,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:00,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-13 21:12:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:00,641 INFO L225 Difference]: With dead ends: 16236 [2019-10-13 21:12:00,641 INFO L226 Difference]: Without dead ends: 10825 [2019-10-13 21:12:00,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10825 states. [2019-10-13 21:12:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10825 to 10741. [2019-10-13 21:12:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10741 states. [2019-10-13 21:12:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 16957 transitions. [2019-10-13 21:12:01,186 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 16957 transitions. Word has length 161 [2019-10-13 21:12:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:01,187 INFO L462 AbstractCegarLoop]: Abstraction has 10741 states and 16957 transitions. [2019-10-13 21:12:01,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:01,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 16957 transitions. [2019-10-13 21:12:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:12:01,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:01,193 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:01,193 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash 855105821, now seen corresponding path program 1 times [2019-10-13 21:12:01,193 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:01,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396284833] [2019-10-13 21:12:01,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:01,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:01,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:12:01,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396284833] [2019-10-13 21:12:01,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:01,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:01,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398136573] [2019-10-13 21:12:01,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:01,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:01,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:01,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:01,318 INFO L87 Difference]: Start difference. First operand 10741 states and 16957 transitions. Second operand 4 states. [2019-10-13 21:12:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:01,723 INFO L93 Difference]: Finished difference Result 21486 states and 34201 transitions. [2019-10-13 21:12:01,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:01,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-13 21:12:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:01,784 INFO L225 Difference]: With dead ends: 21486 [2019-10-13 21:12:01,785 INFO L226 Difference]: Without dead ends: 10776 [2019-10-13 21:12:01,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10776 states. [2019-10-13 21:12:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10776 to 10744. [2019-10-13 21:12:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-10-13 21:12:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 16921 transitions. [2019-10-13 21:12:02,218 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 16921 transitions. Word has length 162 [2019-10-13 21:12:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:02,218 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 16921 transitions. [2019-10-13 21:12:02,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 16921 transitions. [2019-10-13 21:12:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:12:02,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:02,225 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:02,225 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:02,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:02,226 INFO L82 PathProgramCache]: Analyzing trace with hash 886946433, now seen corresponding path program 1 times [2019-10-13 21:12:02,226 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:02,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790454838] [2019-10-13 21:12:02,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:12:02,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790454838] [2019-10-13 21:12:02,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:02,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:02,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208769620] [2019-10-13 21:12:02,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:02,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:02,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:02,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:02,441 INFO L87 Difference]: Start difference. First operand 10744 states and 16921 transitions. Second operand 7 states. [2019-10-13 21:12:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:05,431 INFO L93 Difference]: Finished difference Result 32211 states and 52120 transitions. [2019-10-13 21:12:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:05,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-10-13 21:12:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:05,582 INFO L225 Difference]: With dead ends: 32211 [2019-10-13 21:12:05,582 INFO L226 Difference]: Without dead ends: 21501 [2019-10-13 21:12:05,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21501 states. [2019-10-13 21:12:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21501 to 21369. [2019-10-13 21:12:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21369 states. [2019-10-13 21:12:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21369 states to 21369 states and 34184 transitions. [2019-10-13 21:12:07,271 INFO L78 Accepts]: Start accepts. Automaton has 21369 states and 34184 transitions. Word has length 171 [2019-10-13 21:12:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:07,274 INFO L462 AbstractCegarLoop]: Abstraction has 21369 states and 34184 transitions. [2019-10-13 21:12:07,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21369 states and 34184 transitions. [2019-10-13 21:12:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-13 21:12:07,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:07,289 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:07,289 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:07,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:07,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1719452071, now seen corresponding path program 1 times [2019-10-13 21:12:07,290 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:07,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043516303] [2019-10-13 21:12:07,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:07,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:07,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-13 21:12:07,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043516303] [2019-10-13 21:12:07,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320871240] [2019-10-13 21:12:07,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:08,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 3562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:12:08,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-13 21:12:08,195 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-13 21:12:08,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:12:08,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 3] total 13 [2019-10-13 21:12:08,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429453924] [2019-10-13 21:12:08,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:08,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:12:08,401 INFO L87 Difference]: Start difference. First operand 21369 states and 34184 transitions. Second operand 3 states.