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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 14:07:15,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 14:07:15,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 14:07:15,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 14:07:15,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 14:07:15,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 14:07:15,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 14:07:15,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 14:07:15,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 14:07:15,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 14:07:15,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 14:07:15,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 14:07:15,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 14:07:15,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 14:07:15,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 14:07:15,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 14:07:15,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 14:07:15,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 14:07:15,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 14:07:15,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 14:07:15,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 14:07:15,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 14:07:15,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 14:07:15,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 14:07:15,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 14:07:15,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 14:07:15,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 14:07:15,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 14:07:15,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 14:07:15,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 14:07:15,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 14:07:15,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 14:07:15,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 14:07:15,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 14:07:15,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 14:07:15,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 14:07:15,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 14:07:15,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 14:07:15,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 14:07:15,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 14:07:15,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 14:07:15,509 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-07 14:07:15,528 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 14:07:15,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 14:07:15,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 14:07:15,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 14:07:15,531 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 14:07:15,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 14:07:15,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 14:07:15,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 14:07:15,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 14:07:15,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 14:07:15,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 14:07:15,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 14:07:15,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 14:07:15,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 14:07:15,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 14:07:15,534 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 14:07:15,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 14:07:15,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 14:07:15,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 14:07:15,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 14:07:15,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 14:07:15,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 14:07:15,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 14:07:15,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 14:07:15,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 14:07:15,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 14:07:15,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 14:07:15,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 14:07:15,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 14:07:15,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 14:07:15,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 14:07:15,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 14:07:15,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 14:07:15,844 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 14:07:15,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product22.cil.c [2019-10-07 14:07:15,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbfa36ab/080b332daa13401eac922524e796d839/FLAG156267085 [2019-10-07 14:07:16,582 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 14:07:16,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product22.cil.c [2019-10-07 14:07:16,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbfa36ab/080b332daa13401eac922524e796d839/FLAG156267085 [2019-10-07 14:07:16,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdbfa36ab/080b332daa13401eac922524e796d839 [2019-10-07 14:07:16,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 14:07:16,766 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 14:07:16,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 14:07:16,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 14:07:16,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 14:07:16,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:07:16" (1/1) ... [2019-10-07 14:07:16,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5293757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:16, skipping insertion in model container [2019-10-07 14:07:16,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 02:07:16" (1/1) ... [2019-10-07 14:07:16,779 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 14:07:16,856 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 14:07:17,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:07:17,598 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 14:07:17,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 14:07:17,837 INFO L192 MainTranslator]: Completed translation [2019-10-07 14:07:17,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17 WrapperNode [2019-10-07 14:07:17,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 14:07:17,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 14:07:17,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 14:07:17,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 14:07:17,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (1/1) ... [2019-10-07 14:07:17,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (1/1) ... [2019-10-07 14:07:17,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (1/1) ... [2019-10-07 14:07:17,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (1/1) ... [2019-10-07 14:07:17,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (1/1) ... [2019-10-07 14:07:17,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (1/1) ... [2019-10-07 14:07:18,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (1/1) ... [2019-10-07 14:07:18,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 14:07:18,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 14:07:18,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 14:07:18,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 14:07:18,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (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-07 14:07:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 14:07:18,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 14:07:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-07 14:07:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-07 14:07:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-07 14:07:18,117 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-07 14:07:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-07 14:07:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-07 14:07:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-07 14:07:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-07 14:07:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-07 14:07:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-07 14:07:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-07 14:07:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-07 14:07:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-07 14:07:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-07 14:07:18,120 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-07 14:07:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-07 14:07:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-07 14:07:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-07 14:07:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-07 14:07:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-07 14:07:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-07 14:07:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-07 14:07:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-07 14:07:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-07 14:07:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-07 14:07:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-07 14:07:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-07 14:07:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-07 14:07:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-07 14:07:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-07 14:07:18,124 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-07 14:07:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-07 14:07:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-07 14:07:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-07 14:07:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 14:07:18,125 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-07 14:07:18,126 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-07 14:07:18,126 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-07 14:07:18,126 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-07 14:07:18,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-07 14:07:18,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-07 14:07:18,126 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-07 14:07:18,127 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-07 14:07:18,127 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-07 14:07:18,127 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-07 14:07:18,127 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-07 14:07:18,127 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-07 14:07:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-07 14:07:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-07 14:07:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-07 14:07:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-07 14:07:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-07 14:07:18,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-07 14:07:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-07 14:07:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-07 14:07:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-07 14:07:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-07 14:07:18,129 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-07 14:07:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-07 14:07:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-07 14:07:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-07 14:07:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-07 14:07:18,130 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-07 14:07:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-07 14:07:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-07 14:07:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-07 14:07:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-07 14:07:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-07 14:07:18,131 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-07 14:07:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-07 14:07:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-07 14:07:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-07 14:07:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-07 14:07:18,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-07 14:07:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-07 14:07:18,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-07 14:07:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 14:07:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 14:07:18,133 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-07 14:07:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 14:07:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 14:07:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-07 14:07:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 14:07:18,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 14:07:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 14:07:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 14:07:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-07 14:07:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 14:07:18,135 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-07 14:07:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-07 14:07:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 14:07:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-07 14:07:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-07 14:07:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 14:07:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-07 14:07:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-07 14:07:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-07 14:07:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-07 14:07:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-07 14:07:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-07 14:07:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-07 14:07:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-07 14:07:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-07 14:07:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-07 14:07:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-07 14:07:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-07 14:07:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 14:07:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-07 14:07:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-07 14:07:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-07 14:07:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-07 14:07:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-07 14:07:18,140 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-07 14:07:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-07 14:07:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-07 14:07:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-07 14:07:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-07 14:07:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-07 14:07:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-07 14:07:18,141 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-07 14:07:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-07 14:07:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-07 14:07:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-07 14:07:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-07 14:07:18,142 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-07 14:07:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-07 14:07:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-07 14:07:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-07 14:07:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-07 14:07:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-07 14:07:18,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 14:07:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-07 14:07:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-07 14:07:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-07 14:07:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-07 14:07:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-07 14:07:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-07 14:07:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-07 14:07:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-07 14:07:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-07 14:07:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-07 14:07:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-07 14:07:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-07 14:07:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-07 14:07:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-07 14:07:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-07 14:07:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-07 14:07:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-07 14:07:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-07 14:07:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-07 14:07:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-07 14:07:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-07 14:07:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-07 14:07:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-07 14:07:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-07 14:07:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-07 14:07:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-07 14:07:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-07 14:07:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-07 14:07:18,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 14:07:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 14:07:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 14:07:23,350 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 14:07:23,351 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-07 14:07:23,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:07:23 BoogieIcfgContainer [2019-10-07 14:07:23,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 14:07:23,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 14:07:23,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 14:07:23,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 14:07:23,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 02:07:16" (1/3) ... [2019-10-07 14:07:23,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586d08e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:07:23, skipping insertion in model container [2019-10-07 14:07:23,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 02:07:17" (2/3) ... [2019-10-07 14:07:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586d08e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 02:07:23, skipping insertion in model container [2019-10-07 14:07:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 02:07:23" (3/3) ... [2019-10-07 14:07:23,369 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product22.cil.c [2019-10-07 14:07:23,385 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 14:07:23,400 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 14:07:23,415 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 14:07:23,480 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 14:07:23,480 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 14:07:23,480 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 14:07:23,481 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 14:07:23,481 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 14:07:23,481 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 14:07:23,481 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 14:07:23,481 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 14:07:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states. [2019-10-07 14:07:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 14:07:23,568 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:23,570 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:23,573 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1500827247, now seen corresponding path program 1 times [2019-10-07 14:07:23,596 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:23,597 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:23,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:23,598 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 14:07:24,307 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:24,308 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:24,308 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 14:07:24,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 14:07:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 14:07:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 14:07:24,332 INFO L87 Difference]: Start difference. First operand 583 states. Second operand 2 states. [2019-10-07 14:07:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:24,422 INFO L93 Difference]: Finished difference Result 486 states and 722 transitions. [2019-10-07 14:07:24,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 14:07:24,424 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 97 [2019-10-07 14:07:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:24,451 INFO L225 Difference]: With dead ends: 486 [2019-10-07 14:07:24,452 INFO L226 Difference]: Without dead ends: 452 [2019-10-07 14:07:24,459 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 14:07:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-07 14:07:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-10-07 14:07:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-07 14:07:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 671 transitions. [2019-10-07 14:07:24,615 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 671 transitions. Word has length 97 [2019-10-07 14:07:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:24,618 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 671 transitions. [2019-10-07 14:07:24,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 14:07:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 671 transitions. [2019-10-07 14:07:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 14:07:24,624 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:24,624 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:24,624 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1281384838, now seen corresponding path program 1 times [2019-10-07 14:07:24,625 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:24,625 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:24,625 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:24,626 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 14:07:25,062 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:25,062 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:25,063 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:07:25,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:07:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:07:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:07:25,066 INFO L87 Difference]: Start difference. First operand 452 states and 671 transitions. Second operand 9 states. [2019-10-07 14:07:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:31,264 INFO L93 Difference]: Finished difference Result 1217 states and 1853 transitions. [2019-10-07 14:07:31,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 14:07:31,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-07 14:07:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:31,272 INFO L225 Difference]: With dead ends: 1217 [2019-10-07 14:07:31,273 INFO L226 Difference]: Without dead ends: 818 [2019-10-07 14:07:31,280 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-07 14:07:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-07 14:07:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 787. [2019-10-07 14:07:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-10-07 14:07:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1158 transitions. [2019-10-07 14:07:31,388 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1158 transitions. Word has length 98 [2019-10-07 14:07:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:31,390 INFO L462 AbstractCegarLoop]: Abstraction has 787 states and 1158 transitions. [2019-10-07 14:07:31,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:07:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1158 transitions. [2019-10-07 14:07:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-07 14:07:31,394 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:31,402 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:31,403 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:31,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash 837344238, now seen corresponding path program 1 times [2019-10-07 14:07:31,404 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:31,404 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:31,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:31,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:31,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 14:07:31,637 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:31,637 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:31,637 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:07:31,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:07:31,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:07:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:07:31,640 INFO L87 Difference]: Start difference. First operand 787 states and 1158 transitions. Second operand 3 states. [2019-10-07 14:07:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:31,767 INFO L93 Difference]: Finished difference Result 2247 states and 3357 transitions. [2019-10-07 14:07:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:07:31,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-07 14:07:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:31,782 INFO L225 Difference]: With dead ends: 2247 [2019-10-07 14:07:31,782 INFO L226 Difference]: Without dead ends: 1515 [2019-10-07 14:07:31,788 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:07:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-10-07 14:07:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1508. [2019-10-07 14:07:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-10-07 14:07:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2244 transitions. [2019-10-07 14:07:31,905 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2244 transitions. Word has length 99 [2019-10-07 14:07:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:31,907 INFO L462 AbstractCegarLoop]: Abstraction has 1508 states and 2244 transitions. [2019-10-07 14:07:31,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:07:31,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2244 transitions. [2019-10-07 14:07:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 14:07:31,911 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:31,911 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:31,911 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:31,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:31,912 INFO L82 PathProgramCache]: Analyzing trace with hash 187569329, now seen corresponding path program 1 times [2019-10-07 14:07:31,912 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:31,912 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:31,912 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:31,913 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 14:07:32,221 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:32,221 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:32,221 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:07:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:07:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:07:32,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:07:32,223 INFO L87 Difference]: Start difference. First operand 1508 states and 2244 transitions. Second operand 6 states. [2019-10-07 14:07:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:35,405 INFO L93 Difference]: Finished difference Result 4805 states and 7297 transitions. [2019-10-07 14:07:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:07:35,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-07 14:07:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:35,431 INFO L225 Difference]: With dead ends: 4805 [2019-10-07 14:07:35,432 INFO L226 Difference]: Without dead ends: 3353 [2019-10-07 14:07:35,440 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:07:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2019-10-07 14:07:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3042. [2019-10-07 14:07:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2019-10-07 14:07:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4615 transitions. [2019-10-07 14:07:35,631 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4615 transitions. Word has length 100 [2019-10-07 14:07:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:35,632 INFO L462 AbstractCegarLoop]: Abstraction has 3042 states and 4615 transitions. [2019-10-07 14:07:35,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:07:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4615 transitions. [2019-10-07 14:07:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-07 14:07:35,638 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:35,638 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:35,639 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:35,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:35,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1550250293, now seen corresponding path program 1 times [2019-10-07 14:07:35,640 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:35,640 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:35,640 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:35,640 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:07:35,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:35,931 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:35,931 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 14:07:35,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 14:07:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 14:07:35,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-07 14:07:35,933 INFO L87 Difference]: Start difference. First operand 3042 states and 4615 transitions. Second operand 12 states. [2019-10-07 14:07:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:43,322 INFO L93 Difference]: Finished difference Result 9144 states and 13864 transitions. [2019-10-07 14:07:43,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-07 14:07:43,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2019-10-07 14:07:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:43,363 INFO L225 Difference]: With dead ends: 9144 [2019-10-07 14:07:43,364 INFO L226 Difference]: Without dead ends: 6157 [2019-10-07 14:07:43,382 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-07 14:07:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2019-10-07 14:07:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 6055. [2019-10-07 14:07:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6055 states. [2019-10-07 14:07:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 9082 transitions. [2019-10-07 14:07:43,738 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 9082 transitions. Word has length 139 [2019-10-07 14:07:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:43,738 INFO L462 AbstractCegarLoop]: Abstraction has 6055 states and 9082 transitions. [2019-10-07 14:07:43,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 14:07:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 9082 transitions. [2019-10-07 14:07:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 14:07:43,745 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:43,746 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:43,746 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:43,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash 475221456, now seen corresponding path program 1 times [2019-10-07 14:07:43,749 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:43,749 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:43,750 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:43,752 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:07:44,105 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:44,105 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:44,106 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:07:44,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:07:44,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:07:44,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:07:44,108 INFO L87 Difference]: Start difference. First operand 6055 states and 9082 transitions. Second operand 9 states. [2019-10-07 14:07:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:49,047 INFO L93 Difference]: Finished difference Result 15367 states and 23044 transitions. [2019-10-07 14:07:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 14:07:49,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2019-10-07 14:07:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:49,106 INFO L225 Difference]: With dead ends: 15367 [2019-10-07 14:07:49,106 INFO L226 Difference]: Without dead ends: 9371 [2019-10-07 14:07:49,138 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-07 14:07:49,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9371 states. [2019-10-07 14:07:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9371 to 9020. [2019-10-07 14:07:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9020 states. [2019-10-07 14:07:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 13521 transitions. [2019-10-07 14:07:49,654 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 13521 transitions. Word has length 140 [2019-10-07 14:07:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:49,654 INFO L462 AbstractCegarLoop]: Abstraction has 9020 states and 13521 transitions. [2019-10-07 14:07:49,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:07:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 13521 transitions. [2019-10-07 14:07:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 14:07:49,658 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:49,659 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:49,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:49,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1881722021, now seen corresponding path program 1 times [2019-10-07 14:07:49,660 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:49,660 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:49,660 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:49,660 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:49,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:07:49,874 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:49,874 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:49,875 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:07:49,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:07:49,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:07:49,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:07:49,877 INFO L87 Difference]: Start difference. First operand 9020 states and 13521 transitions. Second operand 7 states. [2019-10-07 14:07:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:50,263 INFO L93 Difference]: Finished difference Result 16976 states and 25588 transitions. [2019-10-07 14:07:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:07:50,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-07 14:07:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:50,332 INFO L225 Difference]: With dead ends: 16976 [2019-10-07 14:07:50,332 INFO L226 Difference]: Without dead ends: 9320 [2019-10-07 14:07:50,368 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:07:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2019-10-07 14:07:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 9192. [2019-10-07 14:07:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9192 states. [2019-10-07 14:07:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9192 states to 9192 states and 13761 transitions. [2019-10-07 14:07:50,955 INFO L78 Accepts]: Start accepts. Automaton has 9192 states and 13761 transitions. Word has length 145 [2019-10-07 14:07:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:50,958 INFO L462 AbstractCegarLoop]: Abstraction has 9192 states and 13761 transitions. [2019-10-07 14:07:50,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:07:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 9192 states and 13761 transitions. [2019-10-07 14:07:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-07 14:07:50,962 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:50,962 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:50,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1532329598, now seen corresponding path program 1 times [2019-10-07 14:07:50,963 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:50,963 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:50,964 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:50,964 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:07:51,189 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:51,189 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:51,189 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:07:51,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:07:51,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:07:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:07:51,191 INFO L87 Difference]: Start difference. First operand 9192 states and 13761 transitions. Second operand 7 states. [2019-10-07 14:07:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:51,598 INFO L93 Difference]: Finished difference Result 17252 states and 25948 transitions. [2019-10-07 14:07:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:07:51,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-07 14:07:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:51,646 INFO L225 Difference]: With dead ends: 17252 [2019-10-07 14:07:51,646 INFO L226 Difference]: Without dead ends: 9452 [2019-10-07 14:07:51,677 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:07:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2019-10-07 14:07:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 9212. [2019-10-07 14:07:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9212 states. [2019-10-07 14:07:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9212 states to 9212 states and 13781 transitions. [2019-10-07 14:07:53,091 INFO L78 Accepts]: Start accepts. Automaton has 9212 states and 13781 transitions. Word has length 144 [2019-10-07 14:07:53,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:53,095 INFO L462 AbstractCegarLoop]: Abstraction has 9212 states and 13781 transitions. [2019-10-07 14:07:53,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:07:53,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9212 states and 13781 transitions. [2019-10-07 14:07:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 14:07:53,102 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:53,102 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:53,103 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:53,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:53,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1207760517, now seen corresponding path program 1 times [2019-10-07 14:07:53,104 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:53,104 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:53,104 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:53,104 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:07:53,389 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:53,389 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:53,389 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:07:53,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:07:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:07:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:07:53,394 INFO L87 Difference]: Start difference. First operand 9212 states and 13781 transitions. Second operand 7 states. [2019-10-07 14:07:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:07:53,735 INFO L93 Difference]: Finished difference Result 17244 states and 25916 transitions. [2019-10-07 14:07:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:07:53,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-07 14:07:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:07:53,793 INFO L225 Difference]: With dead ends: 17244 [2019-10-07 14:07:53,793 INFO L226 Difference]: Without dead ends: 9428 [2019-10-07 14:07:53,815 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:07:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9428 states. [2019-10-07 14:07:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9428 to 9196. [2019-10-07 14:07:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9196 states. [2019-10-07 14:07:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9196 states to 9196 states and 13745 transitions. [2019-10-07 14:07:54,198 INFO L78 Accepts]: Start accepts. Automaton has 9196 states and 13745 transitions. Word has length 145 [2019-10-07 14:07:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:07:54,199 INFO L462 AbstractCegarLoop]: Abstraction has 9196 states and 13745 transitions. [2019-10-07 14:07:54,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:07:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9196 states and 13745 transitions. [2019-10-07 14:07:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-07 14:07:54,203 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:07:54,203 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:07:54,203 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:07:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:07:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1286370673, now seen corresponding path program 1 times [2019-10-07 14:07:54,204 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:07:54,204 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:54,204 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:54,204 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:07:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:07:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:07:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:07:54,400 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:07:54,401 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:07:54,401 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:07:54,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:07:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:07:54,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:07:54,402 INFO L87 Difference]: Start difference. First operand 9196 states and 13745 transitions. Second operand 6 states. [2019-10-07 14:08:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:08:00,178 INFO L93 Difference]: Finished difference Result 28555 states and 43953 transitions. [2019-10-07 14:08:00,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 14:08:00,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-07 14:08:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:08:00,274 INFO L225 Difference]: With dead ends: 28555 [2019-10-07 14:08:00,274 INFO L226 Difference]: Without dead ends: 19418 [2019-10-07 14:08:00,307 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:08:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19418 states. [2019-10-07 14:08:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19418 to 18384. [2019-10-07 14:08:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18384 states. [2019-10-07 14:08:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18384 states to 18384 states and 27703 transitions. [2019-10-07 14:08:01,084 INFO L78 Accepts]: Start accepts. Automaton has 18384 states and 27703 transitions. Word has length 152 [2019-10-07 14:08:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:08:01,085 INFO L462 AbstractCegarLoop]: Abstraction has 18384 states and 27703 transitions. [2019-10-07 14:08:01,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:08:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18384 states and 27703 transitions. [2019-10-07 14:08:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-07 14:08:01,090 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:08:01,091 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:08:01,091 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:08:01,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:08:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1172590938, now seen corresponding path program 1 times [2019-10-07 14:08:01,092 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:08:01,092 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:01,092 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:01,092 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:08:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 14:08:01,292 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:01,292 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:08:01,292 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 14:08:01,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:08:01,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:08:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:08:01,294 INFO L87 Difference]: Start difference. First operand 18384 states and 27703 transitions. Second operand 7 states. [2019-10-07 14:08:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:08:05,087 INFO L93 Difference]: Finished difference Result 34690 states and 52503 transitions. [2019-10-07 14:08:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 14:08:05,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-07 14:08:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:08:05,181 INFO L225 Difference]: With dead ends: 34690 [2019-10-07 14:08:05,182 INFO L226 Difference]: Without dead ends: 19015 [2019-10-07 14:08:05,233 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-07 14:08:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19015 states. [2019-10-07 14:08:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19015 to 18656. [2019-10-07 14:08:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18656 states. [2019-10-07 14:08:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18656 states to 18656 states and 28063 transitions. [2019-10-07 14:08:06,140 INFO L78 Accepts]: Start accepts. Automaton has 18656 states and 28063 transitions. Word has length 153 [2019-10-07 14:08:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:08:06,140 INFO L462 AbstractCegarLoop]: Abstraction has 18656 states and 28063 transitions. [2019-10-07 14:08:06,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:08:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18656 states and 28063 transitions. [2019-10-07 14:08:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-07 14:08:06,145 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:08:06,145 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:08:06,145 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:08:06,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:08:06,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1584527016, now seen corresponding path program 1 times [2019-10-07 14:08:06,146 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:08:06,146 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:06,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:06,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:08:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 14:08:06,305 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:06,306 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:08:06,306 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:08:06,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:08:06,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:08:06,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:08:06,307 INFO L87 Difference]: Start difference. First operand 18656 states and 28063 transitions. Second operand 4 states. [2019-10-07 14:08:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:08:07,247 INFO L93 Difference]: Finished difference Result 37411 states and 57971 transitions. [2019-10-07 14:08:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 14:08:07,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-07 14:08:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:08:07,326 INFO L225 Difference]: With dead ends: 37411 [2019-10-07 14:08:07,326 INFO L226 Difference]: Without dead ends: 20816 [2019-10-07 14:08:07,374 INFO L606 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-07 14:08:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20816 states. [2019-10-07 14:08:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20816 to 20816. [2019-10-07 14:08:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20816 states. [2019-10-07 14:08:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20816 states to 20816 states and 31585 transitions. [2019-10-07 14:08:08,525 INFO L78 Accepts]: Start accepts. Automaton has 20816 states and 31585 transitions. Word has length 158 [2019-10-07 14:08:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:08:08,526 INFO L462 AbstractCegarLoop]: Abstraction has 20816 states and 31585 transitions. [2019-10-07 14:08:08,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:08:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20816 states and 31585 transitions. [2019-10-07 14:08:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 14:08:08,533 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:08:08,533 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:08:08,533 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:08:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:08:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash -24851321, now seen corresponding path program 1 times [2019-10-07 14:08:08,534 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:08:08,535 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:08,535 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:08,536 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:08:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 14:08:08,826 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:08,827 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:08:08,827 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:08:08,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:08:08,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:08:08,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:08:08,829 INFO L87 Difference]: Start difference. First operand 20816 states and 31585 transitions. Second operand 6 states. [2019-10-07 14:08:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:08:11,304 INFO L93 Difference]: Finished difference Result 20933 states and 31799 transitions. [2019-10-07 14:08:11,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 14:08:11,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2019-10-07 14:08:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:08:11,383 INFO L225 Difference]: With dead ends: 20933 [2019-10-07 14:08:11,383 INFO L226 Difference]: Without dead ends: 20910 [2019-10-07 14:08:11,396 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:08:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20910 states. [2019-10-07 14:08:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20910 to 20830. [2019-10-07 14:08:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20830 states. [2019-10-07 14:08:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20830 states to 20830 states and 31599 transitions. [2019-10-07 14:08:12,202 INFO L78 Accepts]: Start accepts. Automaton has 20830 states and 31599 transitions. Word has length 157 [2019-10-07 14:08:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:08:12,203 INFO L462 AbstractCegarLoop]: Abstraction has 20830 states and 31599 transitions. [2019-10-07 14:08:12,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:08:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20830 states and 31599 transitions. [2019-10-07 14:08:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-07 14:08:12,206 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:08:12,206 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:08:12,207 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:08:12,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:08:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1162841282, now seen corresponding path program 1 times [2019-10-07 14:08:12,207 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:08:12,207 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:12,208 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:12,208 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:08:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 14:08:12,423 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:12,423 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:08:12,424 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:08:12,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:08:12,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:08:12,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:08:12,425 INFO L87 Difference]: Start difference. First operand 20830 states and 31599 transitions. Second operand 9 states. [2019-10-07 14:08:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:08:13,907 INFO L93 Difference]: Finished difference Result 21808 states and 32987 transitions. [2019-10-07 14:08:13,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 14:08:13,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-10-07 14:08:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:08:13,972 INFO L225 Difference]: With dead ends: 21808 [2019-10-07 14:08:13,972 INFO L226 Difference]: Without dead ends: 21785 [2019-10-07 14:08:13,983 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-07 14:08:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21785 states. [2019-10-07 14:08:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21785 to 21342. [2019-10-07 14:08:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21342 states. [2019-10-07 14:08:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21342 states to 21342 states and 32277 transitions. [2019-10-07 14:08:14,649 INFO L78 Accepts]: Start accepts. Automaton has 21342 states and 32277 transitions. Word has length 162 [2019-10-07 14:08:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:08:14,650 INFO L462 AbstractCegarLoop]: Abstraction has 21342 states and 32277 transitions. [2019-10-07 14:08:14,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:08:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21342 states and 32277 transitions. [2019-10-07 14:08:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-07 14:08:14,654 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:08:14,654 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 14:08:14,655 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:08:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:08:14,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1265216713, now seen corresponding path program 1 times [2019-10-07 14:08:14,655 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:08:14,655 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:14,656 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:14,656 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:14,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:08:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 14:08:15,997 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:15,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:08:15,998 INFO L95 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-07 14:08:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:16,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 3582 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 14:08:16,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:08:17,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:08:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 14:08:17,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:08:17,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:08:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 14:08:17,916 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 14:08:17,917 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [33] total 38 [2019-10-07 14:08:17,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 14:08:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 14:08:17,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 14:08:17,918 INFO L87 Difference]: Start difference. First operand 21342 states and 32277 transitions. Second operand 7 states. [2019-10-07 14:08:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:08:19,049 INFO L93 Difference]: Finished difference Result 21587 states and 32618 transitions. [2019-10-07 14:08:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 14:08:19,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2019-10-07 14:08:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:08:19,176 INFO L225 Difference]: With dead ends: 21587 [2019-10-07 14:08:19,176 INFO L226 Difference]: Without dead ends: 21564 [2019-10-07 14:08:19,200 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 365 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2019-10-07 14:08:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21564 states. [2019-10-07 14:08:20,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21564 to 21518. [2019-10-07 14:08:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21518 states. [2019-10-07 14:08:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21518 states to 21518 states and 32461 transitions. [2019-10-07 14:08:20,933 INFO L78 Accepts]: Start accepts. Automaton has 21518 states and 32461 transitions. Word has length 178 [2019-10-07 14:08:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:08:20,933 INFO L462 AbstractCegarLoop]: Abstraction has 21518 states and 32461 transitions. [2019-10-07 14:08:20,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 14:08:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 21518 states and 32461 transitions. [2019-10-07 14:08:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-07 14:08:20,939 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:08:20,940 INFO L385 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 14:08:21,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:08:21,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:08:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:08:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1474951164, now seen corresponding path program 1 times [2019-10-07 14:08:21,150 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:08:21,150 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:21,150 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:21,150 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:08:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:08:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 14:08:21,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:08:21,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:08:21,540 INFO L95 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-07 14:08:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:08:22,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 3645 conjuncts, 135 conjunts are in the unsatisfiable core [2019-10-07 14:08:22,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:08:22,673 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-07 14:08:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-07 14:08:23,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:08:23,939 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:08:24,230 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:09:13,229 WARN L191 SmtUtils]: Spent 48.48 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:09:14,091 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:09:14,354 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:09:59,980 WARN L191 SmtUtils]: Spent 45.19 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:10:00,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:10:01,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:10:01,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:10:01,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:10:01,784 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:10:02,044 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:10:47,382 WARN L191 SmtUtils]: Spent 44.87 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:11:33,520 WARN L191 SmtUtils]: Spent 45.02 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:11:34,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:11:34,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:11:34,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:11:34,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:11:34,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:11:34,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:12:19,489 WARN L191 SmtUtils]: Spent 44.89 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:12:19,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:12:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:12:19,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:12:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:12:19,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:12:19,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:12:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,186 WARN L191 SmtUtils]: Spent 44.91 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:13:05,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:13:05,599 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:13:05,856 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:13:06,149 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:13:06,400 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:13:51,515 WARN L191 SmtUtils]: Spent 44.71 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:14:37,841 WARN L191 SmtUtils]: Spent 45.24 s on a formula simplification. DAG size of input: 1452 DAG size of output: 55 [2019-10-07 14:14:38,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:14:38,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:14:38,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:14:38,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:14:38,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:14:38,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:23,478 WARN L191 SmtUtils]: Spent 44.60 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:15:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:23,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:15:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,165 WARN L191 SmtUtils]: Spent 46.95 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:16:11,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:16:11,630 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:16:11,903 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:16:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-07 14:16:12,021 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 14:16:12,021 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [12, 15] total 47 [2019-10-07 14:16:12,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 14:16:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 14:16:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1968, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 14:16:12,023 INFO L87 Difference]: Start difference. First operand 21518 states and 32461 transitions. Second operand 25 states. [2019-10-07 14:16:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:16:24,683 INFO L93 Difference]: Finished difference Result 38546 states and 58761 transitions. [2019-10-07 14:16:24,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 14:16:24,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 200 [2019-10-07 14:16:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:16:24,782 INFO L225 Difference]: With dead ends: 38546 [2019-10-07 14:16:24,783 INFO L226 Difference]: Without dead ends: 17086 [2019-10-07 14:16:24,839 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 358 SyntacticMatches, 13 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=466, Invalid=3694, Unknown=0, NotChecked=0, Total=4160 [2019-10-07 14:16:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17086 states. [2019-10-07 14:16:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17086 to 16837. [2019-10-07 14:16:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16837 states. [2019-10-07 14:16:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16837 states to 16837 states and 25788 transitions. [2019-10-07 14:16:25,677 INFO L78 Accepts]: Start accepts. Automaton has 16837 states and 25788 transitions. Word has length 200 [2019-10-07 14:16:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:16:25,678 INFO L462 AbstractCegarLoop]: Abstraction has 16837 states and 25788 transitions. [2019-10-07 14:16:25,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 14:16:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16837 states and 25788 transitions. [2019-10-07 14:16:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-07 14:16:25,683 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:16:25,683 INFO L385 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 14:16:25,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:16:25,892 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:16:25,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:16:25,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1761800262, now seen corresponding path program 1 times [2019-10-07 14:16:25,893 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:16:25,893 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:16:25,893 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:16:25,893 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:16:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:16:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:16:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-07 14:16:26,151 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:16:26,152 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:16:26,152 INFO L95 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-07 14:16:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:16:27,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 3648 conjuncts, 107 conjunts are in the unsatisfiable core [2019-10-07 14:16:27,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:16:27,261 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-07 14:16:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-07 14:16:28,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:16:28,361 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:16:28,634 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 13 [2019-10-07 14:17:17,403 WARN L191 SmtUtils]: Spent 48.32 s on a formula simplification. DAG size of input: 1441 DAG size of output: 51 [2019-10-07 14:17:17,973 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:17:18,244 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12 [2019-10-07 14:18:07,014 WARN L191 SmtUtils]: Spent 48.35 s on a formula simplification. DAG size of input: 1445 DAG size of output: 55 [2019-10-07 14:18:07,957 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:18:08,573 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:18:08,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:09,063 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:18:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:09,510 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:18:09,958 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 13 [2019-10-07 14:18:10,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 14:18:10,496 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-07 14:18:10,761 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 12