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_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:08:06,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:08:06,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:08:06,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:08:06,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:08:06,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:08:06,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:08:06,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:08:06,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:08:06,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:08:06,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:08:06,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:08:06,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:08:06,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:08:06,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:08:06,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:08:06,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:08:06,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:08:06,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:08:06,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:08:06,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:08:06,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:08:06,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:08:07,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:08:07,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:08:07,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:08:07,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:08:07,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:08:07,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:08:07,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:08:07,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:08:07,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:08:07,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:08:07,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:08:07,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:08:07,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:08:07,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:08:07,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:08:07,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:08:07,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:08:07,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:08:07,013 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-15 01:08:07,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:08:07,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:08:07,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:08:07,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:08:07,037 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:08:07,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:08:07,037 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:08:07,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:08:07,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:08:07,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:08:07,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:08:07,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:08:07,039 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:08:07,040 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:08:07,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:08:07,040 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:08:07,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:08:07,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:08:07,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:08:07,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:08:07,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:08:07,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:08:07,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:08:07,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:08:07,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:08:07,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:08:07,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:08:07,043 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:08:07,043 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-15 01:08:07,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:08:07,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:08:07,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:08:07,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:08:07,364 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:08:07,365 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2019-10-15 01:08:07,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe3c3d09/4854837d79a84246978c754507022740/FLAG148a320f2 [2019-10-15 01:08:08,101 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:08:08,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2019-10-15 01:08:08,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe3c3d09/4854837d79a84246978c754507022740/FLAG148a320f2 [2019-10-15 01:08:08,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe3c3d09/4854837d79a84246978c754507022740 [2019-10-15 01:08:08,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:08:08,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:08:08,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:08,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:08:08,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:08:08,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67af7f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:08, skipping insertion in model container [2019-10-15 01:08:08,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:08" (1/1) ... [2019-10-15 01:08:08,300 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:08:08,386 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:08:09,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:09,136 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:08:09,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:09,372 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:08:09,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09 WrapperNode [2019-10-15 01:08:09,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:09,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:08:09,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:08:09,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:08:09,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (1/1) ... [2019-10-15 01:08:09,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (1/1) ... [2019-10-15 01:08:09,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (1/1) ... [2019-10-15 01:08:09,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (1/1) ... [2019-10-15 01:08:09,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (1/1) ... [2019-10-15 01:08:09,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (1/1) ... [2019-10-15 01:08:09,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (1/1) ... [2019-10-15 01:08:09,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:08:09,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:08:09,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:08:09,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:08:09,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (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-15 01:08:09,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:08:09,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:08:09,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:09,648 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:08:09,648 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:08:09,648 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:08:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:08:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:08:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:08:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:08:09,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:08:09,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:08:09,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:08:09,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:09,650 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:08:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:08:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:08:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:08:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:08:09,652 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:08:09,652 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:08:09,652 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:08:09,652 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:08:09,653 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:08:09,653 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:08:09,653 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:08:09,653 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:08:09,653 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:08:09,653 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:08:09,654 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:08:09,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:08:09,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:09,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:09,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:09,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:08:09,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:08:09,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:08:09,655 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:08:09,655 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:08:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:08:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:08:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:08:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:08:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:08:09,656 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:08:09,657 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:08:09,657 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:08:09,657 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:08:09,657 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:08:09,657 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:08:09,657 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:08:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:08:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:08:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:08:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:08:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:08:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:08:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:08:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:08:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:08:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:08:09,660 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:08:09,660 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:08:09,660 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:08:09,660 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:08:09,660 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:08:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:08:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:08:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:08:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:08:09,661 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:08:09,662 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:08:09,662 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:08:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:08:09,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:08:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:08:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:08:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:08:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:08:09,663 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:08:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:08:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:08:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:08:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:08:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:08:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:08:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:08:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:08:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:08:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:08:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:08:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:08:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:08:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:08:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:08:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:08:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:08:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:08:09,667 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:08:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:08:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:08:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:08:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:08:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:08:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:08:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:08:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:08:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:08:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:08:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:08:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:08:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:08:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:08:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:08:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:08:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:08:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:08:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:08:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:08:09,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:08:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:08:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:08:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:08:09,672 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:08:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:08:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:08:09,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:08:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:08:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:08:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:08:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:08:09,674 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:08:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:08:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:08:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:08:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:08:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:08:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:08:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:08:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:08:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:08:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:08:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:08:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:08:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:08:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:08:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:08:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:08:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:08:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:08:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:08:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:08:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:08:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:08:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:08:09,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:08:11,958 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:08:11,958 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:08:11,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:11 BoogieIcfgContainer [2019-10-15 01:08:11,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:08:11,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:08:11,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:08:11,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:08:11,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:08:08" (1/3) ... [2019-10-15 01:08:11,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f71356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:11, skipping insertion in model container [2019-10-15 01:08:11,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:09" (2/3) ... [2019-10-15 01:08:11,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f71356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:11, skipping insertion in model container [2019-10-15 01:08:11,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:11" (3/3) ... [2019-10-15 01:08:11,968 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product11.cil.c [2019-10-15 01:08:11,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:08:11,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:08:11,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:08:12,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:08:12,038 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:08:12,038 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:08:12,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:08:12,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:08:12,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:08:12,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:08:12,039 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:08:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states. [2019-10-15 01:08:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:08:12,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:12,118 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-15 01:08:12,120 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2137869489, now seen corresponding path program 1 times [2019-10-15 01:08:12,137 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:12,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366737194] [2019-10-15 01:08:12,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:12,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:12,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:12,769 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-15 01:08:12,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366737194] [2019-10-15 01:08:12,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:12,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:12,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454173433] [2019-10-15 01:08:12,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:12,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:12,795 INFO L87 Difference]: Start difference. First operand 730 states. Second operand 4 states. [2019-10-15 01:08:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:12,985 INFO L93 Difference]: Finished difference Result 1158 states and 1864 transitions. [2019-10-15 01:08:12,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:12,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:08:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:13,012 INFO L225 Difference]: With dead ends: 1158 [2019-10-15 01:08:13,013 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:08:13,022 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-15 01:08:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:08:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:08:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:08:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 923 transitions. [2019-10-15 01:08:13,179 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 923 transitions. Word has length 135 [2019-10-15 01:08:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:13,179 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 923 transitions. [2019-10-15 01:08:13,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 923 transitions. [2019-10-15 01:08:13,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:08:13,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:13,207 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-15 01:08:13,209 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1566459786, now seen corresponding path program 1 times [2019-10-15 01:08:13,210 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:13,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530648915] [2019-10-15 01:08:13,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:13,489 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-15 01:08:13,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530648915] [2019-10-15 01:08:13,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:13,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:13,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326036062] [2019-10-15 01:08:13,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:13,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:13,497 INFO L87 Difference]: Start difference. First operand 582 states and 923 transitions. Second operand 4 states. [2019-10-15 01:08:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:13,617 INFO L93 Difference]: Finished difference Result 1131 states and 1807 transitions. [2019-10-15 01:08:13,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:13,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-15 01:08:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:13,690 INFO L225 Difference]: With dead ends: 1131 [2019-10-15 01:08:13,690 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:08:13,695 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-15 01:08:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:08:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:08:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:08:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 922 transitions. [2019-10-15 01:08:13,731 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 922 transitions. Word has length 136 [2019-10-15 01:08:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:13,732 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 922 transitions. [2019-10-15 01:08:13,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 922 transitions. [2019-10-15 01:08:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:08:13,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:13,738 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-15 01:08:13,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash 785186859, now seen corresponding path program 1 times [2019-10-15 01:08:13,739 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:13,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501778683] [2019-10-15 01:08:13,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:13,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:13,905 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-15 01:08:13,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501778683] [2019-10-15 01:08:13,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:13,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:13,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503826518] [2019-10-15 01:08:13,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:13,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:13,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:13,908 INFO L87 Difference]: Start difference. First operand 582 states and 922 transitions. Second operand 4 states. [2019-10-15 01:08:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:14,029 INFO L93 Difference]: Finished difference Result 1131 states and 1806 transitions. [2019-10-15 01:08:14,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:14,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 01:08:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:14,038 INFO L225 Difference]: With dead ends: 1131 [2019-10-15 01:08:14,038 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:08:14,042 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-15 01:08:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:08:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:08:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:08:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 921 transitions. [2019-10-15 01:08:14,081 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 921 transitions. Word has length 137 [2019-10-15 01:08:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:14,082 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 921 transitions. [2019-10-15 01:08:14,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 921 transitions. [2019-10-15 01:08:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:08:14,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:14,089 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-15 01:08:14,090 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1610800858, now seen corresponding path program 1 times [2019-10-15 01:08:14,090 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:14,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870572893] [2019-10-15 01:08:14,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:14,262 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-15 01:08:14,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870572893] [2019-10-15 01:08:14,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:14,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:14,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968105418] [2019-10-15 01:08:14,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:14,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:14,266 INFO L87 Difference]: Start difference. First operand 582 states and 921 transitions. Second operand 4 states. [2019-10-15 01:08:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:14,349 INFO L93 Difference]: Finished difference Result 1131 states and 1805 transitions. [2019-10-15 01:08:14,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:14,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:08:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:14,355 INFO L225 Difference]: With dead ends: 1131 [2019-10-15 01:08:14,355 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:08:14,358 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-15 01:08:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:08:14,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:08:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:08:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 920 transitions. [2019-10-15 01:08:14,389 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 920 transitions. Word has length 138 [2019-10-15 01:08:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:14,389 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 920 transitions. [2019-10-15 01:08:14,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 920 transitions. [2019-10-15 01:08:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:08:14,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:14,399 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-15 01:08:14,400 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1771627783, now seen corresponding path program 1 times [2019-10-15 01:08:14,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:14,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317408136] [2019-10-15 01:08:14,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:14,689 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-15 01:08:14,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317408136] [2019-10-15 01:08:14,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:14,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:14,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920975379] [2019-10-15 01:08:14,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:14,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:14,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:14,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:14,693 INFO L87 Difference]: Start difference. First operand 582 states and 920 transitions. Second operand 4 states. [2019-10-15 01:08:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:14,782 INFO L93 Difference]: Finished difference Result 1131 states and 1804 transitions. [2019-10-15 01:08:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:14,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:08:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:14,796 INFO L225 Difference]: With dead ends: 1131 [2019-10-15 01:08:14,796 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:08:14,804 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-15 01:08:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:08:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:08:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:08:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 919 transitions. [2019-10-15 01:08:14,832 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 919 transitions. Word has length 139 [2019-10-15 01:08:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:14,833 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 919 transitions. [2019-10-15 01:08:14,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 919 transitions. [2019-10-15 01:08:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:08:14,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:14,843 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-15 01:08:14,844 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash -398630206, now seen corresponding path program 1 times [2019-10-15 01:08:14,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:14,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603192141] [2019-10-15 01:08:14,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:14,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:15,056 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-15 01:08:15,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603192141] [2019-10-15 01:08:15,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:15,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:08:15,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79376481] [2019-10-15 01:08:15,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:08:15,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:15,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:08:15,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:08:15,063 INFO L87 Difference]: Start difference. First operand 582 states and 919 transitions. Second operand 10 states. [2019-10-15 01:08:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:15,254 INFO L93 Difference]: Finished difference Result 1136 states and 1811 transitions. [2019-10-15 01:08:15,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:15,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-15 01:08:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:15,266 INFO L225 Difference]: With dead ends: 1136 [2019-10-15 01:08:15,266 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:08:15,272 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-15 01:08:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:08:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-10-15 01:08:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 01:08:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 929 transitions. [2019-10-15 01:08:15,296 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 929 transitions. Word has length 140 [2019-10-15 01:08:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:15,297 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 929 transitions. [2019-10-15 01:08:15,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:08:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 929 transitions. [2019-10-15 01:08:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:08:15,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:15,303 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-15 01:08:15,303 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:15,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1385212895, now seen corresponding path program 1 times [2019-10-15 01:08:15,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:15,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102911521] [2019-10-15 01:08:15,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:15,487 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-15 01:08:15,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102911521] [2019-10-15 01:08:15,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:15,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:15,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731903406] [2019-10-15 01:08:15,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:15,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:15,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:15,490 INFO L87 Difference]: Start difference. First operand 589 states and 929 transitions. Second operand 4 states. [2019-10-15 01:08:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:15,554 INFO L93 Difference]: Finished difference Result 1137 states and 1812 transitions. [2019-10-15 01:08:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:15,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:08:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:15,563 INFO L225 Difference]: With dead ends: 1137 [2019-10-15 01:08:15,564 INFO L226 Difference]: Without dead ends: 585 [2019-10-15 01:08:15,568 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-15 01:08:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-15 01:08:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-15 01:08:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-15 01:08:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 922 transitions. [2019-10-15 01:08:15,591 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 922 transitions. Word has length 140 [2019-10-15 01:08:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:15,592 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 922 transitions. [2019-10-15 01:08:15,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 922 transitions. [2019-10-15 01:08:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:08:15,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:15,597 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-15 01:08:15,597 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1670566169, now seen corresponding path program 1 times [2019-10-15 01:08:15,598 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:15,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777776021] [2019-10-15 01:08:15,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:15,756 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-15 01:08:15,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777776021] [2019-10-15 01:08:15,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:15,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:15,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965359838] [2019-10-15 01:08:15,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:15,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:15,758 INFO L87 Difference]: Start difference. First operand 585 states and 922 transitions. Second operand 6 states. [2019-10-15 01:08:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,034 INFO L93 Difference]: Finished difference Result 1150 states and 1836 transitions. [2019-10-15 01:08:16,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:08:16,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:08:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,040 INFO L225 Difference]: With dead ends: 1150 [2019-10-15 01:08:16,040 INFO L226 Difference]: Without dead ends: 593 [2019-10-15 01:08:16,043 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-15 01:08:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-15 01:08:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2019-10-15 01:08:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:08:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 923 transitions. [2019-10-15 01:08:16,066 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 923 transitions. Word has length 141 [2019-10-15 01:08:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,067 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 923 transitions. [2019-10-15 01:08:16,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 923 transitions. [2019-10-15 01:08:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:08:16,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,072 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-15 01:08:16,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash 478732421, now seen corresponding path program 1 times [2019-10-15 01:08:16,073 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597922722] [2019-10-15 01:08:16,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:16,204 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-15 01:08:16,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597922722] [2019-10-15 01:08:16,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:16,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:16,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514518581] [2019-10-15 01:08:16,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:16,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:16,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:16,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:16,207 INFO L87 Difference]: Start difference. First operand 590 states and 923 transitions. Second operand 6 states. [2019-10-15 01:08:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,458 INFO L93 Difference]: Finished difference Result 1113 states and 1751 transitions. [2019-10-15 01:08:16,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:16,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-15 01:08:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,464 INFO L225 Difference]: With dead ends: 1113 [2019-10-15 01:08:16,464 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:08:16,467 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-15 01:08:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:08:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:08:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:08:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 919 transitions. [2019-10-15 01:08:16,487 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 919 transitions. Word has length 142 [2019-10-15 01:08:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,487 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 919 transitions. [2019-10-15 01:08:16,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 919 transitions. [2019-10-15 01:08:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:08:16,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,492 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-15 01:08:16,492 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1066219550, now seen corresponding path program 1 times [2019-10-15 01:08:16,493 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529163364] [2019-10-15 01:08:16,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,493 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:16,624 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-15 01:08:16,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529163364] [2019-10-15 01:08:16,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:16,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:16,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979829679] [2019-10-15 01:08:16,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:16,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:16,626 INFO L87 Difference]: Start difference. First operand 590 states and 919 transitions. Second operand 6 states. [2019-10-15 01:08:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,899 INFO L93 Difference]: Finished difference Result 1113 states and 1747 transitions. [2019-10-15 01:08:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:16,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:08:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,905 INFO L225 Difference]: With dead ends: 1113 [2019-10-15 01:08:16,905 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:08:16,916 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-15 01:08:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:08:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:08:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:08:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 915 transitions. [2019-10-15 01:08:16,968 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 915 transitions. Word has length 143 [2019-10-15 01:08:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,969 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 915 transitions. [2019-10-15 01:08:16,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 915 transitions. [2019-10-15 01:08:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:08:16,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,977 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-15 01:08:16,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1343550622, now seen corresponding path program 1 times [2019-10-15 01:08:16,978 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295842498] [2019-10-15 01:08:16,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,181 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-15 01:08:17,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295842498] [2019-10-15 01:08:17,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:17,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:08:17,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636745837] [2019-10-15 01:08:17,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:08:17,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:17,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:08:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:08:17,184 INFO L87 Difference]: Start difference. First operand 590 states and 915 transitions. Second operand 7 states. [2019-10-15 01:08:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:17,325 INFO L93 Difference]: Finished difference Result 1116 states and 1747 transitions. [2019-10-15 01:08:17,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:17,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:08:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:17,331 INFO L225 Difference]: With dead ends: 1116 [2019-10-15 01:08:17,331 INFO L226 Difference]: Without dead ends: 572 [2019-10-15 01:08:17,334 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-15 01:08:17,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-15 01:08:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 569. [2019-10-15 01:08:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-15 01:08:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 878 transitions. [2019-10-15 01:08:17,354 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 878 transitions. Word has length 143 [2019-10-15 01:08:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:17,355 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 878 transitions. [2019-10-15 01:08:17,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:08:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 878 transitions. [2019-10-15 01:08:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:08:17,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:17,360 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-15 01:08:17,360 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash 978079018, now seen corresponding path program 1 times [2019-10-15 01:08:17,361 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:17,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468130659] [2019-10-15 01:08:17,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,362 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,494 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-15 01:08:17,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468130659] [2019-10-15 01:08:17,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:17,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:17,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739355681] [2019-10-15 01:08:17,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:17,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:17,497 INFO L87 Difference]: Start difference. First operand 569 states and 878 transitions. Second operand 6 states. [2019-10-15 01:08:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:17,625 INFO L93 Difference]: Finished difference Result 1092 states and 1706 transitions. [2019-10-15 01:08:17,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:17,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:08:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:17,630 INFO L225 Difference]: With dead ends: 1092 [2019-10-15 01:08:17,630 INFO L226 Difference]: Without dead ends: 569 [2019-10-15 01:08:17,633 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-15 01:08:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-15 01:08:17,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-15 01:08:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-15 01:08:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 877 transitions. [2019-10-15 01:08:17,654 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 877 transitions. Word has length 144 [2019-10-15 01:08:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:17,655 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 877 transitions. [2019-10-15 01:08:17,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 877 transitions. [2019-10-15 01:08:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:08:17,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:17,659 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-15 01:08:17,659 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1420317475, now seen corresponding path program 1 times [2019-10-15 01:08:17,660 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:17,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990110749] [2019-10-15 01:08:17,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,789 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-15 01:08:17,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990110749] [2019-10-15 01:08:17,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:17,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:17,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557677967] [2019-10-15 01:08:17,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:17,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:17,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:17,792 INFO L87 Difference]: Start difference. First operand 569 states and 877 transitions. Second operand 6 states. [2019-10-15 01:08:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:17,945 INFO L93 Difference]: Finished difference Result 1092 states and 1705 transitions. [2019-10-15 01:08:17,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:17,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:08:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:17,950 INFO L225 Difference]: With dead ends: 1092 [2019-10-15 01:08:17,950 INFO L226 Difference]: Without dead ends: 569 [2019-10-15 01:08:17,955 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-15 01:08:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-15 01:08:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-15 01:08:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-15 01:08:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 876 transitions. [2019-10-15 01:08:17,988 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 876 transitions. Word has length 145 [2019-10-15 01:08:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:17,990 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 876 transitions. [2019-10-15 01:08:17,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 876 transitions. [2019-10-15 01:08:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:08:17,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:17,996 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-15 01:08:17,997 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:17,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:17,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1124435407, now seen corresponding path program 1 times [2019-10-15 01:08:17,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:17,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185621665] [2019-10-15 01:08:17,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:18,213 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-15 01:08:18,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185621665] [2019-10-15 01:08:18,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:18,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:08:18,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713817169] [2019-10-15 01:08:18,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:08:18,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:18,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:08:18,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:08:18,216 INFO L87 Difference]: Start difference. First operand 569 states and 876 transitions. Second operand 12 states. [2019-10-15 01:08:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:18,510 INFO L93 Difference]: Finished difference Result 1098 states and 1715 transitions. [2019-10-15 01:08:18,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:08:18,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-15 01:08:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:18,515 INFO L225 Difference]: With dead ends: 1098 [2019-10-15 01:08:18,515 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 01:08:18,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 01:08:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2019-10-15 01:08:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-10-15 01:08:18,537 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 146 [2019-10-15 01:08:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:18,538 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-10-15 01:08:18,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:08:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-10-15 01:08:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:08:18,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:18,542 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-15 01:08:18,543 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1505055730, now seen corresponding path program 1 times [2019-10-15 01:08:18,543 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:18,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15819124] [2019-10-15 01:08:18,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:08:18,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15819124] [2019-10-15 01:08:18,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632725300] [2019-10-15 01:08:18,728 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-15 01:08:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:19,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:19,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:19,338 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-15 01:08:19,339 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:19,707 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-15 01:08:19,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:19,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-15 01:08:19,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040993805] [2019-10-15 01:08:19,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:19,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:19,710 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 5 states. [2019-10-15 01:08:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:20,597 INFO L93 Difference]: Finished difference Result 1103 states and 1748 transitions. [2019-10-15 01:08:20,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:20,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:08:20,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:20,603 INFO L225 Difference]: With dead ends: 1103 [2019-10-15 01:08:20,604 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:08:20,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:08:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:08:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:08:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:08:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 895 transitions. [2019-10-15 01:08:20,636 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 895 transitions. Word has length 147 [2019-10-15 01:08:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:20,636 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 895 transitions. [2019-10-15 01:08:20,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 895 transitions. [2019-10-15 01:08:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:08:20,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:20,642 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-15 01:08:20,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:20,850 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:20,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:20,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2143848474, now seen corresponding path program 1 times [2019-10-15 01:08:20,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:20,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122420520] [2019-10-15 01:08:20,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:08:21,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122420520] [2019-10-15 01:08:21,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270583589] [2019-10-15 01:08:21,055 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-15 01:08:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:21,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:21,683 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-15 01:08:21,683 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:21,981 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-15 01:08:21,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:21,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:08:21,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850271463] [2019-10-15 01:08:21,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:21,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:21,984 INFO L87 Difference]: Start difference. First operand 582 states and 895 transitions. Second operand 5 states. [2019-10-15 01:08:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:22,802 INFO L93 Difference]: Finished difference Result 1119 states and 1771 transitions. [2019-10-15 01:08:22,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:22,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:08:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:22,808 INFO L225 Difference]: With dead ends: 1119 [2019-10-15 01:08:22,808 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:08:22,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:08:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:08:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:08:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 908 transitions. [2019-10-15 01:08:22,834 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 908 transitions. Word has length 150 [2019-10-15 01:08:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:22,834 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 908 transitions. [2019-10-15 01:08:22,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 908 transitions. [2019-10-15 01:08:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:08:22,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:22,839 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-15 01:08:23,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:23,054 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2124764298, now seen corresponding path program 1 times [2019-10-15 01:08:23,055 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:23,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302898376] [2019-10-15 01:08:23,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:23,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:08:23,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302898376] [2019-10-15 01:08:23,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321395927] [2019-10-15 01:08:23,215 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-15 01:08:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:23,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:23,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:23,785 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-15 01:08:23,786 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:24,110 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-15 01:08:24,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:24,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-15 01:08:24,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871893862] [2019-10-15 01:08:24,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:24,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:24,112 INFO L87 Difference]: Start difference. First operand 590 states and 908 transitions. Second operand 5 states. [2019-10-15 01:08:24,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:24,975 INFO L93 Difference]: Finished difference Result 1135 states and 1794 transitions. [2019-10-15 01:08:24,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:24,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:08:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:24,980 INFO L225 Difference]: With dead ends: 1135 [2019-10-15 01:08:24,980 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:08:24,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:08:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:08:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:08:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:08:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 921 transitions. [2019-10-15 01:08:25,004 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 921 transitions. Word has length 153 [2019-10-15 01:08:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:25,005 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 921 transitions. [2019-10-15 01:08:25,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 921 transitions. [2019-10-15 01:08:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:08:25,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:25,009 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-15 01:08:25,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:25,216 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1878745502, now seen corresponding path program 1 times [2019-10-15 01:08:25,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:25,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385417456] [2019-10-15 01:08:25,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:08:25,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385417456] [2019-10-15 01:08:25,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493303979] [2019-10-15 01:08:25,396 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-15 01:08:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:26,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:26,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:26,106 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-15 01:08:26,106 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:26,403 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-15 01:08:26,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:26,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 16 [2019-10-15 01:08:26,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930185348] [2019-10-15 01:08:26,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:26,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:08:26,406 INFO L87 Difference]: Start difference. First operand 598 states and 921 transitions. Second operand 5 states. [2019-10-15 01:08:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:27,275 INFO L93 Difference]: Finished difference Result 1151 states and 1817 transitions. [2019-10-15 01:08:27,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:27,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-15 01:08:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:27,280 INFO L225 Difference]: With dead ends: 1151 [2019-10-15 01:08:27,280 INFO L226 Difference]: Without dead ends: 606 [2019-10-15 01:08:27,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 312 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-15 01:08:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-15 01:08:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-15 01:08:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 934 transitions. [2019-10-15 01:08:27,304 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 934 transitions. Word has length 156 [2019-10-15 01:08:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:27,305 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 934 transitions. [2019-10-15 01:08:27,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 934 transitions. [2019-10-15 01:08:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:08:27,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:27,309 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-15 01:08:27,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:27,516 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:27,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1877071098, now seen corresponding path program 1 times [2019-10-15 01:08:27,517 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:27,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149391407] [2019-10-15 01:08:27,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:27,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:27,675 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-15 01:08:27,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149391407] [2019-10-15 01:08:27,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123758198] [2019-10-15 01:08:27,676 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-15 01:08:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:28,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:08:28,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:28,331 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-15 01:08:28,331 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:28,463 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-15 01:08:28,463 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:08:28,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-15 01:08:28,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612640095] [2019-10-15 01:08:28,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:28,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:28,465 INFO L87 Difference]: Start difference. First operand 606 states and 934 transitions. Second operand 6 states. [2019-10-15 01:08:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:29,310 INFO L93 Difference]: Finished difference Result 1718 states and 2734 transitions. [2019-10-15 01:08:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:29,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-15 01:08:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:29,320 INFO L225 Difference]: With dead ends: 1718 [2019-10-15 01:08:29,320 INFO L226 Difference]: Without dead ends: 1165 [2019-10-15 01:08:29,323 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-15 01:08:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-10-15 01:08:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1156. [2019-10-15 01:08:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-10-15 01:08:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1821 transitions. [2019-10-15 01:08:29,370 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1821 transitions. Word has length 159 [2019-10-15 01:08:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:29,371 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1821 transitions. [2019-10-15 01:08:29,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1821 transitions. [2019-10-15 01:08:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:08:29,375 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:29,376 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-15 01:08:29,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:29,591 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1145204813, now seen corresponding path program 1 times [2019-10-15 01:08:29,592 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:29,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16452995] [2019-10-15 01:08:29,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:29,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:29,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:29,753 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-15 01:08:29,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16452995] [2019-10-15 01:08:29,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296754077] [2019-10-15 01:08:29,754 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-15 01:08:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:30,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:08:30,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:30,401 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-15 01:08:30,401 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:30,508 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-15 01:08:30,508 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:08:30,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-15 01:08:30,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855992450] [2019-10-15 01:08:30,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:08:30,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:08:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:30,510 INFO L87 Difference]: Start difference. First operand 1156 states and 1821 transitions. Second operand 3 states. [2019-10-15 01:08:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:30,629 INFO L93 Difference]: Finished difference Result 2803 states and 4493 transitions. [2019-10-15 01:08:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:08:30,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-15 01:08:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:30,641 INFO L225 Difference]: With dead ends: 2803 [2019-10-15 01:08:30,642 INFO L226 Difference]: Without dead ends: 1701 [2019-10-15 01:08:30,647 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-15 01:08:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2019-10-15 01:08:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1156. [2019-10-15 01:08:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-10-15 01:08:30,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1820 transitions. [2019-10-15 01:08:30,701 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1820 transitions. Word has length 164 [2019-10-15 01:08:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:30,701 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1820 transitions. [2019-10-15 01:08:30,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:08:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1820 transitions. [2019-10-15 01:08:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:08:30,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:30,705 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-15 01:08:30,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:30,912 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:30,913 INFO L82 PathProgramCache]: Analyzing trace with hash -721558091, now seen corresponding path program 1 times [2019-10-15 01:08:30,913 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:30,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855132009] [2019-10-15 01:08:30,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:30,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:30,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:31,081 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-15 01:08:31,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855132009] [2019-10-15 01:08:31,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064541219] [2019-10-15 01:08:31,082 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-15 01:08:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:31,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 2627 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-15 01:08:31,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:31,694 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-15 01:08:31,694 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:32,097 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-15 01:08:32,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:32,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-15 01:08:32,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448317818] [2019-10-15 01:08:32,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:32,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:08:32,099 INFO L87 Difference]: Start difference. First operand 1156 states and 1820 transitions. Second operand 9 states. [2019-10-15 01:08:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:37,983 INFO L93 Difference]: Finished difference Result 3531 states and 5673 transitions. [2019-10-15 01:08:37,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:37,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-15 01:08:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:37,998 INFO L225 Difference]: With dead ends: 3531 [2019-10-15 01:08:37,998 INFO L226 Difference]: Without dead ends: 2428 [2019-10-15 01:08:38,004 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-15 01:08:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2019-10-15 01:08:38,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2397. [2019-10-15 01:08:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2397 states. [2019-10-15 01:08:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3835 transitions. [2019-10-15 01:08:38,118 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3835 transitions. Word has length 164 [2019-10-15 01:08:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:38,119 INFO L462 AbstractCegarLoop]: Abstraction has 2397 states and 3835 transitions. [2019-10-15 01:08:38,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3835 transitions. [2019-10-15 01:08:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:08:38,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:38,125 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-15 01:08:38,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:38,341 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1012228542, now seen corresponding path program 1 times [2019-10-15 01:08:38,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:38,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339191786] [2019-10-15 01:08:38,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:38,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:38,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:38,476 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-15 01:08:38,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339191786] [2019-10-15 01:08:38,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:38,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:08:38,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205387864] [2019-10-15 01:08:38,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:38,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:08:38,478 INFO L87 Difference]: Start difference. First operand 2397 states and 3835 transitions. Second operand 9 states. [2019-10-15 01:08:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:38,704 INFO L93 Difference]: Finished difference Result 4666 states and 7506 transitions. [2019-10-15 01:08:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:38,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-15 01:08:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:38,721 INFO L225 Difference]: With dead ends: 4666 [2019-10-15 01:08:38,721 INFO L226 Difference]: Without dead ends: 2316 [2019-10-15 01:08:38,732 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-15 01:08:38,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2019-10-15 01:08:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2312. [2019-10-15 01:08:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-15 01:08:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3708 transitions. [2019-10-15 01:08:38,820 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3708 transitions. Word has length 167 [2019-10-15 01:08:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:38,820 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3708 transitions. [2019-10-15 01:08:38,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:08:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3708 transitions. [2019-10-15 01:08:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-15 01:08:38,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:38,824 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:38,824 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -358886389, now seen corresponding path program 1 times [2019-10-15 01:08:38,825 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:38,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350241416] [2019-10-15 01:08:38,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:38,825 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:38,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:08:38,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350241416] [2019-10-15 01:08:38,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353938349] [2019-10-15 01:08:38,957 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-15 01:08:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:39,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-15 01:08:39,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:08:39,616 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-15 01:08:39,836 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:08:39,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 13 [2019-10-15 01:08:39,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464624683] [2019-10-15 01:08:39,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:08:39,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:08:39,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:39,838 INFO L87 Difference]: Start difference. First operand 2312 states and 3708 transitions. Second operand 7 states. [2019-10-15 01:08:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:39,940 INFO L93 Difference]: Finished difference Result 4747 states and 7691 transitions. [2019-10-15 01:08:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:39,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-15 01:08:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:39,957 INFO L225 Difference]: With dead ends: 4747 [2019-10-15 01:08:39,957 INFO L226 Difference]: Without dead ends: 2488 [2019-10-15 01:08:39,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 341 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2019-10-15 01:08:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2480. [2019-10-15 01:08:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2480 states. [2019-10-15 01:08:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3997 transitions. [2019-10-15 01:08:40,071 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3997 transitions. Word has length 170 [2019-10-15 01:08:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:40,071 INFO L462 AbstractCegarLoop]: Abstraction has 2480 states and 3997 transitions. [2019-10-15 01:08:40,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:08:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3997 transitions. [2019-10-15 01:08:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-15 01:08:40,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:40,076 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:08:40,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:40,284 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash -575012303, now seen corresponding path program 1 times [2019-10-15 01:08:40,285 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:40,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847823981] [2019-10-15 01:08:40,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:40,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:40,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:08:40,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847823981] [2019-10-15 01:08:40,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875850184] [2019-10-15 01:08:40,452 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-15 01:08:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:40,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-15 01:08:41,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:08:41,103 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-15 01:08:41,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:41,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-15 01:08:41,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63405998] [2019-10-15 01:08:41,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:41,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:08:41,476 INFO L87 Difference]: Start difference. First operand 2480 states and 3997 transitions. Second operand 9 states.