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_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:30,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:30,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:30,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:30,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:30,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:30,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:30,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:30,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:30,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:30,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:30,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:30,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:30,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:30,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:30,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:30,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:30,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:30,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:30,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:30,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:30,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:30,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:30,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:30,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:30,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:30,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:30,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:30,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:30,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:30,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:30,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:30,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:30,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:30,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:30,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:30,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:30,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:30,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:30,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:30,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:30,900 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:30,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:30,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:30,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:30,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:30,922 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:30,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:30,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:30,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:30,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:30,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:30,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:30,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:30,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:30,925 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:30,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:30,925 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:30,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:30,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:30,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:30,926 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:30,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:30,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:30,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:30,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:30,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:30,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:30,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:30,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:30,928 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:31,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:31,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:31,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:31,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:31,234 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:31,235 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c [2019-10-13 21:11:31,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeaab115b/ae658e810b9c49bd9069efaa1d447193/FLAGa16ca6540 [2019-10-13 21:11:31,976 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:31,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c [2019-10-13 21:11:31,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeaab115b/ae658e810b9c49bd9069efaa1d447193/FLAGa16ca6540 [2019-10-13 21:11:32,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeaab115b/ae658e810b9c49bd9069efaa1d447193 [2019-10-13 21:11:32,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:32,183 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:32,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:32,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:32,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:32,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:32" (1/1) ... [2019-10-13 21:11:32,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b1ab601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:32, skipping insertion in model container [2019-10-13 21:11:32,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:32" (1/1) ... [2019-10-13 21:11:32,200 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:32,277 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:33,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:33,063 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:33,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:33,271 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:33,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:33 WrapperNode [2019-10-13 21:11:33,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:33,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:33,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:33,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:33,290 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:33" (1/1) ... [2019-10-13 21:11:33,290 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:33" (1/1) ... [2019-10-13 21:11:33,324 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:33" (1/1) ... [2019-10-13 21:11:33,324 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:33" (1/1) ... [2019-10-13 21:11:33,390 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:33" (1/1) ... [2019-10-13 21:11:33,443 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:33" (1/1) ... [2019-10-13 21:11:33,462 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:33" (1/1) ... [2019-10-13 21:11:33,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:33,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:33,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:33,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:33,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:33" (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:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:33,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:33,567 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:33,567 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:33,567 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:33,567 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:33,568 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:33,568 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:33,568 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:33,569 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:33,569 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:33,569 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:33,569 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:33,569 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:33,569 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:33,570 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:33,570 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:33,570 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:33,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:33,570 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:33,571 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:11:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:33,572 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:11:33,573 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:11:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:33,574 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:11:33,575 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:11:33,576 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:33,576 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:33,576 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:33,576 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:33,582 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:33,583 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:33,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:33,584 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:33,584 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:33,584 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:33,584 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:33,585 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:33,587 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:33,589 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:33,590 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:33,591 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:33,592 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:33,593 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:33,594 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:33,597 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:33,598 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:33,598 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:33,598 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:33,599 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:11:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:11:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:11:33,606 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:33,607 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:33,607 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:33,607 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:11:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:11:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:33,608 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:33,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:36,185 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:36,185 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:36,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:36 BoogieIcfgContainer [2019-10-13 21:11:36,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:36,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:36,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:36,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:36,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:32" (1/3) ... [2019-10-13 21:11:36,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b94aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:36, skipping insertion in model container [2019-10-13 21:11:36,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:33" (2/3) ... [2019-10-13 21:11:36,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b94aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:36, skipping insertion in model container [2019-10-13 21:11:36,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:36" (3/3) ... [2019-10-13 21:11:36,199 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product11.cil.c [2019-10-13 21:11:36,210 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:36,221 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:36,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:36,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:36,286 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:36,286 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:36,286 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:36,286 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:36,287 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:36,287 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:36,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states. [2019-10-13 21:11:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:11:36,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:36,390 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:36,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1989495119, now seen corresponding path program 1 times [2019-10-13 21:11:36,415 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:36,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020538044] [2019-10-13 21:11:36,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:36,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:36,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:37,249 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:37,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020538044] [2019-10-13 21:11:37,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:37,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:37,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780483276] [2019-10-13 21:11:37,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:37,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:37,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:37,279 INFO L87 Difference]: Start difference. First operand 785 states. Second operand 7 states. [2019-10-13 21:11:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:37,623 INFO L93 Difference]: Finished difference Result 1249 states and 2024 transitions. [2019-10-13 21:11:37,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:37,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-13 21:11:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:37,671 INFO L225 Difference]: With dead ends: 1249 [2019-10-13 21:11:37,671 INFO L226 Difference]: Without dead ends: 633 [2019-10-13 21:11:37,682 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:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-13 21:11:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2019-10-13 21:11:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-13 21:11:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1007 transitions. [2019-10-13 21:11:37,814 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1007 transitions. Word has length 141 [2019-10-13 21:11:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:37,815 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1007 transitions. [2019-10-13 21:11:37,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1007 transitions. [2019-10-13 21:11:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:37,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:37,823 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:37,823 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:37,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1567093572, now seen corresponding path program 1 times [2019-10-13 21:11:37,824 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:37,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068152962] [2019-10-13 21:11:37,824 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,824 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,104 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:38,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068152962] [2019-10-13 21:11:38,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:38,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107706505] [2019-10-13 21:11:38,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:38,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:38,109 INFO L87 Difference]: Start difference. First operand 631 states and 1007 transitions. Second operand 4 states. [2019-10-13 21:11:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:38,185 INFO L93 Difference]: Finished difference Result 1228 states and 1979 transitions. [2019-10-13 21:11:38,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:38,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-13 21:11:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:38,245 INFO L225 Difference]: With dead ends: 1228 [2019-10-13 21:11:38,245 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:11:38,249 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:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:11:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:11:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:11:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 974 transitions. [2019-10-13 21:11:38,299 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 974 transitions. Word has length 142 [2019-10-13 21:11:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:38,299 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 974 transitions. [2019-10-13 21:11:38,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 974 transitions. [2019-10-13 21:11:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:38,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:38,305 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:38,305 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash 972664476, now seen corresponding path program 1 times [2019-10-13 21:11:38,306 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:38,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103612713] [2019-10-13 21:11:38,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,595 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:38,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103612713] [2019-10-13 21:11:38,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:38,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310863618] [2019-10-13 21:11:38,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:38,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:38,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:38,599 INFO L87 Difference]: Start difference. First operand 613 states and 974 transitions. Second operand 7 states. [2019-10-13 21:11:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:38,712 INFO L93 Difference]: Finished difference Result 1197 states and 1921 transitions. [2019-10-13 21:11:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:38,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-13 21:11:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:38,720 INFO L225 Difference]: With dead ends: 1197 [2019-10-13 21:11:38,721 INFO L226 Difference]: Without dead ends: 607 [2019-10-13 21:11:38,724 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:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-13 21:11:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-13 21:11:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:11:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 961 transitions. [2019-10-13 21:11:38,760 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 961 transitions. Word has length 142 [2019-10-13 21:11:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:38,761 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 961 transitions. [2019-10-13 21:11:38,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 961 transitions. [2019-10-13 21:11:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:11:38,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:38,766 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:38,767 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash 894552595, now seen corresponding path program 1 times [2019-10-13 21:11:38,767 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:38,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863602871] [2019-10-13 21:11:38,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,948 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:38,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863602871] [2019-10-13 21:11:38,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:38,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930198980] [2019-10-13 21:11:38,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:38,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:38,952 INFO L87 Difference]: Start difference. First operand 607 states and 961 transitions. Second operand 7 states. [2019-10-13 21:11:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,061 INFO L93 Difference]: Finished difference Result 1185 states and 1895 transitions. [2019-10-13 21:11:39,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:39,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:11:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,068 INFO L225 Difference]: With dead ends: 1185 [2019-10-13 21:11:39,068 INFO L226 Difference]: Without dead ends: 601 [2019-10-13 21:11:39,073 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:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-13 21:11:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-13 21:11:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-13 21:11:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 948 transitions. [2019-10-13 21:11:39,108 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 948 transitions. Word has length 143 [2019-10-13 21:11:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,108 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 948 transitions. [2019-10-13 21:11:39,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 948 transitions. [2019-10-13 21:11:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:39,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,113 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:39,114 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash -148048736, now seen corresponding path program 1 times [2019-10-13 21:11:39,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856355168] [2019-10-13 21:11:39,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,401 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:39,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856355168] [2019-10-13 21:11:39,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:39,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045583233] [2019-10-13 21:11:39,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:39,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:39,405 INFO L87 Difference]: Start difference. First operand 601 states and 948 transitions. Second operand 7 states. [2019-10-13 21:11:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,501 INFO L93 Difference]: Finished difference Result 1173 states and 1869 transitions. [2019-10-13 21:11:39,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:39,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,508 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:11:39,509 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:11:39,512 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:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:11:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:11:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:11:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 935 transitions. [2019-10-13 21:11:39,537 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 935 transitions. Word has length 144 [2019-10-13 21:11:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,538 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 935 transitions. [2019-10-13 21:11:39,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 935 transitions. [2019-10-13 21:11:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:39,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,542 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:39,542 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1386995551, now seen corresponding path program 1 times [2019-10-13 21:11:39,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15615439] [2019-10-13 21:11:39,543 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:39,696 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:39,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15615439] [2019-10-13 21:11:39,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:39,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:39,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271029056] [2019-10-13 21:11:39,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:39,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:39,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:39,699 INFO L87 Difference]: Start difference. First operand 595 states and 935 transitions. Second operand 7 states. [2019-10-13 21:11:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:39,786 INFO L93 Difference]: Finished difference Result 1161 states and 1843 transitions. [2019-10-13 21:11:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:39,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:39,794 INFO L225 Difference]: With dead ends: 1161 [2019-10-13 21:11:39,794 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:11:39,798 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:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:11:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:11:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:11:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 934 transitions. [2019-10-13 21:11:39,826 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 934 transitions. Word has length 144 [2019-10-13 21:11:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:39,827 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 934 transitions. [2019-10-13 21:11:39,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 934 transitions. [2019-10-13 21:11:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:11:39,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:39,832 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:39,833 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:39,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1025051945, now seen corresponding path program 1 times [2019-10-13 21:11:39,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:39,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762356991] [2019-10-13 21:11:39,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:39,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,057 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:40,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762356991] [2019-10-13 21:11:40,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:40,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951366700] [2019-10-13 21:11:40,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:40,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,060 INFO L87 Difference]: Start difference. First operand 595 states and 934 transitions. Second operand 5 states. [2019-10-13 21:11:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,138 INFO L93 Difference]: Finished difference Result 1160 states and 1840 transitions. [2019-10-13 21:11:40,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-13 21:11:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,144 INFO L225 Difference]: With dead ends: 1160 [2019-10-13 21:11:40,145 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:11:40,148 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:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:11:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:11:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:11:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 933 transitions. [2019-10-13 21:11:40,174 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 933 transitions. Word has length 145 [2019-10-13 21:11:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,175 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 933 transitions. [2019-10-13 21:11:40,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 933 transitions. [2019-10-13 21:11:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:11:40,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,180 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:40,180 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,181 INFO L82 PathProgramCache]: Analyzing trace with hash 977022328, now seen corresponding path program 1 times [2019-10-13 21:11:40,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351739567] [2019-10-13 21:11:40,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,324 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:40,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351739567] [2019-10-13 21:11:40,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:40,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718446384] [2019-10-13 21:11:40,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:40,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:40,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,327 INFO L87 Difference]: Start difference. First operand 595 states and 933 transitions. Second operand 5 states. [2019-10-13 21:11:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,407 INFO L93 Difference]: Finished difference Result 1160 states and 1838 transitions. [2019-10-13 21:11:40,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-13 21:11:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,413 INFO L225 Difference]: With dead ends: 1160 [2019-10-13 21:11:40,413 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:11:40,417 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:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:11:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:11:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:11:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 932 transitions. [2019-10-13 21:11:40,442 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 932 transitions. Word has length 146 [2019-10-13 21:11:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,442 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 932 transitions. [2019-10-13 21:11:40,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 932 transitions. [2019-10-13 21:11:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:11:40,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,447 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:40,447 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash 269954642, now seen corresponding path program 1 times [2019-10-13 21:11:40,448 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778273278] [2019-10-13 21:11:40,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:40,603 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:40,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778273278] [2019-10-13 21:11:40,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:40,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:40,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157857780] [2019-10-13 21:11:40,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:40,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:40,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:40,608 INFO L87 Difference]: Start difference. First operand 595 states and 932 transitions. Second operand 5 states. [2019-10-13 21:11:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:40,691 INFO L93 Difference]: Finished difference Result 1160 states and 1836 transitions. [2019-10-13 21:11:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:40,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:11:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:40,701 INFO L225 Difference]: With dead ends: 1160 [2019-10-13 21:11:40,702 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:11:40,707 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:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:11:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:11:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:11:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 931 transitions. [2019-10-13 21:11:40,745 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 931 transitions. Word has length 147 [2019-10-13 21:11:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:40,746 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 931 transitions. [2019-10-13 21:11:40,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 931 transitions. [2019-10-13 21:11:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:11:40,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:40,753 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:40,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1478832147, now seen corresponding path program 1 times [2019-10-13 21:11:40,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:40,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570500404] [2019-10-13 21:11:40,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:40,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,050 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:41,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570500404] [2019-10-13 21:11:41,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:41,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:41,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776015843] [2019-10-13 21:11:41,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:41,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:41,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:41,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:41,056 INFO L87 Difference]: Start difference. First operand 595 states and 931 transitions. Second operand 5 states. [2019-10-13 21:11:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:41,170 INFO L93 Difference]: Finished difference Result 1160 states and 1834 transitions. [2019-10-13 21:11:41,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:41,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:11:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:41,179 INFO L225 Difference]: With dead ends: 1160 [2019-10-13 21:11:41,179 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:11:41,195 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:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:11:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:11:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:11:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 930 transitions. [2019-10-13 21:11:41,232 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 930 transitions. Word has length 148 [2019-10-13 21:11:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:41,232 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 930 transitions. [2019-10-13 21:11:41,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 930 transitions. [2019-10-13 21:11:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:11:41,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:41,241 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:41,241 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:41,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1952468429, now seen corresponding path program 1 times [2019-10-13 21:11:41,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:41,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312400930] [2019-10-13 21:11:41,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:41,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:41,626 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:41,626 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312400930] [2019-10-13 21:11:41,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965616252] [2019-10-13 21:11:41,627 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:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:42,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:42,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:42,694 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:42,695 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:42,886 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,887 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:42,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:42,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878351950] [2019-10-13 21:11:42,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:42,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:42,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:42,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:42,889 INFO L87 Difference]: Start difference. First operand 595 states and 930 transitions. Second operand 3 states. [2019-10-13 21:11:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:42,979 INFO L93 Difference]: Finished difference Result 1664 states and 2650 transitions. [2019-10-13 21:11:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:42,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:11:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:42,990 INFO L225 Difference]: With dead ends: 1664 [2019-10-13 21:11:42,990 INFO L226 Difference]: Without dead ends: 1103 [2019-10-13 21:11:42,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-10-13 21:11:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1090. [2019-10-13 21:11:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2019-10-13 21:11:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1723 transitions. [2019-10-13 21:11:43,045 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1723 transitions. Word has length 149 [2019-10-13 21:11:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:43,046 INFO L462 AbstractCegarLoop]: Abstraction has 1090 states and 1723 transitions. [2019-10-13 21:11:43,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1723 transitions. [2019-10-13 21:11:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:11:43,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:43,053 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:43,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:43,270 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash 740178387, now seen corresponding path program 1 times [2019-10-13 21:11:43,271 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:43,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093491743] [2019-10-13 21:11:43,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:43,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:43,512 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:43,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093491743] [2019-10-13 21:11:43,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666115399] [2019-10-13 21:11:43,513 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:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:44,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 3038 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:44,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:44,392 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:44,392 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:44,524 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,525 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:44,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:44,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516565848] [2019-10-13 21:11:44,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:44,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:44,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:44,527 INFO L87 Difference]: Start difference. First operand 1090 states and 1723 transitions. Second operand 3 states. [2019-10-13 21:11:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:44,632 INFO L93 Difference]: Finished difference Result 2654 states and 4238 transitions. [2019-10-13 21:11:44,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:44,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:11:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:44,646 INFO L225 Difference]: With dead ends: 2654 [2019-10-13 21:11:44,646 INFO L226 Difference]: Without dead ends: 1598 [2019-10-13 21:11:44,653 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:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2019-10-13 21:11:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1549. [2019-10-13 21:11:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2019-10-13 21:11:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2469 transitions. [2019-10-13 21:11:44,724 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2469 transitions. Word has length 150 [2019-10-13 21:11:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:44,725 INFO L462 AbstractCegarLoop]: Abstraction has 1549 states and 2469 transitions. [2019-10-13 21:11:44,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2469 transitions. [2019-10-13 21:11:44,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:11:44,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:44,733 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] [2019-10-13 21:11:44,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:44,942 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:44,943 INFO L82 PathProgramCache]: Analyzing trace with hash -407258545, now seen corresponding path program 1 times [2019-10-13 21:11:44,943 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:44,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143235108] [2019-10-13 21:11:44,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,944 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:44,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:45,175 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,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143235108] [2019-10-13 21:11:45,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:45,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:45,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451020107] [2019-10-13 21:11:45,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:45,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:45,179 INFO L87 Difference]: Start difference. First operand 1549 states and 2469 transitions. Second operand 7 states. [2019-10-13 21:11:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:48,089 INFO L93 Difference]: Finished difference Result 4569 states and 7452 transitions. [2019-10-13 21:11:48,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:48,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-10-13 21:11:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:48,116 INFO L225 Difference]: With dead ends: 4569 [2019-10-13 21:11:48,116 INFO L226 Difference]: Without dead ends: 3054 [2019-10-13 21:11:48,127 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:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2019-10-13 21:11:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2984. [2019-10-13 21:11:48,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-10-13 21:11:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4849 transitions. [2019-10-13 21:11:48,280 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4849 transitions. Word has length 152 [2019-10-13 21:11:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:48,282 INFO L462 AbstractCegarLoop]: Abstraction has 2984 states and 4849 transitions. [2019-10-13 21:11:48,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4849 transitions. [2019-10-13 21:11:48,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:48,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:48,291 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:48,291 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:48,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1134682887, now seen corresponding path program 1 times [2019-10-13 21:11:48,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:48,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82141981] [2019-10-13 21:11:48,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:48,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:48,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:48,425 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:48,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82141981] [2019-10-13 21:11:48,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:48,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:48,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801623213] [2019-10-13 21:11:48,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:48,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:48,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:48,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:48,430 INFO L87 Difference]: Start difference. First operand 2984 states and 4849 transitions. Second operand 4 states. [2019-10-13 21:11:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:48,617 INFO L93 Difference]: Finished difference Result 5944 states and 9737 transitions. [2019-10-13 21:11:48,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:48,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:11:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:48,644 INFO L225 Difference]: With dead ends: 5944 [2019-10-13 21:11:48,644 INFO L226 Difference]: Without dead ends: 2994 [2019-10-13 21:11:48,662 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:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-10-13 21:11:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2984. [2019-10-13 21:11:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-10-13 21:11:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4827 transitions. [2019-10-13 21:11:48,829 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4827 transitions. Word has length 153 [2019-10-13 21:11:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:48,829 INFO L462 AbstractCegarLoop]: Abstraction has 2984 states and 4827 transitions. [2019-10-13 21:11:48,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4827 transitions. [2019-10-13 21:11:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:48,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:48,838 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:48,839 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:48,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:48,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1380411173, now seen corresponding path program 1 times [2019-10-13 21:11:48,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:48,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167038719] [2019-10-13 21:11:48,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:48,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:48,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:49,140 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:49,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167038719] [2019-10-13 21:11:49,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109739321] [2019-10-13 21:11:49,142 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:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:49,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:11:49,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:49,826 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:49,826 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:49,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:11:50,132 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,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:50,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-13 21:11:50,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176995530] [2019-10-13 21:11:50,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:50,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:50,134 INFO L87 Difference]: Start difference. First operand 2984 states and 4827 transitions. Second operand 6 states. [2019-10-13 21:11:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:51,655 INFO L93 Difference]: Finished difference Result 8051 states and 13138 transitions. [2019-10-13 21:11:51,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:51,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-13 21:11:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:51,696 INFO L225 Difference]: With dead ends: 8051 [2019-10-13 21:11:51,697 INFO L226 Difference]: Without dead ends: 5101 [2019-10-13 21:11:51,716 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:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2019-10-13 21:11:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5061. [2019-10-13 21:11:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5061 states. [2019-10-13 21:11:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5061 states to 5061 states and 8038 transitions. [2019-10-13 21:11:51,931 INFO L78 Accepts]: Start accepts. Automaton has 5061 states and 8038 transitions. Word has length 153 [2019-10-13 21:11:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:51,931 INFO L462 AbstractCegarLoop]: Abstraction has 5061 states and 8038 transitions. [2019-10-13 21:11:51,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5061 states and 8038 transitions. [2019-10-13 21:11:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:11:51,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:51,938 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:52,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:52,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:52,145 INFO L82 PathProgramCache]: Analyzing trace with hash -429643700, now seen corresponding path program 1 times [2019-10-13 21:11:52,145 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:52,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111999415] [2019-10-13 21:11:52,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:52,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:52,376 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:52,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111999415] [2019-10-13 21:11:52,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:52,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:52,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508245295] [2019-10-13 21:11:52,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:52,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:52,379 INFO L87 Difference]: Start difference. First operand 5061 states and 8038 transitions. Second operand 7 states. [2019-10-13 21:11:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:55,514 INFO L93 Difference]: Finished difference Result 15136 states and 24618 transitions. [2019-10-13 21:11:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:55,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-13 21:11:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:55,591 INFO L225 Difference]: With dead ends: 15136 [2019-10-13 21:11:55,591 INFO L226 Difference]: Without dead ends: 10109 [2019-10-13 21:11:55,615 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:11:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10109 states. [2019-10-13 21:11:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10109 to 9999. [2019-10-13 21:11:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9999 states. [2019-10-13 21:11:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9999 states to 9999 states and 16130 transitions. [2019-10-13 21:11:56,089 INFO L78 Accepts]: Start accepts. Automaton has 9999 states and 16130 transitions. Word has length 161 [2019-10-13 21:11:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:56,090 INFO L462 AbstractCegarLoop]: Abstraction has 9999 states and 16130 transitions. [2019-10-13 21:11:56,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9999 states and 16130 transitions. [2019-10-13 21:11:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:11:56,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:56,098 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:11:56,098 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash 664284072, now seen corresponding path program 1 times [2019-10-13 21:11:56,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:56,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992496494] [2019-10-13 21:11:56,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:56,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:56,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:56,238 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:11:56,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992496494] [2019-10-13 21:11:56,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:56,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:56,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129715637] [2019-10-13 21:11:56,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:56,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:56,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:56,240 INFO L87 Difference]: Start difference. First operand 9999 states and 16130 transitions. Second operand 4 states. [2019-10-13 21:11:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:56,627 INFO L93 Difference]: Finished difference Result 20008 states and 32580 transitions. [2019-10-13 21:11:56,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:56,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-13 21:11:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:56,721 INFO L225 Difference]: With dead ends: 20008 [2019-10-13 21:11:56,721 INFO L226 Difference]: Without dead ends: 10040 [2019-10-13 21:11:56,779 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:11:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10040 states. [2019-10-13 21:11:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10040 to 10006. [2019-10-13 21:11:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10006 states. [2019-10-13 21:11:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 16089 transitions. [2019-10-13 21:11:57,925 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 16089 transitions. Word has length 162 [2019-10-13 21:11:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:57,926 INFO L462 AbstractCegarLoop]: Abstraction has 10006 states and 16089 transitions. [2019-10-13 21:11:57,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 16089 transitions. [2019-10-13 21:11:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:11:57,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:57,934 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:11:57,935 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:57,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:57,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1279550297, now seen corresponding path program 1 times [2019-10-13 21:11:57,935 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:57,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280768948] [2019-10-13 21:11:57,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:57,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:58,078 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:11:58,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280768948] [2019-10-13 21:11:58,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:58,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:58,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537062786] [2019-10-13 21:11:58,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:58,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:58,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:58,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:58,080 INFO L87 Difference]: Start difference. First operand 10006 states and 16089 transitions. Second operand 7 states. [2019-10-13 21:12:00,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:00,963 INFO L93 Difference]: Finished difference Result 30063 states and 49757 transitions. [2019-10-13 21:12:00,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:00,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-10-13 21:12:00,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:01,121 INFO L225 Difference]: With dead ends: 30063 [2019-10-13 21:12:01,121 INFO L226 Difference]: Without dead ends: 20091 [2019-10-13 21:12:01,161 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:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20091 states. [2019-10-13 21:12:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20091 to 19929. [2019-10-13 21:12:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19929 states. [2019-10-13 21:12:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19929 states to 19929 states and 32776 transitions. [2019-10-13 21:12:01,988 INFO L78 Accepts]: Start accepts. Automaton has 19929 states and 32776 transitions. Word has length 171 [2019-10-13 21:12:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:01,989 INFO L462 AbstractCegarLoop]: Abstraction has 19929 states and 32776 transitions. [2019-10-13 21:12:01,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 19929 states and 32776 transitions. [2019-10-13 21:12:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 21:12:02,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:02,002 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, 1] [2019-10-13 21:12:02,002 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash 566425219, now seen corresponding path program 1 times [2019-10-13 21:12:02,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:02,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170000782] [2019-10-13 21:12:02,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:02,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:12:02,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170000782] [2019-10-13 21:12:02,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:02,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:02,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867743029] [2019-10-13 21:12:02,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:02,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:02,151 INFO L87 Difference]: Start difference. First operand 19929 states and 32776 transitions. Second operand 4 states. [2019-10-13 21:12:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:03,013 INFO L93 Difference]: Finished difference Result 39918 states and 66492 transitions. [2019-10-13 21:12:03,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:12:03,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-13 21:12:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted.