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 -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:39:36,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:39:36,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:39:36,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:39:36,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:39:36,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:39:36,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:39:36,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:39:36,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:39:36,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:39:36,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:39:36,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:39:36,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:39:36,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:39:36,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:39:36,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:39:36,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:39:36,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:39:36,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:39:36,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:39:36,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:39:36,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:39:36,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:39:36,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:39:36,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:39:36,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:39:36,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:39:36,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:39:36,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:39:36,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:39:36,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:39:36,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:39:36,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:39:36,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:39:36,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:39:36,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:39:36,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:39:36,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:39:36,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:39:36,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:39:36,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:39:36,536 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-09-08 03:39:36,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:39:36,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:39:36,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:39:36,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:39:36,563 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:39:36,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:39:36,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:39:36,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:39:36,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:39:36,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:39:36,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:39:36,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:39:36,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:39:36,566 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:39:36,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:39:36,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:39:36,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:39:36,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:39:36,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:39:36,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:39:36,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:39:36,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:39:36,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:39:36,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:39:36,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:39:36,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:39:36,568 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:39:36,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:39:36,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:39:36,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:39:36,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:39:36,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:39:36,645 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:39:36,646 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:39:36,646 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-09-08 03:39:36,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c678ce27/4521b04bcb624faba7f1f1a35808b7db/FLAGb0cbc7876 [2019-09-08 03:39:37,322 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:39:37,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-09-08 03:39:37,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c678ce27/4521b04bcb624faba7f1f1a35808b7db/FLAGb0cbc7876 [2019-09-08 03:39:37,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c678ce27/4521b04bcb624faba7f1f1a35808b7db [2019-09-08 03:39:37,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:39:37,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:39:37,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:39:37,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:39:37,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:39:37,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:39:37" (1/1) ... [2019-09-08 03:39:37,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3810eea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:37, skipping insertion in model container [2019-09-08 03:39:37,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:39:37" (1/1) ... [2019-09-08 03:39:37,527 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:39:37,603 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:39:38,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:39:38,353 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:39:38,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:39:38,626 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:39:38,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38 WrapperNode [2019-09-08 03:39:38,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:39:38,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:39:38,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:39:38,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:39:38,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (1/1) ... [2019-09-08 03:39:38,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (1/1) ... [2019-09-08 03:39:38,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (1/1) ... [2019-09-08 03:39:38,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (1/1) ... [2019-09-08 03:39:38,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (1/1) ... [2019-09-08 03:39:38,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (1/1) ... [2019-09-08 03:39:38,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (1/1) ... [2019-09-08 03:39:38,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:39:38,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:39:38,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:39:38,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:39:38,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (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-09-08 03:39:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:39:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:39:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:39:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:39:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:39:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:39:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:39:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:39:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:39:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:39:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:39:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:39:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:39:38,966 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:39:38,967 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:39:38,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:39:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:39:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:39:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:39:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:39:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:39:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:39:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:39:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:39:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:39:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:39:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:39:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:39:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:39:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:39:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:39:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:39:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:39:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:39:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:39:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:39:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:39:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:39:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:39:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:39:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:39:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:39:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:39:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:39:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:39:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:39:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:39:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:39:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:39:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:39:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:39:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:39:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:39:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:39:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:39:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:39:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:39:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:39:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:39:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:39:38,976 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:39:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:39:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:39:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:39:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:39:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:39:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:39:38,977 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:39:38,978 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:39:38,978 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:39:38,978 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:39:38,978 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:39:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:39:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:39:38,979 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:39:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:39:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:39:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:39:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:39:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:39:38,980 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:39:38,981 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:39:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:39:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:39:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:39:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:39:38,983 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:39:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:39:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:39:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:39:38,984 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:39:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:39:38,985 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:39:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:39:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:39:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:39:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:39:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:39:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:39:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:39:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:39:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:39:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:39:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:39:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:39:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:39:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:39:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:39:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:39:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:39:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:39:38,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:39:38,990 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:39:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:39:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:39:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:39:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:39:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:39:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:39:38,997 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:39:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:39:39,001 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:39:39,002 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:39:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:39:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:39:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:39:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:39:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:39:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:39:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:39:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:39:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:39:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:39:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:39:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:39:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:39:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:39:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:39:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:39:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:39:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:39:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:39:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:39:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:39:41,208 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:39:41,208 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:39:41,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:39:41 BoogieIcfgContainer [2019-09-08 03:39:41,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:39:41,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:39:41,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:39:41,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:39:41,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:39:37" (1/3) ... [2019-09-08 03:39:41,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440417b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:39:41, skipping insertion in model container [2019-09-08 03:39:41,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:39:38" (2/3) ... [2019-09-08 03:39:41,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440417b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:39:41, skipping insertion in model container [2019-09-08 03:39:41,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:39:41" (3/3) ... [2019-09-08 03:39:41,221 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product19.cil.c [2019-09-08 03:39:41,232 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:39:41,242 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:39:41,258 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:39:41,305 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:39:41,305 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:39:41,305 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:39:41,306 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:39:41,306 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:39:41,306 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:39:41,306 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:39:41,306 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:39:41,306 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:39:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states. [2019-09-08 03:39:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 03:39:41,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:41,374 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:41,376 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:41,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:41,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1411507135, now seen corresponding path program 1 times [2019-09-08 03:39:41,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:41,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:41,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:42,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:42,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:39:42,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:39:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:39:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:39:42,048 INFO L87 Difference]: Start difference. First operand 735 states. Second operand 4 states. [2019-09-08 03:39:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:42,311 INFO L93 Difference]: Finished difference Result 1168 states and 1874 transitions. [2019-09-08 03:39:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:39:42,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 03:39:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:42,339 INFO L225 Difference]: With dead ends: 1168 [2019-09-08 03:39:42,340 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 03:39:42,354 INFO L628 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-09-08 03:39:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 03:39:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-08 03:39:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 03:39:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 928 transitions. [2019-09-08 03:39:42,555 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 928 transitions. Word has length 135 [2019-09-08 03:39:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:42,556 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 928 transitions. [2019-09-08 03:39:42,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:39:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 928 transitions. [2019-09-08 03:39:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:39:42,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:42,572 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:42,574 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1349279833, now seen corresponding path program 1 times [2019-09-08 03:39:42,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:42,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:42,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:42,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:42,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:42,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:39:42,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:39:42,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:39:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:39:42,824 INFO L87 Difference]: Start difference. First operand 587 states and 928 transitions. Second operand 4 states. [2019-09-08 03:39:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:42,927 INFO L93 Difference]: Finished difference Result 1141 states and 1817 transitions. [2019-09-08 03:39:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:39:42,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 03:39:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:42,934 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 03:39:42,935 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 03:39:42,939 INFO L628 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-09-08 03:39:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 03:39:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-08 03:39:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 03:39:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 927 transitions. [2019-09-08 03:39:42,972 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 927 transitions. Word has length 136 [2019-09-08 03:39:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:42,972 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 927 transitions. [2019-09-08 03:39:42,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:39:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 927 transitions. [2019-09-08 03:39:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 03:39:42,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:42,978 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:42,978 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1382966461, now seen corresponding path program 1 times [2019-09-08 03:39:42,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:42,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:42,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:42,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:43,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:43,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:39:43,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:39:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:39:43,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:39:43,121 INFO L87 Difference]: Start difference. First operand 587 states and 927 transitions. Second operand 4 states. [2019-09-08 03:39:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:43,222 INFO L93 Difference]: Finished difference Result 1141 states and 1816 transitions. [2019-09-08 03:39:43,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:39:43,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-08 03:39:43,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:43,231 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 03:39:43,231 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 03:39:43,235 INFO L628 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-09-08 03:39:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 03:39:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-08 03:39:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 03:39:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 926 transitions. [2019-09-08 03:39:43,274 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 926 transitions. Word has length 137 [2019-09-08 03:39:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:43,274 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 926 transitions. [2019-09-08 03:39:43,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:39:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 926 transitions. [2019-09-08 03:39:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:39:43,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:43,279 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:43,279 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1519078827, now seen corresponding path program 1 times [2019-09-08 03:39:43,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:43,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:43,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:43,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:43,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:43,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:39:43,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:39:43,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:39:43,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:39:43,466 INFO L87 Difference]: Start difference. First operand 587 states and 926 transitions. Second operand 4 states. [2019-09-08 03:39:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:43,561 INFO L93 Difference]: Finished difference Result 1141 states and 1815 transitions. [2019-09-08 03:39:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:39:43,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 03:39:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:43,567 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 03:39:43,567 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 03:39:43,571 INFO L628 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-09-08 03:39:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 03:39:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-08 03:39:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 03:39:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 925 transitions. [2019-09-08 03:39:43,600 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 925 transitions. Word has length 138 [2019-09-08 03:39:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:43,600 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 925 transitions. [2019-09-08 03:39:43,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:39:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 925 transitions. [2019-09-08 03:39:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 03:39:43,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:43,606 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:43,606 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash -939532999, now seen corresponding path program 1 times [2019-09-08 03:39:43,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:43,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:43,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:43,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:39:43,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:39:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:39:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:39:43,748 INFO L87 Difference]: Start difference. First operand 587 states and 925 transitions. Second operand 4 states. [2019-09-08 03:39:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:43,816 INFO L93 Difference]: Finished difference Result 1141 states and 1814 transitions. [2019-09-08 03:39:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:39:43,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-08 03:39:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:43,822 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 03:39:43,823 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 03:39:43,826 INFO L628 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-09-08 03:39:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 03:39:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-08 03:39:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 03:39:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 924 transitions. [2019-09-08 03:39:43,850 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 924 transitions. Word has length 139 [2019-09-08 03:39:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:43,850 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 924 transitions. [2019-09-08 03:39:43,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:39:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 924 transitions. [2019-09-08 03:39:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:39:43,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:43,855 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:43,855 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 195155025, now seen corresponding path program 1 times [2019-09-08 03:39:43,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:43,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:43,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:44,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:44,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:39:44,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:39:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:39:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:39:44,023 INFO L87 Difference]: Start difference. First operand 587 states and 924 transitions. Second operand 10 states. [2019-09-08 03:39:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:44,254 INFO L93 Difference]: Finished difference Result 1146 states and 1821 transitions. [2019-09-08 03:39:44,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:39:44,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 03:39:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:44,263 INFO L225 Difference]: With dead ends: 1146 [2019-09-08 03:39:44,264 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 03:39:44,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:39:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 03:39:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2019-09-08 03:39:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-09-08 03:39:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 934 transitions. [2019-09-08 03:39:44,312 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 934 transitions. Word has length 140 [2019-09-08 03:39:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:44,312 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 934 transitions. [2019-09-08 03:39:44,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:39:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 934 transitions. [2019-09-08 03:39:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:39:44,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:44,318 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:44,318 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:44,319 INFO L82 PathProgramCache]: Analyzing trace with hash -791427664, now seen corresponding path program 1 times [2019-09-08 03:39:44,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:44,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:44,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:44,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:44,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:39:44,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:39:44,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:39:44,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:39:44,574 INFO L87 Difference]: Start difference. First operand 594 states and 934 transitions. Second operand 4 states. [2019-09-08 03:39:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:44,661 INFO L93 Difference]: Finished difference Result 1147 states and 1822 transitions. [2019-09-08 03:39:44,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:39:44,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 03:39:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:44,667 INFO L225 Difference]: With dead ends: 1147 [2019-09-08 03:39:44,668 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:39:44,672 INFO L628 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-09-08 03:39:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:39:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:39:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:39:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-09-08 03:39:44,708 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 140 [2019-09-08 03:39:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:44,708 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-09-08 03:39:44,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:39:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-09-08 03:39:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 03:39:44,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:44,715 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:44,716 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:44,717 INFO L82 PathProgramCache]: Analyzing trace with hash -306965809, now seen corresponding path program 1 times [2019-09-08 03:39:44,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:44,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:44,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:39:44,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:39:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:39:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:39:44,897 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-09-08 03:39:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:45,209 INFO L93 Difference]: Finished difference Result 1160 states and 1846 transitions. [2019-09-08 03:39:45,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:39:45,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 03:39:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:45,215 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 03:39:45,216 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 03:39:45,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:39:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 03:39:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2019-09-08 03:39:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 03:39:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 928 transitions. [2019-09-08 03:39:45,245 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 928 transitions. Word has length 141 [2019-09-08 03:39:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:45,245 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 928 transitions. [2019-09-08 03:39:45,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:39:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 928 transitions. [2019-09-08 03:39:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 03:39:45,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:45,249 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:45,250 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:45,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:45,250 INFO L82 PathProgramCache]: Analyzing trace with hash 394745588, now seen corresponding path program 1 times [2019-09-08 03:39:45,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:45,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:45,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:45,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:45,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:39:45,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:39:45,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:39:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:39:45,466 INFO L87 Difference]: Start difference. First operand 595 states and 928 transitions. Second operand 6 states. [2019-09-08 03:39:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:45,719 INFO L93 Difference]: Finished difference Result 1123 states and 1761 transitions. [2019-09-08 03:39:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:39:45,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 03:39:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:45,726 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 03:39:45,726 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 03:39:45,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:39:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 03:39:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 03:39:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 03:39:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 924 transitions. [2019-09-08 03:39:45,754 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 924 transitions. Word has length 142 [2019-09-08 03:39:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:45,754 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 924 transitions. [2019-09-08 03:39:45,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:39:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 924 transitions. [2019-09-08 03:39:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:39:45,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:45,759 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:45,759 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:45,760 INFO L82 PathProgramCache]: Analyzing trace with hash -447409932, now seen corresponding path program 1 times [2019-09-08 03:39:45,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:45,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:45,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:45,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:45,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:45,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:45,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:39:45,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:39:45,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:39:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:39:45,902 INFO L87 Difference]: Start difference. First operand 595 states and 924 transitions. Second operand 6 states. [2019-09-08 03:39:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:46,114 INFO L93 Difference]: Finished difference Result 1123 states and 1757 transitions. [2019-09-08 03:39:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:39:46,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 03:39:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:46,120 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 03:39:46,121 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 03:39:46,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:39:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 03:39:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 03:39:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 03:39:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 920 transitions. [2019-09-08 03:39:46,149 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 920 transitions. Word has length 143 [2019-09-08 03:39:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:46,150 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 920 transitions. [2019-09-08 03:39:46,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:39:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 920 transitions. [2019-09-08 03:39:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:39:46,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:46,155 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:46,155 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:46,156 INFO L82 PathProgramCache]: Analyzing trace with hash -170078860, now seen corresponding path program 1 times [2019-09-08 03:39:46,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:46,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:46,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:46,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:46,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:46,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:46,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:39:46,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:39:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:39:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:39:46,280 INFO L87 Difference]: Start difference. First operand 595 states and 920 transitions. Second operand 7 states. [2019-09-08 03:39:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:46,390 INFO L93 Difference]: Finished difference Result 1126 states and 1757 transitions. [2019-09-08 03:39:46,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:39:46,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 03:39:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:46,396 INFO L225 Difference]: With dead ends: 1126 [2019-09-08 03:39:46,396 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 03:39:46,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:39:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 03:39:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-09-08 03:39:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-08 03:39:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 883 transitions. [2019-09-08 03:39:46,422 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 883 transitions. Word has length 143 [2019-09-08 03:39:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:46,423 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 883 transitions. [2019-09-08 03:39:46,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:39:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 883 transitions. [2019-09-08 03:39:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 03:39:46,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:46,428 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:46,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1904799623, now seen corresponding path program 1 times [2019-09-08 03:39:46,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:46,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:46,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:46,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:46,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:39:46,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:39:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:39:46,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:39:46,572 INFO L87 Difference]: Start difference. First operand 574 states and 883 transitions. Second operand 6 states. [2019-09-08 03:39:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:46,752 INFO L93 Difference]: Finished difference Result 1102 states and 1716 transitions. [2019-09-08 03:39:46,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:39:46,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 03:39:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:46,757 INFO L225 Difference]: With dead ends: 1102 [2019-09-08 03:39:46,757 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 03:39:46,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:39:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 03:39:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-08 03:39:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-08 03:39:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-09-08 03:39:46,783 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 144 [2019-09-08 03:39:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:46,784 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-09-08 03:39:46,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:39:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-09-08 03:39:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 03:39:46,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:46,788 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:46,788 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash -959612135, now seen corresponding path program 1 times [2019-09-08 03:39:46,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:46,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:46,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:39:46,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:39:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:39:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:39:46,918 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 6 states. [2019-09-08 03:39:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:47,044 INFO L93 Difference]: Finished difference Result 1102 states and 1715 transitions. [2019-09-08 03:39:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:39:47,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 03:39:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:47,049 INFO L225 Difference]: With dead ends: 1102 [2019-09-08 03:39:47,050 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 03:39:47,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:39:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 03:39:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-08 03:39:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-08 03:39:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 881 transitions. [2019-09-08 03:39:47,075 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 881 transitions. Word has length 145 [2019-09-08 03:39:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:47,076 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 881 transitions. [2019-09-08 03:39:47,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:39:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 881 transitions. [2019-09-08 03:39:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:39:47,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:47,080 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:47,080 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1451023870, now seen corresponding path program 1 times [2019-09-08 03:39:47,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:47,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:47,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:47,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:39:47,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:47,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:39:47,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:39:47,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:39:47,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:39:47,333 INFO L87 Difference]: Start difference. First operand 574 states and 881 transitions. Second operand 12 states. [2019-09-08 03:39:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:47,705 INFO L93 Difference]: Finished difference Result 1108 states and 1725 transitions. [2019-09-08 03:39:47,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:39:47,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-08 03:39:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:47,713 INFO L225 Difference]: With dead ends: 1108 [2019-09-08 03:39:47,714 INFO L226 Difference]: Without dead ends: 581 [2019-09-08 03:39:47,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:39:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-09-08 03:39:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-09-08 03:39:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 03:39:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 887 transitions. [2019-09-08 03:39:47,751 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 887 transitions. Word has length 146 [2019-09-08 03:39:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:47,752 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 887 transitions. [2019-09-08 03:39:47,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:39:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 887 transitions. [2019-09-08 03:39:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 03:39:47,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:47,757 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:47,758 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash 457980586, now seen corresponding path program 1 times [2019-09-08 03:39:47,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:47,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:47,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:47,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:39:48,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:39:48,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:39:48,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:39:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:48,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:39:48,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:39:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:39:48,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:39:48,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:39:48,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:39:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:39:48,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:39:48,663 INFO L87 Difference]: Start difference. First operand 579 states and 887 transitions. Second operand 13 states. [2019-09-08 03:39:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:59,414 INFO L93 Difference]: Finished difference Result 1689 states and 2724 transitions. [2019-09-08 03:39:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:39:59,415 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-09-08 03:39:59,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:59,424 INFO L225 Difference]: With dead ends: 1689 [2019-09-08 03:39:59,424 INFO L226 Difference]: Without dead ends: 1163 [2019-09-08 03:39:59,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:39:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-09-08 03:39:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1146. [2019-09-08 03:39:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-09-08 03:39:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1818 transitions. [2019-09-08 03:39:59,490 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1818 transitions. Word has length 147 [2019-09-08 03:39:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:59,491 INFO L475 AbstractCegarLoop]: Abstraction has 1146 states and 1818 transitions. [2019-09-08 03:39:59,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:39:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1818 transitions. [2019-09-08 03:39:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:39:59,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:59,495 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09-08 03:39:59,496 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:59,496 INFO L82 PathProgramCache]: Analyzing trace with hash -182206803, now seen corresponding path program 1 times [2019-09-08 03:39:59,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:59,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:59,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:39:59,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:39:59,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 03:39:59,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 03:39:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 03:39:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:39:59,607 INFO L87 Difference]: Start difference. First operand 1146 states and 1818 transitions. Second operand 3 states. [2019-09-08 03:39:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:39:59,670 INFO L93 Difference]: Finished difference Result 2555 states and 4023 transitions. [2019-09-08 03:39:59,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 03:39:59,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 03:39:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:39:59,682 INFO L225 Difference]: With dead ends: 2555 [2019-09-08 03:39:59,683 INFO L226 Difference]: Without dead ends: 1462 [2019-09-08 03:39:59,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-09-08 03:39:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-09-08 03:39:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1459. [2019-09-08 03:39:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-09-08 03:39:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2251 transitions. [2019-09-08 03:39:59,759 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2251 transitions. Word has length 156 [2019-09-08 03:39:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:39:59,760 INFO L475 AbstractCegarLoop]: Abstraction has 1459 states and 2251 transitions. [2019-09-08 03:39:59,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 03:39:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2251 transitions. [2019-09-08 03:39:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 03:39:59,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:39:59,764 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:39:59,765 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:39:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:39:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2009666179, now seen corresponding path program 1 times [2019-09-08 03:39:59,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:39:59,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:39:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:59,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:39:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:39:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:39:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:39:59,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:39:59,918 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:39:59,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:00,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 2636 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:40:00,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:40:00,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:00,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:40:00,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:40:00,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:40:00,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:40:00,495 INFO L87 Difference]: Start difference. First operand 1459 states and 2251 transitions. Second operand 9 states. [2019-09-08 03:40:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:02,291 INFO L93 Difference]: Finished difference Result 2889 states and 4585 transitions. [2019-09-08 03:40:02,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:40:02,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 153 [2019-09-08 03:40:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:02,304 INFO L225 Difference]: With dead ends: 2889 [2019-09-08 03:40:02,304 INFO L226 Difference]: Without dead ends: 1475 [2019-09-08 03:40:02,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:40:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-09-08 03:40:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2019-09-08 03:40:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-09-08 03:40:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2245 transitions. [2019-09-08 03:40:02,397 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2245 transitions. Word has length 153 [2019-09-08 03:40:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:02,398 INFO L475 AbstractCegarLoop]: Abstraction has 1475 states and 2245 transitions. [2019-09-08 03:40:02,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:40:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2245 transitions. [2019-09-08 03:40:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 03:40:02,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:02,404 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:02,404 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:02,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash -663483851, now seen corresponding path program 1 times [2019-09-08 03:40:02,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:02,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:02,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:02,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:02,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:40:02,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:02,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:40:02,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:02,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:40:02,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:40:03,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:03,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:40:03,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:40:03,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:40:03,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:40:03,097 INFO L87 Difference]: Start difference. First operand 1475 states and 2245 transitions. Second operand 13 states. [2019-09-08 03:40:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:13,568 INFO L93 Difference]: Finished difference Result 4663 states and 7394 transitions. [2019-09-08 03:40:13,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:40:13,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2019-09-08 03:40:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:13,591 INFO L225 Difference]: With dead ends: 4663 [2019-09-08 03:40:13,591 INFO L226 Difference]: Without dead ends: 3241 [2019-09-08 03:40:13,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:40:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2019-09-08 03:40:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3170. [2019-09-08 03:40:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2019-09-08 03:40:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4916 transitions. [2019-09-08 03:40:13,755 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4916 transitions. Word has length 155 [2019-09-08 03:40:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:13,755 INFO L475 AbstractCegarLoop]: Abstraction has 3170 states and 4916 transitions. [2019-09-08 03:40:13,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:40:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4916 transitions. [2019-09-08 03:40:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:40:13,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:13,763 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:13,763 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 110325351, now seen corresponding path program 1 times [2019-09-08 03:40:13,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:13,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:13,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:13,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:40:13,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:13,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:40:14,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:14,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:40:14,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:40:14,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:14,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:40:14,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:40:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:40:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:40:14,480 INFO L87 Difference]: Start difference. First operand 3170 states and 4916 transitions. Second operand 13 states. [2019-09-08 03:40:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:24,336 INFO L93 Difference]: Finished difference Result 9084 states and 14476 transitions. [2019-09-08 03:40:24,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:40:24,337 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 156 [2019-09-08 03:40:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:24,389 INFO L225 Difference]: With dead ends: 9084 [2019-09-08 03:40:24,389 INFO L226 Difference]: Without dead ends: 5973 [2019-09-08 03:40:24,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:40:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2019-09-08 03:40:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5821. [2019-09-08 03:40:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5821 states. [2019-09-08 03:40:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5821 states to 5821 states and 9090 transitions. [2019-09-08 03:40:24,851 INFO L78 Accepts]: Start accepts. Automaton has 5821 states and 9090 transitions. Word has length 156 [2019-09-08 03:40:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:24,851 INFO L475 AbstractCegarLoop]: Abstraction has 5821 states and 9090 transitions. [2019-09-08 03:40:24,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:40:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5821 states and 9090 transitions. [2019-09-08 03:40:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:40:24,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:24,863 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09-08 03:40:24,864 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:24,864 INFO L82 PathProgramCache]: Analyzing trace with hash 323480309, now seen corresponding path program 1 times [2019-09-08 03:40:24,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:24,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:24,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:24,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:40:25,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:25,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:25,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:25,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 03:40:25,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:40:25,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:25,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:40:25,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:40:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:40:25,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:40:25,526 INFO L87 Difference]: Start difference. First operand 5821 states and 9090 transitions. Second operand 13 states. [2019-09-08 03:40:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:42,172 INFO L93 Difference]: Finished difference Result 24470 states and 39169 transitions. [2019-09-08 03:40:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:40:42,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-09-08 03:40:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:42,306 INFO L225 Difference]: With dead ends: 24470 [2019-09-08 03:40:42,307 INFO L226 Difference]: Without dead ends: 18714 [2019-09-08 03:40:42,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 03:40:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18714 states. [2019-09-08 03:40:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18714 to 18071. [2019-09-08 03:40:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18071 states. [2019-09-08 03:40:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18071 states to 18071 states and 28462 transitions. [2019-09-08 03:40:44,137 INFO L78 Accepts]: Start accepts. Automaton has 18071 states and 28462 transitions. Word has length 159 [2019-09-08 03:40:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:44,138 INFO L475 AbstractCegarLoop]: Abstraction has 18071 states and 28462 transitions. [2019-09-08 03:40:44,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:40:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 18071 states and 28462 transitions. [2019-09-08 03:40:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 03:40:44,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:44,154 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:44,154 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1813497107, now seen corresponding path program 1 times [2019-09-08 03:40:44,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:44,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:44,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:44,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:44,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:40:44,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:44,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:40:44,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:40:44,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:40:44,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:40:44,340 INFO L87 Difference]: Start difference. First operand 18071 states and 28462 transitions. Second operand 9 states. [2019-09-08 03:40:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:44,943 INFO L93 Difference]: Finished difference Result 25465 states and 39949 transitions. [2019-09-08 03:40:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:40:44,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 03:40:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:44,994 INFO L225 Difference]: With dead ends: 25465 [2019-09-08 03:40:44,994 INFO L226 Difference]: Without dead ends: 7441 [2019-09-08 03:40:45,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:40:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states. [2019-09-08 03:40:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 7433. [2019-09-08 03:40:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7433 states. [2019-09-08 03:40:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 11512 transitions. [2019-09-08 03:40:45,371 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 11512 transitions. Word has length 167 [2019-09-08 03:40:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:45,373 INFO L475 AbstractCegarLoop]: Abstraction has 7433 states and 11512 transitions. [2019-09-08 03:40:45,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:40:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 11512 transitions. [2019-09-08 03:40:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:40:45,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:45,381 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:45,381 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1281235935, now seen corresponding path program 1 times [2019-09-08 03:40:45,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:45,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:45,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:45,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:45,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:40:45,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:45,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:45,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:45,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:40:45,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:40:46,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:46,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 03:40:46,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:40:46,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:40:46,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:40:46,084 INFO L87 Difference]: Start difference. First operand 7433 states and 11512 transitions. Second operand 9 states. [2019-09-08 03:40:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:57,145 INFO L93 Difference]: Finished difference Result 18791 states and 29623 transitions. [2019-09-08 03:40:57,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 03:40:57,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-09-08 03:40:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:57,201 INFO L225 Difference]: With dead ends: 18791 [2019-09-08 03:40:57,201 INFO L226 Difference]: Without dead ends: 11411 [2019-09-08 03:40:57,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:40:57,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11411 states. [2019-09-08 03:40:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11411 to 7497. [2019-09-08 03:40:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7497 states. [2019-09-08 03:40:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7497 states to 7497 states and 11607 transitions. [2019-09-08 03:40:57,589 INFO L78 Accepts]: Start accepts. Automaton has 7497 states and 11607 transitions. Word has length 170 [2019-09-08 03:40:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:57,590 INFO L475 AbstractCegarLoop]: Abstraction has 7497 states and 11607 transitions. [2019-09-08 03:40:57,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:40:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 7497 states and 11607 transitions. [2019-09-08 03:40:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 03:40:57,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:57,595 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:57,595 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1801988446, now seen corresponding path program 1 times [2019-09-08 03:40:57,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:57,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:57,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:40:57,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:57,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:57,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:58,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:40:58,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:40:58,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:58,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:40:58,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:40:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:40:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:40:58,186 INFO L87 Difference]: Start difference. First operand 7497 states and 11607 transitions. Second operand 9 states. [2019-09-08 03:41:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:03,141 INFO L93 Difference]: Finished difference Result 35453 states and 55878 transitions. [2019-09-08 03:41:03,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:41:03,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 171 [2019-09-08 03:41:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:03,330 INFO L225 Difference]: With dead ends: 35453 [2019-09-08 03:41:03,331 INFO L226 Difference]: Without dead ends: 27529 [2019-09-08 03:41:03,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-09-08 03:41:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27529 states. [2019-09-08 03:41:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27529 to 27239. [2019-09-08 03:41:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27239 states. [2019-09-08 03:41:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27239 states to 27239 states and 41711 transitions. [2019-09-08 03:41:04,749 INFO L78 Accepts]: Start accepts. Automaton has 27239 states and 41711 transitions. Word has length 171 [2019-09-08 03:41:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:04,749 INFO L475 AbstractCegarLoop]: Abstraction has 27239 states and 41711 transitions. [2019-09-08 03:41:04,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:41:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27239 states and 41711 transitions. [2019-09-08 03:41:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 03:41:04,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:04,753 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:04,753 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:04,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:04,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1998234462, now seen corresponding path program 1 times [2019-09-08 03:41:04,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:04,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:04,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:41:04,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:04,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:41:04,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:41:04,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:41:04,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:41:04,872 INFO L87 Difference]: Start difference. First operand 27239 states and 41711 transitions. Second operand 7 states. [2019-09-08 03:41:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:08,645 INFO L93 Difference]: Finished difference Result 80320 states and 126508 transitions. [2019-09-08 03:41:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:41:08,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2019-09-08 03:41:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:09,012 INFO L225 Difference]: With dead ends: 80320 [2019-09-08 03:41:09,012 INFO L226 Difference]: Without dead ends: 53014 [2019-09-08 03:41:09,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:41:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53014 states. [2019-09-08 03:41:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53014 to 52611. [2019-09-08 03:41:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52611 states. [2019-09-08 03:41:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52611 states to 52611 states and 81327 transitions. [2019-09-08 03:41:13,108 INFO L78 Accepts]: Start accepts. Automaton has 52611 states and 81327 transitions. Word has length 177 [2019-09-08 03:41:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:13,109 INFO L475 AbstractCegarLoop]: Abstraction has 52611 states and 81327 transitions. [2019-09-08 03:41:13,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:41:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 52611 states and 81327 transitions. [2019-09-08 03:41:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 03:41:13,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:13,113 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:13,113 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:13,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:13,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1087490595, now seen corresponding path program 1 times [2019-09-08 03:41:13,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:13,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:13,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:13,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:13,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:41:13,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:13,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:13,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:13,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 03:41:13,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:41:13,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:41:13,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2019-09-08 03:41:13,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:41:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:41:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:41:13,760 INFO L87 Difference]: Start difference. First operand 52611 states and 81327 transitions. Second operand 15 states. [2019-09-08 03:41:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:22,662 INFO L93 Difference]: Finished difference Result 101579 states and 158169 transitions. [2019-09-08 03:41:22,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:41:22,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 177 [2019-09-08 03:41:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:23,046 INFO L225 Difference]: With dead ends: 101579 [2019-09-08 03:41:23,046 INFO L226 Difference]: Without dead ends: 53246 [2019-09-08 03:41:23,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:41:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53246 states. [2019-09-08 03:41:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53246 to 52469. [2019-09-08 03:41:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52469 states. [2019-09-08 03:41:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52469 states to 52469 states and 81097 transitions. [2019-09-08 03:41:25,677 INFO L78 Accepts]: Start accepts. Automaton has 52469 states and 81097 transitions. Word has length 177 [2019-09-08 03:41:25,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:25,678 INFO L475 AbstractCegarLoop]: Abstraction has 52469 states and 81097 transitions. [2019-09-08 03:41:25,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:41:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 52469 states and 81097 transitions. [2019-09-08 03:41:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 03:41:25,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:25,681 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:25,681 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:25,682 INFO L82 PathProgramCache]: Analyzing trace with hash 538033342, now seen corresponding path program 1 times [2019-09-08 03:41:25,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:25,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:25,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:41:25,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:25,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:41:25,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:41:25,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:41:25,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:41:25,814 INFO L87 Difference]: Start difference. First operand 52469 states and 81097 transitions. Second operand 7 states. [2019-09-08 03:41:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:29,211 INFO L93 Difference]: Finished difference Result 101113 states and 156979 transitions. [2019-09-08 03:41:29,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:41:29,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-09-08 03:41:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:29,602 INFO L225 Difference]: With dead ends: 101113 [2019-09-08 03:41:29,602 INFO L226 Difference]: Without dead ends: 52922 [2019-09-08 03:41:29,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:41:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52922 states. [2019-09-08 03:41:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52922 to 52669. [2019-09-08 03:41:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52669 states. [2019-09-08 03:41:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52669 states to 52669 states and 81407 transitions. [2019-09-08 03:41:31,987 INFO L78 Accepts]: Start accepts. Automaton has 52669 states and 81407 transitions. Word has length 179 [2019-09-08 03:41:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:31,987 INFO L475 AbstractCegarLoop]: Abstraction has 52669 states and 81407 transitions. [2019-09-08 03:41:31,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:41:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52669 states and 81407 transitions. [2019-09-08 03:41:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:41:31,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:31,992 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:31,992 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash 630850636, now seen corresponding path program 1 times [2019-09-08 03:41:31,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:31,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:31,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:41:32,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:32,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:41:32,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:41:32,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:41:32,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:41:32,130 INFO L87 Difference]: Start difference. First operand 52669 states and 81407 transitions. Second operand 7 states. [2019-09-08 03:41:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:34,304 INFO L93 Difference]: Finished difference Result 101790 states and 159068 transitions. [2019-09-08 03:41:34,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:41:34,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-09-08 03:41:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:34,558 INFO L225 Difference]: With dead ends: 101790 [2019-09-08 03:41:34,558 INFO L226 Difference]: Without dead ends: 53399 [2019-09-08 03:41:34,711 INFO L628 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-09-08 03:41:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53399 states. [2019-09-08 03:41:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53399 to 53203. [2019-09-08 03:41:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53203 states. [2019-09-08 03:41:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53203 states to 53203 states and 82403 transitions. [2019-09-08 03:41:37,160 INFO L78 Accepts]: Start accepts. Automaton has 53203 states and 82403 transitions. Word has length 184 [2019-09-08 03:41:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:37,160 INFO L475 AbstractCegarLoop]: Abstraction has 53203 states and 82403 transitions. [2019-09-08 03:41:37,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:41:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53203 states and 82403 transitions. [2019-09-08 03:41:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 03:41:37,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:37,164 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:37,164 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1225047642, now seen corresponding path program 1 times [2019-09-08 03:41:37,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:37,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:37,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:37,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:41:37,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:37,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:41:37,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:41:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:41:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:41:37,302 INFO L87 Difference]: Start difference. First operand 53203 states and 82403 transitions. Second operand 9 states. [2019-09-08 03:41:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:41,770 INFO L93 Difference]: Finished difference Result 105038 states and 165255 transitions. [2019-09-08 03:41:41,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:41:41,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-08 03:41:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:41,995 INFO L225 Difference]: With dead ends: 105038 [2019-09-08 03:41:41,995 INFO L226 Difference]: Without dead ends: 53203 [2019-09-08 03:41:42,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:41:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53203 states. [2019-09-08 03:41:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53203 to 53203. [2019-09-08 03:41:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53203 states. [2019-09-08 03:41:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53203 states to 53203 states and 81983 transitions. [2019-09-08 03:41:44,120 INFO L78 Accepts]: Start accepts. Automaton has 53203 states and 81983 transitions. Word has length 191 [2019-09-08 03:41:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:44,120 INFO L475 AbstractCegarLoop]: Abstraction has 53203 states and 81983 transitions. [2019-09-08 03:41:44,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:41:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 53203 states and 81983 transitions. [2019-09-08 03:41:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 03:41:44,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:44,124 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:44,124 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -205864527, now seen corresponding path program 1 times [2019-09-08 03:41:44,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:44,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 03:41:44,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:44,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:41:44,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:41:44,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:41:44,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:41:44,270 INFO L87 Difference]: Start difference. First operand 53203 states and 81983 transitions. Second operand 9 states. [2019-09-08 03:41:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:51,389 INFO L93 Difference]: Finished difference Result 105395 states and 165713 transitions. [2019-09-08 03:41:51,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:41:51,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2019-09-08 03:41:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:51,560 INFO L225 Difference]: With dead ends: 105395 [2019-09-08 03:41:51,560 INFO L226 Difference]: Without dead ends: 17684 [2019-09-08 03:41:51,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:41:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17684 states. [2019-09-08 03:41:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17684 to 17330. [2019-09-08 03:41:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17330 states. [2019-09-08 03:41:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17330 states to 17330 states and 26102 transitions. [2019-09-08 03:41:55,257 INFO L78 Accepts]: Start accepts. Automaton has 17330 states and 26102 transitions. Word has length 196 [2019-09-08 03:41:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:55,258 INFO L475 AbstractCegarLoop]: Abstraction has 17330 states and 26102 transitions. [2019-09-08 03:41:55,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:41:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17330 states and 26102 transitions. [2019-09-08 03:41:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2019-09-08 03:41:55,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:55,286 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:41:55,286 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:55,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2047495714, now seen corresponding path program 1 times [2019-09-08 03:41:55,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:55,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:55,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:55,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 31 proven. 30 refuted. 0 times theorem prover too weak. 1285 trivial. 0 not checked. [2019-09-08 03:41:55,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:55,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:55,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:56,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 5625 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:41:56,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 976 trivial. 0 not checked. [2019-09-08 03:41:56,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:41:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:41:56,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:41:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:41:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:41:56,573 INFO L87 Difference]: Start difference. First operand 17330 states and 26102 transitions. Second operand 9 states. [2019-09-08 03:41:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:57,534 INFO L93 Difference]: Finished difference Result 35259 states and 53795 transitions. [2019-09-08 03:41:57,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:41:57,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 616 [2019-09-08 03:41:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:57,587 INFO L225 Difference]: With dead ends: 35259 [2019-09-08 03:41:57,588 INFO L226 Difference]: Without dead ends: 18698 [2019-09-08 03:41:57,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:41:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18698 states. [2019-09-08 03:41:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18698 to 18698. [2019-09-08 03:41:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18698 states. [2019-09-08 03:41:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18698 states to 18698 states and 28419 transitions. [2019-09-08 03:41:58,097 INFO L78 Accepts]: Start accepts. Automaton has 18698 states and 28419 transitions. Word has length 616 [2019-09-08 03:41:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:58,097 INFO L475 AbstractCegarLoop]: Abstraction has 18698 states and 28419 transitions. [2019-09-08 03:41:58,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:41:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 18698 states and 28419 transitions. [2019-09-08 03:41:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-09-08 03:41:58,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:58,120 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:41:58,120 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1202213004, now seen corresponding path program 1 times [2019-09-08 03:41:58,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:58,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:58,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 32 proven. 45 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2019-09-08 03:41:58,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:58,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:58,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:59,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 5637 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:41:59,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 418 proven. 372 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2019-09-08 03:41:59,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:41:59,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:41:59,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:41:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:41:59,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:41:59,721 INFO L87 Difference]: Start difference. First operand 18698 states and 28419 transitions. Second operand 15 states. [2019-09-08 03:42:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:18,887 INFO L93 Difference]: Finished difference Result 66517 states and 107935 transitions. [2019-09-08 03:42:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 03:42:18,888 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 628 [2019-09-08 03:42:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:19,082 INFO L225 Difference]: With dead ends: 66517 [2019-09-08 03:42:19,082 INFO L226 Difference]: Without dead ends: 47398 [2019-09-08 03:42:19,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 649 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=546, Invalid=2316, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 03:42:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47398 states. [2019-09-08 03:42:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47398 to 43173. [2019-09-08 03:42:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43173 states. [2019-09-08 03:42:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43173 states to 43173 states and 66250 transitions. [2019-09-08 03:42:20,759 INFO L78 Accepts]: Start accepts. Automaton has 43173 states and 66250 transitions. Word has length 628 [2019-09-08 03:42:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:20,760 INFO L475 AbstractCegarLoop]: Abstraction has 43173 states and 66250 transitions. [2019-09-08 03:42:20,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:42:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 43173 states and 66250 transitions. [2019-09-08 03:42:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2019-09-08 03:42:20,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:20,779 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 15, 14, 14, 14, 12, 12, 12, 12, 12, 11, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:42:20,779 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:20,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1432155544, now seen corresponding path program 1 times [2019-09-08 03:42:20,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:20,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 65 proven. 50 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2019-09-08 03:42:21,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:21,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:21,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:21,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 4801 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:42:21,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 1000 proven. 63 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2019-09-08 03:42:22,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:42:22,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:42:22,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:42:22,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:42:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:42:22,074 INFO L87 Difference]: Start difference. First operand 43173 states and 66250 transitions. Second operand 19 states. [2019-09-08 03:42:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:38,417 INFO L93 Difference]: Finished difference Result 128255 states and 200560 transitions. [2019-09-08 03:42:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:42:38,417 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 571 [2019-09-08 03:42:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:38,734 INFO L225 Difference]: With dead ends: 128255 [2019-09-08 03:42:38,735 INFO L226 Difference]: Without dead ends: 88500 [2019-09-08 03:42:38,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 03:42:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88500 states. [2019-09-08 03:42:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88500 to 87711. [2019-09-08 03:42:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87711 states. [2019-09-08 03:42:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87711 states to 87711 states and 137672 transitions. [2019-09-08 03:42:42,348 INFO L78 Accepts]: Start accepts. Automaton has 87711 states and 137672 transitions. Word has length 571 [2019-09-08 03:42:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:42,348 INFO L475 AbstractCegarLoop]: Abstraction has 87711 states and 137672 transitions. [2019-09-08 03:42:42,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:42:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 87711 states and 137672 transitions. [2019-09-08 03:42:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2019-09-08 03:42:42,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:42,396 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 16, 16, 16, 14, 14, 14, 14, 14, 12, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:42:42,397 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -36880997, now seen corresponding path program 1 times [2019-09-08 03:42:42,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:42,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 52 proven. 43 refuted. 0 times theorem prover too weak. 1933 trivial. 0 not checked. [2019-09-08 03:42:42,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:42,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:42:42,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:46,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 4994 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:42:46,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1178 proven. 72 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2019-09-08 03:42:47,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:42:47,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-09-08 03:42:47,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:42:47,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:42:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:42:47,022 INFO L87 Difference]: Start difference. First operand 87711 states and 137672 transitions. Second operand 15 states. [2019-09-08 03:43:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:05,261 INFO L93 Difference]: Finished difference Result 241493 states and 397514 transitions. [2019-09-08 03:43:05,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:43:05,262 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 643 [2019-09-08 03:43:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:09,554 INFO L225 Difference]: With dead ends: 241493 [2019-09-08 03:43:09,555 INFO L226 Difference]: Without dead ends: 161664 [2019-09-08 03:43:09,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:43:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161664 states. [2019-09-08 03:43:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161664 to 160135. [2019-09-08 03:43:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160135 states. [2019-09-08 03:43:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160135 states to 160135 states and 265045 transitions. [2019-09-08 03:43:21,299 INFO L78 Accepts]: Start accepts. Automaton has 160135 states and 265045 transitions. Word has length 643 [2019-09-08 03:43:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:21,300 INFO L475 AbstractCegarLoop]: Abstraction has 160135 states and 265045 transitions. [2019-09-08 03:43:21,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:43:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 160135 states and 265045 transitions. [2019-09-08 03:43:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-09-08 03:43:21,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:21,342 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 13, 13, 13, 13, 13, 13, 13, 13, 11, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:43:21,342 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:21,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash -151212391, now seen corresponding path program 1 times [2019-09-08 03:43:21,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 1634 trivial. 0 not checked. [2019-09-08 03:43:21,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:21,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:43:21,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:22,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 4864 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:43:22,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 913 proven. 0 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2019-09-08 03:43:22,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:22,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-08 03:43:22,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:43:22,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:43:22,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:43:22,495 INFO L87 Difference]: Start difference. First operand 160135 states and 265045 transitions. Second operand 11 states. [2019-09-08 03:43:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:35,939 INFO L93 Difference]: Finished difference Result 341922 states and 590771 transitions. [2019-09-08 03:43:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:43:35,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 587 [2019-09-08 03:43:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:36,771 INFO L225 Difference]: With dead ends: 341922 [2019-09-08 03:43:36,771 INFO L226 Difference]: Without dead ends: 183573 [2019-09-08 03:43:37,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 590 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:43:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183573 states. [2019-09-08 03:43:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183573 to 179800. [2019-09-08 03:43:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179800 states. [2019-09-08 03:43:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179800 states to 179800 states and 299039 transitions. [2019-09-08 03:43:53,759 INFO L78 Accepts]: Start accepts. Automaton has 179800 states and 299039 transitions. Word has length 587 [2019-09-08 03:43:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:53,760 INFO L475 AbstractCegarLoop]: Abstraction has 179800 states and 299039 transitions. [2019-09-08 03:43:53,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:43:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 179800 states and 299039 transitions. [2019-09-08 03:43:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-09-08 03:43:53,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:53,808 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 15, 15, 15, 15, 15, 14, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:43:53,809 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -421586879, now seen corresponding path program 1 times [2019-09-08 03:43:53,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:53,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:53,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2287 backedges. 39 proven. 53 refuted. 0 times theorem prover too weak. 2195 trivial. 0 not checked. [2019-09-08 03:43:54,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:54,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:54,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:54,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 5134 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:43:54,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2287 backedges. 652 proven. 53 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2019-09-08 03:43:56,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:43:56,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-09-08 03:43:56,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 03:43:56,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 03:43:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:43:56,303 INFO L87 Difference]: Start difference. First operand 179800 states and 299039 transitions. Second operand 16 states. [2019-09-08 03:44:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:20,996 INFO L93 Difference]: Finished difference Result 404367 states and 756137 transitions. [2019-09-08 03:44:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:44:20,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 684 [2019-09-08 03:44:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:30,483 INFO L225 Difference]: With dead ends: 404367 [2019-09-08 03:44:30,484 INFO L226 Difference]: Without dead ends: 224204 [2019-09-08 03:44:31,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:44:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224204 states. [2019-09-08 03:44:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224204 to 220456. [2019-09-08 03:44:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220456 states. [2019-09-08 03:44:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220456 states to 220456 states and 401144 transitions. [2019-09-08 03:44:49,336 INFO L78 Accepts]: Start accepts. Automaton has 220456 states and 401144 transitions. Word has length 684 [2019-09-08 03:44:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:49,337 INFO L475 AbstractCegarLoop]: Abstraction has 220456 states and 401144 transitions. [2019-09-08 03:44:49,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 03:44:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 220456 states and 401144 transitions. [2019-09-08 03:44:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2019-09-08 03:44:49,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:49,417 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 16, 16, 16, 14, 14, 14, 14, 14, 12, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:44:49,418 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:49,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:49,418 INFO L82 PathProgramCache]: Analyzing trace with hash 872405470, now seen corresponding path program 1 times [2019-09-08 03:44:49,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:49,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:49,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:49,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:49,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-09-08 03:44:50,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:50,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:50,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:51,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 4990 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:44:51,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 1132 proven. 0 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2019-09-08 03:44:51,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:51,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:44:51,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:44:51,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:44:51,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:44:51,549 INFO L87 Difference]: Start difference. First operand 220456 states and 401144 transitions. Second operand 14 states. [2019-09-08 03:45:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:25,468 INFO L93 Difference]: Finished difference Result 453289 states and 888712 transitions. [2019-09-08 03:45:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:45:25,469 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 644 [2019-09-08 03:45:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:27,317 INFO L225 Difference]: With dead ends: 453289 [2019-09-08 03:45:27,318 INFO L226 Difference]: Without dead ends: 218865 [2019-09-08 03:45:29,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 03:45:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218865 states. [2019-09-08 03:45:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218865 to 208149. [2019-09-08 03:45:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208149 states. [2019-09-08 03:45:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208149 states to 208149 states and 354353 transitions. [2019-09-08 03:45:52,071 INFO L78 Accepts]: Start accepts. Automaton has 208149 states and 354353 transitions. Word has length 644 [2019-09-08 03:45:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:52,072 INFO L475 AbstractCegarLoop]: Abstraction has 208149 states and 354353 transitions. [2019-09-08 03:45:52,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:45:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 208149 states and 354353 transitions. [2019-09-08 03:45:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-09-08 03:45:52,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:52,126 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 14, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:45:52,127 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:52,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2061322176, now seen corresponding path program 1 times [2019-09-08 03:45:52,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:52,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:52,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 64 proven. 72 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2019-09-08 03:45:53,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:53,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:45:53,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:54,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 4808 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 03:45:54,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 797 proven. 234 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2019-09-08 03:45:54,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:45:54,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-09-08 03:45:54,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 03:45:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 03:45:54,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:45:54,304 INFO L87 Difference]: Start difference. First operand 208149 states and 354353 transitions. Second operand 21 states. [2019-09-08 03:46:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:33,963 INFO L93 Difference]: Finished difference Result 651523 states and 1248184 transitions. [2019-09-08 03:46:33,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:46:33,963 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 574 [2019-09-08 03:46:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:37,535 INFO L225 Difference]: With dead ends: 651523 [2019-09-08 03:46:37,535 INFO L226 Difference]: Without dead ends: 444403 [2019-09-08 03:46:50,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:46:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444403 states. [2019-09-08 03:47:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444403 to 426080. [2019-09-08 03:47:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426080 states. [2019-09-08 03:47:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426080 states to 426080 states and 739359 transitions. [2019-09-08 03:47:24,184 INFO L78 Accepts]: Start accepts. Automaton has 426080 states and 739359 transitions. Word has length 574 [2019-09-08 03:47:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:24,185 INFO L475 AbstractCegarLoop]: Abstraction has 426080 states and 739359 transitions. [2019-09-08 03:47:24,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 03:47:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 426080 states and 739359 transitions. [2019-09-08 03:47:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-09-08 03:47:24,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:24,265 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 16, 15, 12, 12, 12, 12, 12, 12, 12, 11, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:47:24,265 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:24,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1164216641, now seen corresponding path program 1 times [2019-09-08 03:47:24,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:24,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:24,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 84 proven. 79 refuted. 0 times theorem prover too weak. 1509 trivial. 0 not checked. [2019-09-08 03:47:35,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:35,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:36,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 4821 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:47:36,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2019-09-08 03:47:36,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:47:36,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-08 03:47:36,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:47:36,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:47:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:47:36,289 INFO L87 Difference]: Start difference. First operand 426080 states and 739359 transitions. Second operand 8 states. [2019-09-08 03:48:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:23,882 INFO L93 Difference]: Finished difference Result 1005757 states and 1848970 transitions. [2019-09-08 03:48:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:48:23,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 582 [2019-09-08 03:48:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:27,621 INFO L225 Difference]: With dead ends: 1005757 [2019-09-08 03:48:27,621 INFO L226 Difference]: Without dead ends: 577407 [2019-09-08 03:48:32,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 588 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-09-08 03:48:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577407 states.