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_spec2_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:00:35,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:00:35,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:00:35,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:00:35,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:00:35,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:00:35,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:00:35,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:00:35,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:00:35,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:00:35,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:00:35,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:00:35,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:00:35,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:00:35,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:00:35,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:00:35,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:00:35,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:00:35,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:00:35,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:00:35,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:00:35,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:00:35,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:00:35,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:00:35,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:00:35,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:00:35,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:00:35,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:00:35,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:00:35,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:00:35,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:00:35,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:00:35,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:00:35,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:00:35,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:00:35,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:00:35,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:00:35,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:00:35,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:00:35,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:00:35,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:00:35,721 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 04:00:35,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:00:35,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:00:35,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:00:35,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:00:35,747 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:00:35,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:00:35,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:00:35,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:00:35,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:00:35,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:00:35,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:00:35,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:00:35,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:00:35,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:00:35,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:00:35,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:00:35,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:00:35,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:00:35,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:00:35,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:00:35,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:00:35,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:00:35,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:00:35,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:00:35,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:00:35,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:00:35,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:00:35,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:00:35,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:00:35,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:00:35,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:00:35,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:00:35,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:00:35,815 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:00:35,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-09-08 04:00:35,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2be6ff1/f6558427a8d74399a2475a7ecbb267c4/FLAG666ed1f2a [2019-09-08 04:00:36,521 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:00:36,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-09-08 04:00:36,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2be6ff1/f6558427a8d74399a2475a7ecbb267c4/FLAG666ed1f2a [2019-09-08 04:00:36,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2be6ff1/f6558427a8d74399a2475a7ecbb267c4 [2019-09-08 04:00:36,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:00:36,711 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:00:36,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:00:36,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:00:36,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:00:36,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:00:36" (1/1) ... [2019-09-08 04:00:36,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19027eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:36, skipping insertion in model container [2019-09-08 04:00:36,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:00:36" (1/1) ... [2019-09-08 04:00:36,726 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:00:36,805 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:00:37,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:00:37,539 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:00:37,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:00:37,748 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:00:37,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37 WrapperNode [2019-09-08 04:00:37,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:00:37,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:00:37,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:00:37,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:00:37,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (1/1) ... [2019-09-08 04:00:37,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (1/1) ... [2019-09-08 04:00:37,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (1/1) ... [2019-09-08 04:00:37,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (1/1) ... [2019-09-08 04:00:37,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (1/1) ... [2019-09-08 04:00:37,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (1/1) ... [2019-09-08 04:00:37,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (1/1) ... [2019-09-08 04:00:37,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:00:37,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:00:37,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:00:37,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:00:37,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (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 04:00:38,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:00:38,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:00:38,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:00:38,047 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:00:38,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:00:38,049 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:00:38,049 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:00:38,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:00:38,049 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:00:38,050 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:00:38,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:00:38,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:00:38,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:00:38,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:00:38,052 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:00:38,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:00:38,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:00:38,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:00:38,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:00:38,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:00:38,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:00:38,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:00:38,056 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:00:38,056 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:00:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:00:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:00:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:00:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:00:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:00:38,057 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:00:38,058 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:00:38,058 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:00:38,058 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:00:38,058 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:00:38,058 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:00:38,059 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:00:38,059 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:00:38,059 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:00:38,059 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:00:38,059 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:00:38,060 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:00:38,060 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:00:38,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:00:38,060 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:00:38,060 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:00:38,060 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:00:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:00:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:00:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:00:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:00:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:00:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:00:38,061 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:00:38,062 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:00:38,062 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:00:38,062 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:00:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:00:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-09-08 04:00:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:00:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:00:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:00:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-09-08 04:00:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:00:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:00:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:00:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:00:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:00:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:00:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:00:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:00:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:00:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:00:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:00:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:00:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:00:38,067 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:00:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:00:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:00:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:00:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:00:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:00:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:00:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:00:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:00:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:00:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:00:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:00:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:00:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:00:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:00:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:00:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:00:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:00:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:00:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:00:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:00:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:00:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:00:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:00:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:00:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:00:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:00:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:00:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:00:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:00:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:00:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:00:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:00:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:00:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:00:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:00:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:00:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:00:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:00:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:00:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:00:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:00:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:00:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:00:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:00:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:00:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:00:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:00:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:00:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:00:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:00:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:00:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:00:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:00:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:00:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:00:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:00:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:00:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:00:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:00:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:00:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:00:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:00:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:00:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:00:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:00:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:00:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:00:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:00:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:00:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:00:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-09-08 04:00:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:00:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:00:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-09-08 04:00:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:00:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:00:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:00:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:00:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:00:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:00:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:00:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:00:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:00:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:00:40,145 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:00:40,146 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:00:40,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:00:40 BoogieIcfgContainer [2019-09-08 04:00:40,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:00:40,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:00:40,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:00:40,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:00:40,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:00:36" (1/3) ... [2019-09-08 04:00:40,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678020ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:00:40, skipping insertion in model container [2019-09-08 04:00:40,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:00:37" (2/3) ... [2019-09-08 04:00:40,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678020ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:00:40, skipping insertion in model container [2019-09-08 04:00:40,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:00:40" (3/3) ... [2019-09-08 04:00:40,157 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product03.cil.c [2019-09-08 04:00:40,166 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:00:40,176 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:00:40,195 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:00:40,231 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:00:40,232 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:00:40,232 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:00:40,232 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:00:40,232 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:00:40,232 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:00:40,232 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:00:40,232 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:00:40,233 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:00:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-09-08 04:00:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 04:00:40,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:40,290 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:00:40,292 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:40,298 INFO L82 PathProgramCache]: Analyzing trace with hash 370351368, now seen corresponding path program 1 times [2019-09-08 04:00:40,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:40,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:40,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:40,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:40,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:00:40,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:00:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:00:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:00:40,907 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-09-08 04:00:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:41,088 INFO L93 Difference]: Finished difference Result 1161 states and 1887 transitions. [2019-09-08 04:00:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:00:41,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 04:00:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:41,125 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:00:41,126 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 04:00:41,138 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 04:00:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 04:00:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-08 04:00:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 04:00:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-09-08 04:00:41,274 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 133 [2019-09-08 04:00:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:41,275 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-09-08 04:00:41,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:00:41,275 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-09-08 04:00:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 04:00:41,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:41,293 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:00:41,293 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:41,294 INFO L82 PathProgramCache]: Analyzing trace with hash -743808276, now seen corresponding path program 1 times [2019-09-08 04:00:41,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:41,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:41,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:41,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:41,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:41,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:41,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:00:41,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:00:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:00:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:00:41,532 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-09-08 04:00:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:41,623 INFO L93 Difference]: Finished difference Result 1141 states and 1848 transitions. [2019-09-08 04:00:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:00:41,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 04:00:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:41,632 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 04:00:41,632 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 04:00:41,636 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 04:00:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 04:00:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-08 04:00:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 04:00:41,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-09-08 04:00:41,672 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 136 [2019-09-08 04:00:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:41,674 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-09-08 04:00:41,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:00:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-09-08 04:00:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 04:00:41,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:41,685 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:41,688 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1971987191, now seen corresponding path program 1 times [2019-09-08 04:00:41,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:41,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:41,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:41,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:41,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:41,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:00:41,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:00:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:00:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:00:41,902 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-09-08 04:00:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:41,978 INFO L93 Difference]: Finished difference Result 1141 states and 1847 transitions. [2019-09-08 04:00:41,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:00:41,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-08 04:00:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:41,985 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 04:00:41,985 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 04:00:41,987 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 04:00:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 04:00:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-08 04:00:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 04:00:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-09-08 04:00:42,037 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 137 [2019-09-08 04:00:42,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:42,037 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-09-08 04:00:42,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:00:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-09-08 04:00:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 04:00:42,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:42,044 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:00:42,044 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1254078520, now seen corresponding path program 1 times [2019-09-08 04:00:42,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:42,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:42,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:42,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:00:42,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:00:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:00:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:00:42,225 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-09-08 04:00:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:42,284 INFO L93 Difference]: Finished difference Result 1141 states and 1846 transitions. [2019-09-08 04:00:42,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:00:42,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 04:00:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:42,289 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 04:00:42,289 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 04:00:42,291 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 04:00:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 04:00:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-08 04:00:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 04:00:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-09-08 04:00:42,312 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 138 [2019-09-08 04:00:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:42,313 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-09-08 04:00:42,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:00:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-09-08 04:00:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 04:00:42,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:42,317 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:42,317 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash 300720275, now seen corresponding path program 1 times [2019-09-08 04:00:42,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:42,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:42,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:00:42,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:00:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:00:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:00:42,432 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-09-08 04:00:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:42,481 INFO L93 Difference]: Finished difference Result 1141 states and 1845 transitions. [2019-09-08 04:00:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:00:42,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-08 04:00:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:42,486 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 04:00:42,487 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 04:00:42,489 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 04:00:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 04:00:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-09-08 04:00:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-09-08 04:00:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-09-08 04:00:42,514 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 139 [2019-09-08 04:00:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:42,514 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-09-08 04:00:42,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:00:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-09-08 04:00:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:00:42,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:42,519 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:42,520 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash -261536604, now seen corresponding path program 1 times [2019-09-08 04:00:42,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:42,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:42,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:42,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:42,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:42,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:00:42,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:00:42,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:00:42,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:00:42,758 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-09-08 04:00:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:42,902 INFO L93 Difference]: Finished difference Result 1099 states and 1765 transitions. [2019-09-08 04:00:42,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:00:42,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 04:00:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:42,908 INFO L225 Difference]: With dead ends: 1099 [2019-09-08 04:00:42,908 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 04:00:42,910 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 04:00:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 04:00:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-09-08 04:00:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-09-08 04:00:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-09-08 04:00:42,935 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 140 [2019-09-08 04:00:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:42,936 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-09-08 04:00:42,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:00:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-09-08 04:00:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:00:42,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:42,941 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:42,941 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash 433110403, now seen corresponding path program 1 times [2019-09-08 04:00:42,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:43,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:43,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:00:43,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:00:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:00:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:00:43,043 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-09-08 04:00:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:43,093 INFO L93 Difference]: Finished difference Result 1147 states and 1851 transitions. [2019-09-08 04:00:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:00:43,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 04:00:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:43,099 INFO L225 Difference]: With dead ends: 1147 [2019-09-08 04:00:43,099 INFO L226 Difference]: Without dead ends: 583 [2019-09-08 04:00:43,103 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 04:00:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-08 04:00:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-08 04:00:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 04:00:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-09-08 04:00:43,124 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 140 [2019-09-08 04:00:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:43,124 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-09-08 04:00:43,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:00:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-09-08 04:00:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:00:43,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:43,129 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:43,130 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1772555127, now seen corresponding path program 1 times [2019-09-08 04:00:43,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:43,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:43,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:43,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:00:43,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:00:43,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:00:43,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:00:43,300 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-09-08 04:00:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:43,499 INFO L93 Difference]: Finished difference Result 1087 states and 1743 transitions. [2019-09-08 04:00:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:00:43,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 04:00:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:43,504 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 04:00:43,504 INFO L226 Difference]: Without dead ends: 583 [2019-09-08 04:00:43,507 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 04:00:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-08 04:00:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-08 04:00:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 04:00:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-09-08 04:00:43,527 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 141 [2019-09-08 04:00:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:43,528 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-09-08 04:00:43,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:00:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-09-08 04:00:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:00:43,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:43,533 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:43,533 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash -235226265, now seen corresponding path program 1 times [2019-09-08 04:00:43,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:43,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:43,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:43,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:43,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:00:43,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:00:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:00:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:00:43,663 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-09-08 04:00:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:43,846 INFO L93 Difference]: Finished difference Result 1087 states and 1739 transitions. [2019-09-08 04:00:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:00:43,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 04:00:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:43,852 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 04:00:43,852 INFO L226 Difference]: Without dead ends: 583 [2019-09-08 04:00:43,855 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 04:00:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-08 04:00:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-08 04:00:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 04:00:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-09-08 04:00:43,897 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 142 [2019-09-08 04:00:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:43,898 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-09-08 04:00:43,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:00:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-09-08 04:00:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:00:43,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:43,904 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:43,905 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1655770492, now seen corresponding path program 1 times [2019-09-08 04:00:43,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:43,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:43,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:43,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:43,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:44,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:44,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:00:44,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:00:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:00:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:00:44,044 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-09-08 04:00:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:44,217 INFO L93 Difference]: Finished difference Result 1087 states and 1735 transitions. [2019-09-08 04:00:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:00:44,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 04:00:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:44,224 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 04:00:44,224 INFO L226 Difference]: Without dead ends: 583 [2019-09-08 04:00:44,227 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 04:00:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-09-08 04:00:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-09-08 04:00:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-09-08 04:00:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-09-08 04:00:44,282 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 143 [2019-09-08 04:00:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:44,283 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-09-08 04:00:44,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:00:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-09-08 04:00:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:00:44,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:44,287 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:44,287 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:44,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1584723460, now seen corresponding path program 1 times [2019-09-08 04:00:44,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:44,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:44,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:44,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:44,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:00:44,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:00:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:00:44,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:00:44,422 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-09-08 04:00:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:44,510 INFO L93 Difference]: Finished difference Result 1087 states and 1731 transitions. [2019-09-08 04:00:44,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:00:44,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 04:00:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:44,516 INFO L225 Difference]: With dead ends: 1087 [2019-09-08 04:00:44,516 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:00:44,519 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 04:00:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:00:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:00:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:00:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-09-08 04:00:44,545 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 143 [2019-09-08 04:00:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:44,545 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-09-08 04:00:44,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:00:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-09-08 04:00:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:00:44,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:44,550 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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 04:00:44,550 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:44,550 INFO L82 PathProgramCache]: Analyzing trace with hash -145161716, now seen corresponding path program 1 times [2019-09-08 04:00:44,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:44,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:44,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:44,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:44,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:00:44,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:00:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:00:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:00:44,671 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-09-08 04:00:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:44,775 INFO L93 Difference]: Finished difference Result 1066 states and 1697 transitions. [2019-09-08 04:00:44,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:00:44,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 04:00:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:44,782 INFO L225 Difference]: With dead ends: 1066 [2019-09-08 04:00:44,782 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:00:44,786 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 04:00:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:00:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:00:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:00:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-09-08 04:00:44,808 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 144 [2019-09-08 04:00:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:44,809 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-09-08 04:00:44,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:00:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-09-08 04:00:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:00:44,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:44,814 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:44,814 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash -431774847, now seen corresponding path program 1 times [2019-09-08 04:00:44,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:44,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:44,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:44,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:00:44,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:00:44,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:00:44,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:00:44,930 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-09-08 04:00:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:45,018 INFO L93 Difference]: Finished difference Result 1066 states and 1696 transitions. [2019-09-08 04:00:45,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:00:45,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 04:00:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:45,023 INFO L225 Difference]: With dead ends: 1066 [2019-09-08 04:00:45,023 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:00:45,026 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 04:00:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:00:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:00:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:00:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-09-08 04:00:45,074 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 145 [2019-09-08 04:00:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:45,074 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-09-08 04:00:45,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:00:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-09-08 04:00:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 04:00:45,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:45,079 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:45,079 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1019136847, now seen corresponding path program 1 times [2019-09-08 04:00:45,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:45,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:45,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:45,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:00:45,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:45,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:00:45,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:00:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:00:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:00:45,262 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 12 states. [2019-09-08 04:00:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:45,445 INFO L93 Difference]: Finished difference Result 1067 states and 1695 transitions. [2019-09-08 04:00:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:00:45,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-08 04:00:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:45,450 INFO L225 Difference]: With dead ends: 1067 [2019-09-08 04:00:45,451 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:00:45,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:00:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:00:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:00:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:00:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-09-08 04:00:45,471 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 146 [2019-09-08 04:00:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:45,471 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-09-08 04:00:45,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:00:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-09-08 04:00:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 04:00:45,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:45,476 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:00:45,476 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:45,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1801631980, now seen corresponding path program 1 times [2019-09-08 04:00:45,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:45,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:45,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:45,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:00:45,610 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 04:00:45,635 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 04:00:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:46,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:00:46,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:00:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:46,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:00:46,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:00:46,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:00:46,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:00:46,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:00:46,176 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 9 states. [2019-09-08 04:00:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:47,333 INFO L93 Difference]: Finished difference Result 1062 states and 1715 transitions. [2019-09-08 04:00:47,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:00:47,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 147 [2019-09-08 04:00:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:47,339 INFO L225 Difference]: With dead ends: 1062 [2019-09-08 04:00:47,339 INFO L226 Difference]: Without dead ends: 566 [2019-09-08 04:00:47,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:00:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-09-08 04:00:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-09-08 04:00:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-08 04:00:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 882 transitions. [2019-09-08 04:00:47,374 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 882 transitions. Word has length 147 [2019-09-08 04:00:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:47,374 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 882 transitions. [2019-09-08 04:00:47,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:00:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 882 transitions. [2019-09-08 04:00:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 04:00:47,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:47,378 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:00:47,379 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash -550201376, now seen corresponding path program 1 times [2019-09-08 04:00:47,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:47,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:47,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:47,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:47,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:00:47,526 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) [2019-09-08 04:00:47,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:00:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:48,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:00:48,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:00:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:48,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:00:48,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:00:48,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:00:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:00:48,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:00:48,237 INFO L87 Difference]: Start difference. First operand 566 states and 882 transitions. Second operand 9 states. [2019-09-08 04:00:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:49,563 INFO L93 Difference]: Finished difference Result 1071 states and 1722 transitions. [2019-09-08 04:00:49,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:00:49,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-09-08 04:00:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:49,569 INFO L225 Difference]: With dead ends: 1071 [2019-09-08 04:00:49,569 INFO L226 Difference]: Without dead ends: 571 [2019-09-08 04:00:49,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:00:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-09-08 04:00:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-09-08 04:00:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-08 04:00:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 887 transitions. [2019-09-08 04:00:49,596 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 887 transitions. Word has length 149 [2019-09-08 04:00:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:49,597 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 887 transitions. [2019-09-08 04:00:49,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:00:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 887 transitions. [2019-09-08 04:00:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 04:00:49,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:49,601 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:49,601 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:49,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1423243564, now seen corresponding path program 1 times [2019-09-08 04:00:49,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:49,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:49,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:49,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:00:49,723 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 04:00:49,750 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 04:00:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:50,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:00:50,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:00:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:50,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:00:50,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:00:50,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:00:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:00:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:00:50,217 INFO L87 Difference]: Start difference. First operand 571 states and 887 transitions. Second operand 9 states. [2019-09-08 04:00:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:51,376 INFO L93 Difference]: Finished difference Result 1082 states and 1731 transitions. [2019-09-08 04:00:51,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:00:51,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-09-08 04:00:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:51,382 INFO L225 Difference]: With dead ends: 1082 [2019-09-08 04:00:51,382 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 04:00:51,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:00:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 04:00:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-08 04:00:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-08 04:00:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 893 transitions. [2019-09-08 04:00:51,404 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 893 transitions. Word has length 151 [2019-09-08 04:00:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:51,404 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 893 transitions. [2019-09-08 04:00:51,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:00:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 893 transitions. [2019-09-08 04:00:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 04:00:51,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:51,409 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:51,409 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1199296360, now seen corresponding path program 1 times [2019-09-08 04:00:51,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:51,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:51,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:51,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:51,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:00:51,527 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:00:51,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:51,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:00:51,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:00:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:00:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:00:51,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 04:00:51,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:00:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:00:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:00:51,988 INFO L87 Difference]: Start difference. First operand 577 states and 893 transitions. Second operand 9 states. [2019-09-08 04:00:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:53,169 INFO L93 Difference]: Finished difference Result 1095 states and 1742 transitions. [2019-09-08 04:00:53,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:00:53,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 153 [2019-09-08 04:00:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:53,175 INFO L225 Difference]: With dead ends: 1095 [2019-09-08 04:00:53,175 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 04:00:53,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:00:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 04:00:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-08 04:00:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 04:00:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 900 transitions. [2019-09-08 04:00:53,196 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 900 transitions. Word has length 153 [2019-09-08 04:00:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:53,197 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 900 transitions. [2019-09-08 04:00:53,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:00:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 900 transitions. [2019-09-08 04:00:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 04:00:53,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:53,201 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:53,202 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash 99391340, now seen corresponding path program 1 times [2019-09-08 04:00:53,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:53,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:53,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:53,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:00:53,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:00:53,361 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) [2019-09-08 04:00:53,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:00:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:53,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:00:53,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:00:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:00:54,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:00:54,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:00:54,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:00:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:00:54,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:00:54,099 INFO L87 Difference]: Start difference. First operand 584 states and 900 transitions. Second operand 14 states. [2019-09-08 04:01:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:04,765 INFO L93 Difference]: Finished difference Result 1748 states and 2770 transitions. [2019-09-08 04:01:04,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 04:01:04,765 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2019-09-08 04:01:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:04,774 INFO L225 Difference]: With dead ends: 1748 [2019-09-08 04:01:04,774 INFO L226 Difference]: Without dead ends: 1230 [2019-09-08 04:01:04,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 04:01:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-09-08 04:01:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1174. [2019-09-08 04:01:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-09-08 04:01:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1848 transitions. [2019-09-08 04:01:04,842 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1848 transitions. Word has length 155 [2019-09-08 04:01:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:04,842 INFO L475 AbstractCegarLoop]: Abstraction has 1174 states and 1848 transitions. [2019-09-08 04:01:04,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:01:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1848 transitions. [2019-09-08 04:01:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:01:04,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:04,850 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:01:04,851 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash -919909182, now seen corresponding path program 1 times [2019-09-08 04:01:04,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:04,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:01:05,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:05,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:01:05,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:01:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:01:05,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:01:05,005 INFO L87 Difference]: Start difference. First operand 1174 states and 1848 transitions. Second operand 9 states. [2019-09-08 04:01:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:05,123 INFO L93 Difference]: Finished difference Result 1699 states and 2680 transitions. [2019-09-08 04:01:05,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:01:05,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-09-08 04:01:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:05,128 INFO L225 Difference]: With dead ends: 1699 [2019-09-08 04:01:05,128 INFO L226 Difference]: Without dead ends: 579 [2019-09-08 04:01:05,134 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 04:01:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-08 04:01:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-09-08 04:01:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 04:01:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 887 transitions. [2019-09-08 04:01:05,160 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 887 transitions. Word has length 164 [2019-09-08 04:01:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:05,161 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 887 transitions. [2019-09-08 04:01:05,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:01:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 887 transitions. [2019-09-08 04:01:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:01:05,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:05,166 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:01:05,166 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:05,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1292072658, now seen corresponding path program 1 times [2019-09-08 04:01:05,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:05,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:05,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:05,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:05,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 04:01:05,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:01:05,329 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 04:01:05,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:05,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 2782 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:01:05,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:01:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:01:05,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:01:05,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 04:01:05,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:01:05,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:01:05,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:01:05,858 INFO L87 Difference]: Start difference. First operand 579 states and 887 transitions. Second operand 14 states. [2019-09-08 04:01:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:11,081 INFO L93 Difference]: Finished difference Result 1143 states and 1795 transitions. [2019-09-08 04:01:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:01:11,085 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 167 [2019-09-08 04:01:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:11,089 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 04:01:11,089 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 04:01:11,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:01:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 04:01:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 590. [2019-09-08 04:01:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 04:01:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 902 transitions. [2019-09-08 04:01:11,117 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 902 transitions. Word has length 167 [2019-09-08 04:01:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:11,118 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 902 transitions. [2019-09-08 04:01:11,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:01:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 902 transitions. [2019-09-08 04:01:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 04:01:11,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:11,122 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:01:11,122 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1839914348, now seen corresponding path program 1 times [2019-09-08 04:01:11,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:11,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:11,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:01:11,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:11,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:01:11,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:01:11,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:01:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:01:11,306 INFO L87 Difference]: Start difference. First operand 590 states and 902 transitions. Second operand 11 states. [2019-09-08 04:01:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:15,219 INFO L93 Difference]: Finished difference Result 1115 states and 1740 transitions. [2019-09-08 04:01:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:01:15,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2019-09-08 04:01:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:15,225 INFO L225 Difference]: With dead ends: 1115 [2019-09-08 04:01:15,225 INFO L226 Difference]: Without dead ends: 588 [2019-09-08 04:01:15,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:01:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-09-08 04:01:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2019-09-08 04:01:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-08 04:01:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 898 transitions. [2019-09-08 04:01:15,251 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 898 transitions. Word has length 174 [2019-09-08 04:01:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:15,251 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 898 transitions. [2019-09-08 04:01:15,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:01:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 898 transitions. [2019-09-08 04:01:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 04:01:15,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:15,255 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:15,255 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -136125593, now seen corresponding path program 1 times [2019-09-08 04:01:15,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:15,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:15,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:01:15,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:15,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:01:15,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:01:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:01:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:01:15,399 INFO L87 Difference]: Start difference. First operand 588 states and 898 transitions. Second operand 9 states. [2019-09-08 04:01:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:20,226 INFO L93 Difference]: Finished difference Result 1837 states and 2883 transitions. [2019-09-08 04:01:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:01:20,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2019-09-08 04:01:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:20,240 INFO L225 Difference]: With dead ends: 1837 [2019-09-08 04:01:20,240 INFO L226 Difference]: Without dead ends: 1312 [2019-09-08 04:01:20,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:01:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-09-08 04:01:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1268. [2019-09-08 04:01:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-09-08 04:01:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1976 transitions. [2019-09-08 04:01:20,302 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1976 transitions. Word has length 176 [2019-09-08 04:01:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:20,303 INFO L475 AbstractCegarLoop]: Abstraction has 1268 states and 1976 transitions. [2019-09-08 04:01:20,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:01:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1976 transitions. [2019-09-08 04:01:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 04:01:20,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:20,306 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:20,307 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2123027222, now seen corresponding path program 1 times [2019-09-08 04:01:20,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:20,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:20,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:20,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:20,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:01:20,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:20,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:01:20,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:01:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:01:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:01:20,428 INFO L87 Difference]: Start difference. First operand 1268 states and 1976 transitions. Second operand 7 states. [2019-09-08 04:01:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:20,530 INFO L93 Difference]: Finished difference Result 2516 states and 3949 transitions. [2019-09-08 04:01:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:01:20,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-09-08 04:01:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:20,543 INFO L225 Difference]: With dead ends: 2516 [2019-09-08 04:01:20,543 INFO L226 Difference]: Without dead ends: 1311 [2019-09-08 04:01:20,549 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 04:01:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-09-08 04:01:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1289. [2019-09-08 04:01:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2019-09-08 04:01:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2000 transitions. [2019-09-08 04:01:20,629 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2000 transitions. Word has length 181 [2019-09-08 04:01:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:20,629 INFO L475 AbstractCegarLoop]: Abstraction has 1289 states and 2000 transitions. [2019-09-08 04:01:20,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:01:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2000 transitions. [2019-09-08 04:01:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 04:01:20,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:20,633 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:20,634 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash -750200130, now seen corresponding path program 1 times [2019-09-08 04:01:20,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:20,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:20,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:20,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:01:20,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:20,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:01:20,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:01:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:01:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:01:20,930 INFO L87 Difference]: Start difference. First operand 1289 states and 2000 transitions. Second operand 8 states. [2019-09-08 04:01:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:24,896 INFO L93 Difference]: Finished difference Result 4105 states and 6492 transitions. [2019-09-08 04:01:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:01:24,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-09-08 04:01:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:24,930 INFO L225 Difference]: With dead ends: 4105 [2019-09-08 04:01:24,930 INFO L226 Difference]: Without dead ends: 2877 [2019-09-08 04:01:24,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:01:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2019-09-08 04:01:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2840. [2019-09-08 04:01:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2840 states. [2019-09-08 04:01:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4429 transitions. [2019-09-08 04:01:25,197 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4429 transitions. Word has length 185 [2019-09-08 04:01:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:25,197 INFO L475 AbstractCegarLoop]: Abstraction has 2840 states and 4429 transitions. [2019-09-08 04:01:25,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:01:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4429 transitions. [2019-09-08 04:01:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 04:01:25,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:25,204 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:25,204 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash 601255427, now seen corresponding path program 1 times [2019-09-08 04:01:25,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:25,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:25,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:25,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:25,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:01:25,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:25,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:01:25,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:01:25,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:01:25,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:01:25,465 INFO L87 Difference]: Start difference. First operand 2840 states and 4429 transitions. Second operand 9 states. [2019-09-08 04:01:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:25,889 INFO L93 Difference]: Finished difference Result 5553 states and 8819 transitions. [2019-09-08 04:01:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:01:25,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 188 [2019-09-08 04:01:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:25,920 INFO L225 Difference]: With dead ends: 5553 [2019-09-08 04:01:25,920 INFO L226 Difference]: Without dead ends: 2840 [2019-09-08 04:01:25,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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 04:01:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2019-09-08 04:01:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2840. [2019-09-08 04:01:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2840 states. [2019-09-08 04:01:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4383 transitions. [2019-09-08 04:01:26,143 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4383 transitions. Word has length 188 [2019-09-08 04:01:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:26,144 INFO L475 AbstractCegarLoop]: Abstraction has 2840 states and 4383 transitions. [2019-09-08 04:01:26,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:01:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4383 transitions. [2019-09-08 04:01:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 04:01:26,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:26,150 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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 04:01:26,150 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash 634753339, now seen corresponding path program 1 times [2019-09-08 04:01:26,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:26,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:26,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 04:01:26,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:26,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:01:26,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:01:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:01:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:01:26,381 INFO L87 Difference]: Start difference. First operand 2840 states and 4383 transitions. Second operand 7 states. [2019-09-08 04:01:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:30,544 INFO L93 Difference]: Finished difference Result 5349 states and 8298 transitions. [2019-09-08 04:01:30,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:01:30,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-09-08 04:01:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:30,565 INFO L225 Difference]: With dead ends: 5349 [2019-09-08 04:01:30,565 INFO L226 Difference]: Without dead ends: 3023 [2019-09-08 04:01:30,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:01:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2019-09-08 04:01:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2956. [2019-09-08 04:01:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-09-08 04:01:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4540 transitions. [2019-09-08 04:01:30,714 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4540 transitions. Word has length 193 [2019-09-08 04:01:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:30,714 INFO L475 AbstractCegarLoop]: Abstraction has 2956 states and 4540 transitions. [2019-09-08 04:01:30,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:01:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4540 transitions. [2019-09-08 04:01:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 04:01:30,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:30,718 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:30,719 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1763191436, now seen corresponding path program 1 times [2019-09-08 04:01:30,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:30,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:30,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:01:30,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:30,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:01:30,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:01:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:01:30,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:01:30,839 INFO L87 Difference]: Start difference. First operand 2956 states and 4540 transitions. Second operand 6 states. [2019-09-08 04:01:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:31,063 INFO L93 Difference]: Finished difference Result 6312 states and 9744 transitions. [2019-09-08 04:01:31,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:01:31,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 198 [2019-09-08 04:01:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:31,084 INFO L225 Difference]: With dead ends: 6312 [2019-09-08 04:01:31,084 INFO L226 Difference]: Without dead ends: 3870 [2019-09-08 04:01:31,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:01:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2019-09-08 04:01:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3572. [2019-09-08 04:01:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-09-08 04:01:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 5484 transitions. [2019-09-08 04:01:31,248 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 5484 transitions. Word has length 198 [2019-09-08 04:01:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:31,249 INFO L475 AbstractCegarLoop]: Abstraction has 3572 states and 5484 transitions. [2019-09-08 04:01:31,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:01:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 5484 transitions. [2019-09-08 04:01:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 04:01:31,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:31,253 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:31,253 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1103659914, now seen corresponding path program 1 times [2019-09-08 04:01:31,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:31,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 04:01:31,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:31,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:01:31,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:01:31,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:01:31,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:01:31,468 INFO L87 Difference]: Start difference. First operand 3572 states and 5484 transitions. Second operand 8 states. [2019-09-08 04:01:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:31,588 INFO L93 Difference]: Finished difference Result 3595 states and 5513 transitions. [2019-09-08 04:01:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:01:31,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-08 04:01:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:31,617 INFO L225 Difference]: With dead ends: 3595 [2019-09-08 04:01:31,618 INFO L226 Difference]: Without dead ends: 3578 [2019-09-08 04:01:31,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:01:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2019-09-08 04:01:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3572. [2019-09-08 04:01:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-09-08 04:01:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 5478 transitions. [2019-09-08 04:01:31,773 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 5478 transitions. Word has length 198 [2019-09-08 04:01:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:31,773 INFO L475 AbstractCegarLoop]: Abstraction has 3572 states and 5478 transitions. [2019-09-08 04:01:31,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:01:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 5478 transitions. [2019-09-08 04:01:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 04:01:31,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:31,777 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:31,778 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:31,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:31,778 INFO L82 PathProgramCache]: Analyzing trace with hash 942449130, now seen corresponding path program 1 times [2019-09-08 04:01:31,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:31,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:31,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:31,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:31,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:01:31,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:31,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:01:31,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:01:31,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:01:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:01:31,958 INFO L87 Difference]: Start difference. First operand 3572 states and 5478 transitions. Second operand 9 states. [2019-09-08 04:01:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:34,985 INFO L93 Difference]: Finished difference Result 7075 states and 10900 transitions. [2019-09-08 04:01:34,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:01:34,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2019-09-08 04:01:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:35,006 INFO L225 Difference]: With dead ends: 7075 [2019-09-08 04:01:35,007 INFO L226 Difference]: Without dead ends: 3578 [2019-09-08 04:01:35,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:01:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2019-09-08 04:01:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3572. [2019-09-08 04:01:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-09-08 04:01:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 5472 transitions. [2019-09-08 04:01:35,164 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 5472 transitions. Word has length 216 [2019-09-08 04:01:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:35,164 INFO L475 AbstractCegarLoop]: Abstraction has 3572 states and 5472 transitions. [2019-09-08 04:01:35,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:01:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 5472 transitions. [2019-09-08 04:01:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 04:01:35,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:35,168 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:01:35,170 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1032836846, now seen corresponding path program 1 times [2019-09-08 04:01:35,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:35,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:35,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:35,311 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 04:01:35,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:35,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:01:35,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:01:35,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:01:35,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:01:35,312 INFO L87 Difference]: Start difference. First operand 3572 states and 5472 transitions. Second operand 6 states. [2019-09-08 04:01:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:38,638 INFO L93 Difference]: Finished difference Result 11190 states and 17625 transitions. [2019-09-08 04:01:38,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:01:38,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-08 04:01:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:38,677 INFO L225 Difference]: With dead ends: 11190 [2019-09-08 04:01:38,677 INFO L226 Difference]: Without dead ends: 7693 [2019-09-08 04:01:38,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:01:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7693 states. [2019-09-08 04:01:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7693 to 7290. [2019-09-08 04:01:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7290 states. [2019-09-08 04:01:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7290 states to 7290 states and 11224 transitions. [2019-09-08 04:01:39,040 INFO L78 Accepts]: Start accepts. Automaton has 7290 states and 11224 transitions. Word has length 217 [2019-09-08 04:01:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:39,041 INFO L475 AbstractCegarLoop]: Abstraction has 7290 states and 11224 transitions. [2019-09-08 04:01:39,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:01:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7290 states and 11224 transitions. [2019-09-08 04:01:39,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 04:01:39,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:39,048 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:01:39,048 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:39,048 INFO L82 PathProgramCache]: Analyzing trace with hash 26619835, now seen corresponding path program 1 times [2019-09-08 04:01:39,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:39,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:39,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:39,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:39,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:01:39,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:39,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:01:39,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:01:39,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:01:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:01:39,181 INFO L87 Difference]: Start difference. First operand 7290 states and 11224 transitions. Second operand 4 states. [2019-09-08 04:01:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:41,205 INFO L93 Difference]: Finished difference Result 22945 states and 36602 transitions. [2019-09-08 04:01:41,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:01:41,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-08 04:01:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:41,296 INFO L225 Difference]: With dead ends: 22945 [2019-09-08 04:01:41,297 INFO L226 Difference]: Without dead ends: 15718 [2019-09-08 04:01:41,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:01:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15718 states. [2019-09-08 04:01:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15718 to 15534. [2019-09-08 04:01:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15534 states. [2019-09-08 04:01:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15534 states to 15534 states and 24784 transitions. [2019-09-08 04:01:42,127 INFO L78 Accepts]: Start accepts. Automaton has 15534 states and 24784 transitions. Word has length 225 [2019-09-08 04:01:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:42,128 INFO L475 AbstractCegarLoop]: Abstraction has 15534 states and 24784 transitions. [2019-09-08 04:01:42,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:01:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 15534 states and 24784 transitions. [2019-09-08 04:01:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 04:01:42,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:42,138 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:01:42,138 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:42,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:42,139 INFO L82 PathProgramCache]: Analyzing trace with hash 823917018, now seen corresponding path program 1 times [2019-09-08 04:01:42,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:42,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:42,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:42,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:42,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:01:43,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:43,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:01:43,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:01:43,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:01:43,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:01:43,036 INFO L87 Difference]: Start difference. First operand 15534 states and 24784 transitions. Second operand 4 states. [2019-09-08 04:01:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:45,745 INFO L93 Difference]: Finished difference Result 49683 states and 84061 transitions. [2019-09-08 04:01:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:01:45,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-09-08 04:01:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:46,010 INFO L225 Difference]: With dead ends: 49683 [2019-09-08 04:01:46,010 INFO L226 Difference]: Without dead ends: 34212 [2019-09-08 04:01:46,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:01:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34212 states. [2019-09-08 04:01:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34212 to 33797. [2019-09-08 04:01:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33797 states. [2019-09-08 04:01:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33797 states to 33797 states and 57112 transitions. [2019-09-08 04:01:48,177 INFO L78 Accepts]: Start accepts. Automaton has 33797 states and 57112 transitions. Word has length 226 [2019-09-08 04:01:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:48,177 INFO L475 AbstractCegarLoop]: Abstraction has 33797 states and 57112 transitions. [2019-09-08 04:01:48,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:01:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 33797 states and 57112 transitions. [2019-09-08 04:01:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 04:01:48,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:48,189 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:01:48,190 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash -229670179, now seen corresponding path program 1 times [2019-09-08 04:01:48,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:48,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:01:48,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:48,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:01:48,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:01:48,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:01:48,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:01:48,341 INFO L87 Difference]: Start difference. First operand 33797 states and 57112 transitions. Second operand 4 states. [2019-09-08 04:01:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:01:53,800 INFO L93 Difference]: Finished difference Result 109910 states and 204374 transitions. [2019-09-08 04:01:53,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:01:53,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-09-08 04:01:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:01:54,325 INFO L225 Difference]: With dead ends: 109910 [2019-09-08 04:01:54,325 INFO L226 Difference]: Without dead ends: 76176 [2019-09-08 04:01:54,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:01:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76176 states. [2019-09-08 04:02:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76176 to 75204. [2019-09-08 04:02:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75204 states. [2019-09-08 04:02:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75204 states to 75204 states and 138976 transitions. [2019-09-08 04:02:00,845 INFO L78 Accepts]: Start accepts. Automaton has 75204 states and 138976 transitions. Word has length 227 [2019-09-08 04:02:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:00,846 INFO L475 AbstractCegarLoop]: Abstraction has 75204 states and 138976 transitions. [2019-09-08 04:02:00,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 75204 states and 138976 transitions. [2019-09-08 04:02:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 04:02:00,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:00,867 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:00,867 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:00,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:00,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1468868988, now seen corresponding path program 1 times [2019-09-08 04:02:00,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:00,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:00,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:00,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:00,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:02:01,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:01,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:01,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:01,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:01,011 INFO L87 Difference]: Start difference. First operand 75204 states and 138976 transitions. Second operand 4 states. [2019-09-08 04:02:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:14,114 INFO L93 Difference]: Finished difference Result 249001 states and 535531 transitions. [2019-09-08 04:02:14,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:02:14,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-09-08 04:02:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:16,001 INFO L225 Difference]: With dead ends: 249001 [2019-09-08 04:02:16,002 INFO L226 Difference]: Without dead ends: 173860 [2019-09-08 04:02:16,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:02:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173860 states. [2019-09-08 04:02:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173860 to 171487. [2019-09-08 04:02:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171487 states. [2019-09-08 04:02:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171487 states to 171487 states and 362480 transitions. [2019-09-08 04:02:35,417 INFO L78 Accepts]: Start accepts. Automaton has 171487 states and 362480 transitions. Word has length 228 [2019-09-08 04:02:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:35,417 INFO L475 AbstractCegarLoop]: Abstraction has 171487 states and 362480 transitions. [2019-09-08 04:02:35,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 171487 states and 362480 transitions. [2019-09-08 04:02:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 04:02:35,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:35,436 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:35,436 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:35,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1710987777, now seen corresponding path program 1 times [2019-09-08 04:02:35,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:35,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:35,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 04:02:35,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:35,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:35,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:35,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:35,563 INFO L87 Difference]: Start difference. First operand 171487 states and 362480 transitions. Second operand 4 states. [2019-09-08 04:03:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:13,561 INFO L93 Difference]: Finished difference Result 578670 states and 1542147 transitions. [2019-09-08 04:03:13,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:03:13,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-08 04:03:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:18,153 INFO L225 Difference]: With dead ends: 578670 [2019-09-08 04:03:18,154 INFO L226 Difference]: Without dead ends: 407234 [2019-09-08 04:03:19,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 04:03:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407234 states. [2019-09-08 04:04:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407234 to 401186. [2019-09-08 04:04:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401186 states. [2019-09-08 04:04:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401186 states to 401186 states and 1030282 transitions. [2019-09-08 04:04:27,623 INFO L78 Accepts]: Start accepts. Automaton has 401186 states and 1030282 transitions. Word has length 229 [2019-09-08 04:04:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:04:27,624 INFO L475 AbstractCegarLoop]: Abstraction has 401186 states and 1030282 transitions. [2019-09-08 04:04:27,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:04:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 401186 states and 1030282 transitions. [2019-09-08 04:04:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 04:04:27,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:04:27,672 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:27,672 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:04:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:04:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -731125577, now seen corresponding path program 1 times [2019-09-08 04:04:27,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:04:27,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:04:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:27,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:04:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:04:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 04:04:27,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:04:27,841 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 04:04:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:04:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:04:28,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 3491 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 04:04:28,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:04:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 04:04:28,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:04:28,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-08 04:04:28,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:04:28,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:04:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:04:28,488 INFO L87 Difference]: Start difference. First operand 401186 states and 1030282 transitions. Second operand 14 states. [2019-09-08 04:04:43,174 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11