java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:13,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:13,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:13,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:13,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:13,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:13,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:13,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:13,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:13,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:13,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:13,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:13,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:13,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:13,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:13,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:13,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:13,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:13,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:13,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:13,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:13,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:13,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:13,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:13,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:13,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:13,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:13,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:13,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:13,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:13,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:13,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:13,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:13,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:13,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:13,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:13,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:13,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:13,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:13,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:13,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:13,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:09:13,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:13,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:13,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:13,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:13,239 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:13,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:13,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:13,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:13,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:13,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:13,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:13,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:13,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:13,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:13,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:13,241 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:13,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:13,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:13,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:13,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:13,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:13,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:13,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:13,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:13,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:13,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:13,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:13,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:13,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:09:13,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:13,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:13,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:13,547 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:13,548 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:13,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product31.cil.c [2019-10-13 21:09:13,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b69e0d1f/d8f0d618bcc346958335f12ef73cc84c/FLAGa69c6993f [2019-10-13 21:09:14,263 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:14,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product31.cil.c [2019-10-13 21:09:14,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b69e0d1f/d8f0d618bcc346958335f12ef73cc84c/FLAGa69c6993f [2019-10-13 21:09:14,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b69e0d1f/d8f0d618bcc346958335f12ef73cc84c [2019-10-13 21:09:14,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:14,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:14,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:14,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:14,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:14,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:14" (1/1) ... [2019-10-13 21:09:14,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9fb768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:14, skipping insertion in model container [2019-10-13 21:09:14,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:14" (1/1) ... [2019-10-13 21:09:14,458 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:14,565 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:15,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:15,345 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:15,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:15,568 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:15,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15 WrapperNode [2019-10-13 21:09:15,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:15,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:15,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:15,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:15,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... [2019-10-13 21:09:15,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... [2019-10-13 21:09:15,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... [2019-10-13 21:09:15,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... [2019-10-13 21:09:15,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... [2019-10-13 21:09:15,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... [2019-10-13 21:09:15,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... [2019-10-13 21:09:15,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:15,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:15,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:15,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:15,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:15,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:15,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:15,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:15,837 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:15,838 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:15,838 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:15,838 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:15,838 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:15,838 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:15,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:15,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:15,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:15,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:15,841 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:15,841 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:15,841 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:15,841 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:15,842 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:15,842 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:15,842 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:15,842 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:09:15,843 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:15,844 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:09:15,844 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:09:15,844 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:15,844 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:15,844 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:15,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:15,845 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:15,845 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:15,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:15,845 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:09:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:09:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:15,850 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:09:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:09:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:09:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:09:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:09:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:18,434 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:18,435 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:18,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:18 BoogieIcfgContainer [2019-10-13 21:09:18,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:18,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:18,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:18,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:18,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:09:14" (1/3) ... [2019-10-13 21:09:18,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050d891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:18, skipping insertion in model container [2019-10-13 21:09:18,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:15" (2/3) ... [2019-10-13 21:09:18,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6050d891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:18, skipping insertion in model container [2019-10-13 21:09:18,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:18" (3/3) ... [2019-10-13 21:09:18,445 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product31.cil.c [2019-10-13 21:09:18,455 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:18,466 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:18,478 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:18,513 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:18,514 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:18,514 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:18,514 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:18,514 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:18,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:18,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:18,515 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states. [2019-10-13 21:09:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:09:18,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:18,577 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:18,579 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash 716807199, now seen corresponding path program 1 times [2019-10-13 21:09:18,596 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:18,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921334556] [2019-10-13 21:09:18,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:19,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921334556] [2019-10-13 21:09:19,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:19,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:19,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46428325] [2019-10-13 21:09:19,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:19,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:19,291 INFO L87 Difference]: Start difference. First operand 782 states. Second operand 4 states. [2019-10-13 21:09:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:19,503 INFO L93 Difference]: Finished difference Result 1262 states and 2006 transitions. [2019-10-13 21:09:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:19,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-13 21:09:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:19,544 INFO L225 Difference]: With dead ends: 1262 [2019-10-13 21:09:19,545 INFO L226 Difference]: Without dead ends: 634 [2019-10-13 21:09:19,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-13 21:09:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-13 21:09:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-13 21:09:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 994 transitions. [2019-10-13 21:09:19,696 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 994 transitions. Word has length 135 [2019-10-13 21:09:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:19,696 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 994 transitions. [2019-10-13 21:09:19,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 994 transitions. [2019-10-13 21:09:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:09:19,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:19,707 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:19,707 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash -936222646, now seen corresponding path program 1 times [2019-10-13 21:09:19,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:19,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163743618] [2019-10-13 21:09:19,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:19,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:19,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:19,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163743618] [2019-10-13 21:09:19,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:19,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:19,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206416571] [2019-10-13 21:09:19,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:19,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:19,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:19,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:19,969 INFO L87 Difference]: Start difference. First operand 634 states and 994 transitions. Second operand 4 states. [2019-10-13 21:09:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,097 INFO L93 Difference]: Finished difference Result 1235 states and 1949 transitions. [2019-10-13 21:09:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:20,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:09:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,104 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:09:20,104 INFO L226 Difference]: Without dead ends: 634 [2019-10-13 21:09:20,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-13 21:09:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-13 21:09:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-13 21:09:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 993 transitions. [2019-10-13 21:09:20,149 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 993 transitions. Word has length 136 [2019-10-13 21:09:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,149 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 993 transitions. [2019-10-13 21:09:20,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 993 transitions. [2019-10-13 21:09:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:09:20,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,155 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:20,155 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash -291903749, now seen corresponding path program 1 times [2019-10-13 21:09:20,156 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772793778] [2019-10-13 21:09:20,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:20,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772793778] [2019-10-13 21:09:20,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:20,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:20,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622679131] [2019-10-13 21:09:20,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:20,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:20,341 INFO L87 Difference]: Start difference. First operand 634 states and 993 transitions. Second operand 4 states. [2019-10-13 21:09:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,410 INFO L93 Difference]: Finished difference Result 1235 states and 1948 transitions. [2019-10-13 21:09:20,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:20,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:09:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,416 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:09:20,416 INFO L226 Difference]: Without dead ends: 634 [2019-10-13 21:09:20,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-13 21:09:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-13 21:09:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-13 21:09:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 992 transitions. [2019-10-13 21:09:20,449 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 992 transitions. Word has length 137 [2019-10-13 21:09:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,450 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 992 transitions. [2019-10-13 21:09:20,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 992 transitions. [2019-10-13 21:09:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:09:20,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,455 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:20,455 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1444217882, now seen corresponding path program 1 times [2019-10-13 21:09:20,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702490445] [2019-10-13 21:09:20,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:20,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702490445] [2019-10-13 21:09:20,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:20,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:20,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237923073] [2019-10-13 21:09:20,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:20,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:20,616 INFO L87 Difference]: Start difference. First operand 634 states and 992 transitions. Second operand 4 states. [2019-10-13 21:09:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,697 INFO L93 Difference]: Finished difference Result 1235 states and 1947 transitions. [2019-10-13 21:09:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:20,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:09:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,708 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:09:20,708 INFO L226 Difference]: Without dead ends: 634 [2019-10-13 21:09:20,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-13 21:09:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-13 21:09:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-13 21:09:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 991 transitions. [2019-10-13 21:09:20,752 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 991 transitions. Word has length 138 [2019-10-13 21:09:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,753 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 991 transitions. [2019-10-13 21:09:20,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 991 transitions. [2019-10-13 21:09:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:09:20,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,759 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:20,760 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1837386199, now seen corresponding path program 1 times [2019-10-13 21:09:20,760 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531369381] [2019-10-13 21:09:20,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:20,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531369381] [2019-10-13 21:09:20,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:20,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:20,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76407148] [2019-10-13 21:09:20,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:20,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:20,961 INFO L87 Difference]: Start difference. First operand 634 states and 991 transitions. Second operand 4 states. [2019-10-13 21:09:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:21,036 INFO L93 Difference]: Finished difference Result 1235 states and 1946 transitions. [2019-10-13 21:09:21,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:21,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:09:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:21,052 INFO L225 Difference]: With dead ends: 1235 [2019-10-13 21:09:21,052 INFO L226 Difference]: Without dead ends: 634 [2019-10-13 21:09:21,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-13 21:09:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-13 21:09:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-13 21:09:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 990 transitions. [2019-10-13 21:09:21,094 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 990 transitions. Word has length 139 [2019-10-13 21:09:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:21,095 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 990 transitions. [2019-10-13 21:09:21,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 990 transitions. [2019-10-13 21:09:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:21,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:21,107 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:21,107 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash 836534146, now seen corresponding path program 1 times [2019-10-13 21:09:21,108 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:21,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589522073] [2019-10-13 21:09:21,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:21,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589522073] [2019-10-13 21:09:21,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:21,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:09:21,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909510026] [2019-10-13 21:09:21,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:09:21,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:09:21,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:09:21,319 INFO L87 Difference]: Start difference. First operand 634 states and 990 transitions. Second operand 10 states. [2019-10-13 21:09:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:21,516 INFO L93 Difference]: Finished difference Result 1240 states and 1953 transitions. [2019-10-13 21:09:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:21,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:09:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:21,527 INFO L225 Difference]: With dead ends: 1240 [2019-10-13 21:09:21,528 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:09:21,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:09:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2019-10-13 21:09:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-13 21:09:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1000 transitions. [2019-10-13 21:09:21,565 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1000 transitions. Word has length 140 [2019-10-13 21:09:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:21,565 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1000 transitions. [2019-10-13 21:09:21,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:09:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1000 transitions. [2019-10-13 21:09:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:21,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:21,570 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:21,570 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:21,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash -150048543, now seen corresponding path program 1 times [2019-10-13 21:09:21,572 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:21,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911138581] [2019-10-13 21:09:21,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:21,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911138581] [2019-10-13 21:09:21,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:21,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:21,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683681176] [2019-10-13 21:09:21,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:21,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:21,765 INFO L87 Difference]: Start difference. First operand 641 states and 1000 transitions. Second operand 4 states. [2019-10-13 21:09:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:21,830 INFO L93 Difference]: Finished difference Result 1241 states and 1954 transitions. [2019-10-13 21:09:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:21,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:09:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:21,837 INFO L225 Difference]: With dead ends: 1241 [2019-10-13 21:09:21,838 INFO L226 Difference]: Without dead ends: 637 [2019-10-13 21:09:21,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-13 21:09:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-13 21:09:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-13 21:09:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 993 transitions. [2019-10-13 21:09:21,869 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 993 transitions. Word has length 140 [2019-10-13 21:09:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:21,869 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 993 transitions. [2019-10-13 21:09:21,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 993 transitions. [2019-10-13 21:09:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:09:21,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:21,875 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:21,875 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:21,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1527718111, now seen corresponding path program 1 times [2019-10-13 21:09:21,876 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:21,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136159327] [2019-10-13 21:09:21,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:21,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:22,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136159327] [2019-10-13 21:09:22,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:22,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:22,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84349056] [2019-10-13 21:09:22,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:22,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:22,128 INFO L87 Difference]: Start difference. First operand 637 states and 993 transitions. Second operand 6 states. [2019-10-13 21:09:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,454 INFO L93 Difference]: Finished difference Result 1254 states and 1978 transitions. [2019-10-13 21:09:22,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:22,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:09:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,461 INFO L225 Difference]: With dead ends: 1254 [2019-10-13 21:09:22,461 INFO L226 Difference]: Without dead ends: 645 [2019-10-13 21:09:22,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-13 21:09:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2019-10-13 21:09:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-13 21:09:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 994 transitions. [2019-10-13 21:09:22,490 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 994 transitions. Word has length 141 [2019-10-13 21:09:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:22,491 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 994 transitions. [2019-10-13 21:09:22,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 994 transitions. [2019-10-13 21:09:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:09:22,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,496 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:22,496 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:22,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash 567172613, now seen corresponding path program 1 times [2019-10-13 21:09:22,497 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:22,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332559524] [2019-10-13 21:09:22,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:22,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332559524] [2019-10-13 21:09:22,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:22,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:22,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256945095] [2019-10-13 21:09:22,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:22,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:22,690 INFO L87 Difference]: Start difference. First operand 642 states and 994 transitions. Second operand 6 states. [2019-10-13 21:09:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,953 INFO L93 Difference]: Finished difference Result 1217 states and 1893 transitions. [2019-10-13 21:09:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:22,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:09:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,961 INFO L225 Difference]: With dead ends: 1217 [2019-10-13 21:09:22,961 INFO L226 Difference]: Without dead ends: 642 [2019-10-13 21:09:22,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:22,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-13 21:09:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-13 21:09:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-13 21:09:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 990 transitions. [2019-10-13 21:09:22,990 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 990 transitions. Word has length 142 [2019-10-13 21:09:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:22,991 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 990 transitions. [2019-10-13 21:09:22,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 990 transitions. [2019-10-13 21:09:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:22,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,995 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:22,996 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash -265339100, now seen corresponding path program 1 times [2019-10-13 21:09:22,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:22,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452855973] [2019-10-13 21:09:22,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:23,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452855973] [2019-10-13 21:09:23,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:23,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:23,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5932002] [2019-10-13 21:09:23,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:23,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:23,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:23,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:23,138 INFO L87 Difference]: Start difference. First operand 642 states and 990 transitions. Second operand 6 states. [2019-10-13 21:09:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:23,361 INFO L93 Difference]: Finished difference Result 1217 states and 1889 transitions. [2019-10-13 21:09:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:23,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:09:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:23,366 INFO L225 Difference]: With dead ends: 1217 [2019-10-13 21:09:23,366 INFO L226 Difference]: Without dead ends: 642 [2019-10-13 21:09:23,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-13 21:09:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-13 21:09:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-13 21:09:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 986 transitions. [2019-10-13 21:09:23,391 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 986 transitions. Word has length 143 [2019-10-13 21:09:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,391 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 986 transitions. [2019-10-13 21:09:23,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 986 transitions. [2019-10-13 21:09:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:23,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,396 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:23,396 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 11991972, now seen corresponding path program 1 times [2019-10-13 21:09:23,397 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357151183] [2019-10-13 21:09:23,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,397 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:23,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357151183] [2019-10-13 21:09:23,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:23,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:23,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688684828] [2019-10-13 21:09:23,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:23,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:23,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:23,529 INFO L87 Difference]: Start difference. First operand 642 states and 986 transitions. Second operand 7 states. [2019-10-13 21:09:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:23,655 INFO L93 Difference]: Finished difference Result 1220 states and 1889 transitions. [2019-10-13 21:09:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:23,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:09:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:23,661 INFO L225 Difference]: With dead ends: 1220 [2019-10-13 21:09:23,661 INFO L226 Difference]: Without dead ends: 624 [2019-10-13 21:09:23,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-13 21:09:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 621. [2019-10-13 21:09:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-13 21:09:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 949 transitions. [2019-10-13 21:09:23,692 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 949 transitions. Word has length 143 [2019-10-13 21:09:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,692 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 949 transitions. [2019-10-13 21:09:23,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 949 transitions. [2019-10-13 21:09:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:09:23,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,700 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:23,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1423770774, now seen corresponding path program 1 times [2019-10-13 21:09:23,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284781304] [2019-10-13 21:09:23,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:23,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284781304] [2019-10-13 21:09:23,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:23,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:23,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626203207] [2019-10-13 21:09:23,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:23,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:23,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:23,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:23,846 INFO L87 Difference]: Start difference. First operand 621 states and 949 transitions. Second operand 6 states. [2019-10-13 21:09:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,012 INFO L93 Difference]: Finished difference Result 1196 states and 1848 transitions. [2019-10-13 21:09:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:24,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:09:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,019 INFO L225 Difference]: With dead ends: 1196 [2019-10-13 21:09:24,019 INFO L226 Difference]: Without dead ends: 621 [2019-10-13 21:09:24,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-13 21:09:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-13 21:09:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-13 21:09:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 948 transitions. [2019-10-13 21:09:24,047 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 948 transitions. Word has length 144 [2019-10-13 21:09:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:24,048 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 948 transitions. [2019-10-13 21:09:24,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 948 transitions. [2019-10-13 21:09:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:09:24,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:24,054 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:24,054 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash 199180649, now seen corresponding path program 1 times [2019-10-13 21:09:24,055 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199545089] [2019-10-13 21:09:24,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:24,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199545089] [2019-10-13 21:09:24,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:24,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:24,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316018533] [2019-10-13 21:09:24,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:24,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:24,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:24,191 INFO L87 Difference]: Start difference. First operand 621 states and 948 transitions. Second operand 6 states. [2019-10-13 21:09:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,323 INFO L93 Difference]: Finished difference Result 1196 states and 1847 transitions. [2019-10-13 21:09:24,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:24,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:09:24,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,328 INFO L225 Difference]: With dead ends: 1196 [2019-10-13 21:09:24,329 INFO L226 Difference]: Without dead ends: 621 [2019-10-13 21:09:24,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-13 21:09:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-13 21:09:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-13 21:09:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 947 transitions. [2019-10-13 21:09:24,361 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 947 transitions. Word has length 145 [2019-10-13 21:09:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:24,363 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 947 transitions. [2019-10-13 21:09:24,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 947 transitions. [2019-10-13 21:09:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:09:24,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:24,367 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:24,368 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2145662159, now seen corresponding path program 1 times [2019-10-13 21:09:24,368 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273074215] [2019-10-13 21:09:24,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:24,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273074215] [2019-10-13 21:09:24,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:24,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:09:24,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441194181] [2019-10-13 21:09:24,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:09:24,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:09:24,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:24,575 INFO L87 Difference]: Start difference. First operand 621 states and 947 transitions. Second operand 12 states. [2019-10-13 21:09:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:24,876 INFO L93 Difference]: Finished difference Result 1202 states and 1857 transitions. [2019-10-13 21:09:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:09:24,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:09:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:24,883 INFO L225 Difference]: With dead ends: 1202 [2019-10-13 21:09:24,883 INFO L226 Difference]: Without dead ends: 628 [2019-10-13 21:09:24,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-13 21:09:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-10-13 21:09:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-13 21:09:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 953 transitions. [2019-10-13 21:09:24,916 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 953 transitions. Word has length 146 [2019-10-13 21:09:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:24,918 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 953 transitions. [2019-10-13 21:09:24,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:09:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 953 transitions. [2019-10-13 21:09:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:09:24,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:24,923 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:24,923 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash -661438960, now seen corresponding path program 1 times [2019-10-13 21:09:24,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:24,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88770374] [2019-10-13 21:09:24,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:24,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:25,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88770374] [2019-10-13 21:09:25,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146989320] [2019-10-13 21:09:25,063 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:09:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:25,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:25,785 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:26,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:26,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:26,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259320098] [2019-10-13 21:09:26,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:26,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:26,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:26,211 INFO L87 Difference]: Start difference. First operand 626 states and 953 transitions. Second operand 5 states. [2019-10-13 21:09:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:27,119 INFO L93 Difference]: Finished difference Result 1207 states and 1893 transitions. [2019-10-13 21:09:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:27,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:09:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:27,124 INFO L225 Difference]: With dead ends: 1207 [2019-10-13 21:09:27,125 INFO L226 Difference]: Without dead ends: 634 [2019-10-13 21:09:27,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 284 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-13 21:09:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-13 21:09:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-13 21:09:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 966 transitions. [2019-10-13 21:09:27,155 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 966 transitions. Word has length 147 [2019-10-13 21:09:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:27,155 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 966 transitions. [2019-10-13 21:09:27,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 966 transitions. [2019-10-13 21:09:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:09:27,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:27,160 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:27,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:27,361 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1780339208, now seen corresponding path program 1 times [2019-10-13 21:09:27,362 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:27,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448760718] [2019-10-13 21:09:27,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:27,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448760718] [2019-10-13 21:09:27,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277570186] [2019-10-13 21:09:27,542 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:09:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:28,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:28,265 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:28,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:28,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:28,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129680426] [2019-10-13 21:09:28,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:28,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:28,554 INFO L87 Difference]: Start difference. First operand 634 states and 966 transitions. Second operand 5 states. [2019-10-13 21:09:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,455 INFO L93 Difference]: Finished difference Result 1223 states and 1916 transitions. [2019-10-13 21:09:29,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:29,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:09:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,461 INFO L225 Difference]: With dead ends: 1223 [2019-10-13 21:09:29,461 INFO L226 Difference]: Without dead ends: 642 [2019-10-13 21:09:29,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-13 21:09:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-13 21:09:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-13 21:09:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 979 transitions. [2019-10-13 21:09:29,489 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 979 transitions. Word has length 150 [2019-10-13 21:09:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,490 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 979 transitions. [2019-10-13 21:09:29,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 979 transitions. [2019-10-13 21:09:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:09:29,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:29,495 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:29,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:29,710 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1873201556, now seen corresponding path program 1 times [2019-10-13 21:09:29,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:29,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066091152] [2019-10-13 21:09:29,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:29,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066091152] [2019-10-13 21:09:29,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055654273] [2019-10-13 21:09:29,840 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:09:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:30,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:30,512 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:30,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:30,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:30,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252212523] [2019-10-13 21:09:30,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:30,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:30,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:30,781 INFO L87 Difference]: Start difference. First operand 642 states and 979 transitions. Second operand 5 states. [2019-10-13 21:09:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:31,892 INFO L93 Difference]: Finished difference Result 1239 states and 1939 transitions. [2019-10-13 21:09:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:31,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:09:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:31,900 INFO L225 Difference]: With dead ends: 1239 [2019-10-13 21:09:31,900 INFO L226 Difference]: Without dead ends: 650 [2019-10-13 21:09:31,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 296 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-13 21:09:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-13 21:09:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-13 21:09:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 992 transitions. [2019-10-13 21:09:31,932 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 992 transitions. Word has length 153 [2019-10-13 21:09:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:31,933 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 992 transitions. [2019-10-13 21:09:31,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 992 transitions. [2019-10-13 21:09:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:09:31,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:31,938 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:32,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:32,154 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1298016900, now seen corresponding path program 1 times [2019-10-13 21:09:32,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:32,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392980382] [2019-10-13 21:09:32,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:32,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:32,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:32,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392980382] [2019-10-13 21:09:32,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869181469] [2019-10-13 21:09:32,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:32,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 2637 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:32,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:32,925 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:33,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:33,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2019-10-13 21:09:33,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012987357] [2019-10-13 21:09:33,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:33,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:33,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:33,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:33,197 INFO L87 Difference]: Start difference. First operand 650 states and 992 transitions. Second operand 5 states. [2019-10-13 21:09:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:34,031 INFO L93 Difference]: Finished difference Result 1255 states and 1962 transitions. [2019-10-13 21:09:34,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:34,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-13 21:09:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:34,041 INFO L225 Difference]: With dead ends: 1255 [2019-10-13 21:09:34,042 INFO L226 Difference]: Without dead ends: 658 [2019-10-13 21:09:34,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 302 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-13 21:09:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-10-13 21:09:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-13 21:09:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1005 transitions. [2019-10-13 21:09:34,072 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1005 transitions. Word has length 156 [2019-10-13 21:09:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:34,073 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1005 transitions. [2019-10-13 21:09:34,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1005 transitions. [2019-10-13 21:09:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:09:34,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:34,079 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:34,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:34,288 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:34,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash -878049512, now seen corresponding path program 1 times [2019-10-13 21:09:34,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:34,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695853530] [2019-10-13 21:09:34,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:34,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:34,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:34,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695853530] [2019-10-13 21:09:34,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512458707] [2019-10-13 21:09:34,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:34,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:09:34,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:09:35,027 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:35,124 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:35,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-13 21:09:35,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948092116] [2019-10-13 21:09:35,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:35,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:35,126 INFO L87 Difference]: Start difference. First operand 658 states and 1005 transitions. Second operand 3 states. [2019-10-13 21:09:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:35,173 INFO L93 Difference]: Finished difference Result 1470 states and 2248 transitions. [2019-10-13 21:09:35,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:35,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-13 21:09:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:35,181 INFO L225 Difference]: With dead ends: 1470 [2019-10-13 21:09:35,181 INFO L226 Difference]: Without dead ends: 865 [2019-10-13 21:09:35,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-13 21:09:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 862. [2019-10-13 21:09:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-13 21:09:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1292 transitions. [2019-10-13 21:09:35,223 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1292 transitions. Word has length 159 [2019-10-13 21:09:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:35,225 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1292 transitions. [2019-10-13 21:09:35,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1292 transitions. [2019-10-13 21:09:35,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:09:35,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:35,231 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:35,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:35,446 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash -954950310, now seen corresponding path program 1 times [2019-10-13 21:09:35,447 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:35,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023039757] [2019-10-13 21:09:35,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:35,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:35,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:35,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023039757] [2019-10-13 21:09:35,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494650625] [2019-10-13 21:09:35,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:36,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 2643 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:09:36,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:09:36,177 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:36,297 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:36,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-13 21:09:36,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526622369] [2019-10-13 21:09:36,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:36,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:36,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:36,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:36,299 INFO L87 Difference]: Start difference. First operand 862 states and 1292 transitions. Second operand 6 states. [2019-10-13 21:09:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:37,106 INFO L93 Difference]: Finished difference Result 2484 states and 3814 transitions. [2019-10-13 21:09:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:37,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-13 21:09:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:37,123 INFO L225 Difference]: With dead ends: 2484 [2019-10-13 21:09:37,123 INFO L226 Difference]: Without dead ends: 1676 [2019-10-13 21:09:37,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-10-13 21:09:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1667. [2019-10-13 21:09:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-10-13 21:09:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2540 transitions. [2019-10-13 21:09:37,223 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2540 transitions. Word has length 159 [2019-10-13 21:09:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:37,225 INFO L462 AbstractCegarLoop]: Abstraction has 1667 states and 2540 transitions. [2019-10-13 21:09:37,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2540 transitions. [2019-10-13 21:09:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:37,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:37,232 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:37,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:37,440 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1910070003, now seen corresponding path program 1 times [2019-10-13 21:09:37,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:37,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875971284] [2019-10-13 21:09:37,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:37,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875971284] [2019-10-13 21:09:37,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203684867] [2019-10-13 21:09:37,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:38,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:09:38,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:09:38,162 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:38,292 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:38,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-13 21:09:38,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682489379] [2019-10-13 21:09:38,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:38,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:38,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:38,294 INFO L87 Difference]: Start difference. First operand 1667 states and 2540 transitions. Second operand 3 states. [2019-10-13 21:09:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:38,446 INFO L93 Difference]: Finished difference Result 4078 states and 6298 transitions. [2019-10-13 21:09:38,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:38,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-13 21:09:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:38,463 INFO L225 Difference]: With dead ends: 4078 [2019-10-13 21:09:38,463 INFO L226 Difference]: Without dead ends: 2467 [2019-10-13 21:09:38,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2019-10-13 21:09:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 1667. [2019-10-13 21:09:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-10-13 21:09:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2539 transitions. [2019-10-13 21:09:38,548 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2539 transitions. Word has length 164 [2019-10-13 21:09:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:38,548 INFO L462 AbstractCegarLoop]: Abstraction has 1667 states and 2539 transitions. [2019-10-13 21:09:38,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2539 transitions. [2019-10-13 21:09:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:38,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:38,554 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:38,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:38,764 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:38,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1486423281, now seen corresponding path program 1 times [2019-10-13 21:09:38,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:38,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800049356] [2019-10-13 21:09:38,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:38,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:38,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:38,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800049356] [2019-10-13 21:09:38,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099482078] [2019-10-13 21:09:38,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:39,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:09:39,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:09:39,599 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:39,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:39,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-13 21:09:39,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749885493] [2019-10-13 21:09:39,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:39,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:39,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:39,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:09:39,970 INFO L87 Difference]: Start difference. First operand 1667 states and 2539 transitions. Second operand 9 states. [2019-10-13 21:09:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:45,632 INFO L93 Difference]: Finished difference Result 5114 states and 7962 transitions. [2019-10-13 21:09:45,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:45,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-13 21:09:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:45,659 INFO L225 Difference]: With dead ends: 5114 [2019-10-13 21:09:45,659 INFO L226 Difference]: Without dead ends: 3500 [2019-10-13 21:09:45,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:09:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2019-10-13 21:09:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3443. [2019-10-13 21:09:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2019-10-13 21:09:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 5311 transitions. [2019-10-13 21:09:45,863 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 5311 transitions. Word has length 164 [2019-10-13 21:09:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:45,864 INFO L462 AbstractCegarLoop]: Abstraction has 3443 states and 5311 transitions. [2019-10-13 21:09:45,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 5311 transitions. [2019-10-13 21:09:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:09:45,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:45,872 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:46,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:46,080 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1959929722, now seen corresponding path program 1 times [2019-10-13 21:09:46,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:46,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373375366] [2019-10-13 21:09:46,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:46,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:46,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:46,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373375366] [2019-10-13 21:09:46,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:46,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:46,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256765602] [2019-10-13 21:09:46,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:46,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:46,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:46,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:46,235 INFO L87 Difference]: Start difference. First operand 3443 states and 5311 transitions. Second operand 9 states. [2019-10-13 21:09:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:46,667 INFO L93 Difference]: Finished difference Result 6685 states and 10347 transitions. [2019-10-13 21:09:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:46,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-13 21:09:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:46,692 INFO L225 Difference]: With dead ends: 6685 [2019-10-13 21:09:46,692 INFO L226 Difference]: Without dead ends: 3289 [2019-10-13 21:09:46,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2019-10-13 21:09:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3281. [2019-10-13 21:09:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-10-13 21:09:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 5061 transitions. [2019-10-13 21:09:46,833 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 5061 transitions. Word has length 167 [2019-10-13 21:09:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:46,834 INFO L462 AbstractCegarLoop]: Abstraction has 3281 states and 5061 transitions. [2019-10-13 21:09:46,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 5061 transitions. [2019-10-13 21:09:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-13 21:09:46,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:46,838 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:46,839 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:46,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2073251408, now seen corresponding path program 1 times [2019-10-13 21:09:46,839 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:46,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790201836] [2019-10-13 21:09:46,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:46,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:46,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:47,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790201836] [2019-10-13 21:09:47,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297144496] [2019-10-13 21:09:47,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:47,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 2695 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:09:47,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:09:47,701 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:48,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:48,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-13 21:09:48,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058765277] [2019-10-13 21:09:48,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:48,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:48,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:09:48,067 INFO L87 Difference]: Start difference. First operand 3281 states and 5061 transitions. Second operand 9 states.