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_spec3_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:31:39,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:31:39,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:31:39,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:31:39,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:31:39,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:31:39,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:31:39,093 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:31:39,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:31:39,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:31:39,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:31:39,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:31:39,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:31:39,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:31:39,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:31:39,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:31:39,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:31:39,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:31:39,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:31:39,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:31:39,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:31:39,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:31:39,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:31:39,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:31:39,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:31:39,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:31:39,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:31:39,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:31:39,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:31:39,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:31:39,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:31:39,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:31:39,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:31:39,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:31:39,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:31:39,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:31:39,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:31:39,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:31:39,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:31:39,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:31:39,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:31:39,124 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:31:39,139 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:31:39,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:31:39,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:31:39,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:31:39,141 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:31:39,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:31:39,142 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:31:39,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:31:39,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:31:39,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:31:39,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:31:39,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:31:39,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:31:39,143 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:31:39,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:31:39,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:31:39,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:31:39,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:31:39,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:31:39,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:31:39,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:31:39,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:31:39,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:31:39,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:31:39,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:31:39,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:31:39,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:31:39,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:31:39,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:31:39,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:31:39,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:31:39,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:31:39,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:31:39,200 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:31:39,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-02 12:31:39,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06123758d/ecf980948e6b460083f8a9ddea74fb02/FLAG20ce863bd [2019-10-02 12:31:39,891 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:31:39,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product26.cil.c [2019-10-02 12:31:39,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06123758d/ecf980948e6b460083f8a9ddea74fb02/FLAG20ce863bd [2019-10-02 12:31:40,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06123758d/ecf980948e6b460083f8a9ddea74fb02 [2019-10-02 12:31:40,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:31:40,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:31:40,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:31:40,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:31:40,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:31:40,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:31:40" (1/1) ... [2019-10-02 12:31:40,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef0aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:40, skipping insertion in model container [2019-10-02 12:31:40,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:31:40" (1/1) ... [2019-10-02 12:31:40,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:31:40,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:31:40,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:31:40,976 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:31:41,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:31:41,188 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:31:41,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41 WrapperNode [2019-10-02 12:31:41,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:31:41,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:31:41,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:31:41,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:31:41,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... [2019-10-02 12:31:41,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... [2019-10-02 12:31:41,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... [2019-10-02 12:31:41,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... [2019-10-02 12:31:41,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... [2019-10-02 12:31:41,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... [2019-10-02 12:31:41,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... [2019-10-02 12:31:41,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:31:41,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:31:41,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:31:41,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:31:41,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:31:41,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:31:41,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:31:41,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:31:41,476 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:31:41,476 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:31:41,477 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:31:41,477 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:31:41,477 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:31:41,477 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:31:41,478 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:31:41,478 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:31:41,478 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:31:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:31:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:31:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:31:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:31:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:31:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:31:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:31:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:31:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:31:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:31:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:31:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:31:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:31:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:31:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:31:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:31:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:31:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:31:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:31:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:31:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:31:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:31:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:31:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:31:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:31:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:31:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:31:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:31:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:31:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:31:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:31:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:31:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:31:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:31:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-02 12:31:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:31:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-02 12:31:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:31:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:31:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:31:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:31:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:31:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:31:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:31:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:31:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:31:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:31:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:31:41,491 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:31:41,491 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:31:41,491 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:31:41,492 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:31:41,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:31:41,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:31:41,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:31:41,493 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:31:41,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:31:41,493 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:31:41,494 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:31:41,494 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:31:41,494 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:31:41,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:31:41,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:31:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:31:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:31:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:31:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:31:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:31:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:31:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:31:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:31:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:31:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:31:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:31:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:31:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:31:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:31:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:31:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:31:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:31:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:31:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:31:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:31:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:31:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:31:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:31:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:31:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:31:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:31:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:31:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:31:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:31:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:31:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:31:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:31:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:31:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:31:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:31:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:31:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:31:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:31:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:31:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:31:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:31:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:31:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:31:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:31:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:31:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:31:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:31:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:31:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:31:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:31:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:31:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:31:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:31:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:31:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:31:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:31:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:31:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:31:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:31:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:31:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:31:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:31:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-02 12:31:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:31:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:31:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-02 12:31:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:31:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:31:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:31:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:31:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:31:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:31:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:31:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:31:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:31:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:31:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:31:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:31:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:31:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:31:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:31:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:31:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:31:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:31:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:31:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:31:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:31:41,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:31:41,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:31:41,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:31:44,513 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:31:44,513 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:31:44,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:31:44 BoogieIcfgContainer [2019-10-02 12:31:44,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:31:44,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:31:44,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:31:44,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:31:44,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:31:40" (1/3) ... [2019-10-02 12:31:44,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b03283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:31:44, skipping insertion in model container [2019-10-02 12:31:44,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:31:41" (2/3) ... [2019-10-02 12:31:44,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b03283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:31:44, skipping insertion in model container [2019-10-02 12:31:44,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:31:44" (3/3) ... [2019-10-02 12:31:44,524 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product26.cil.c [2019-10-02 12:31:44,534 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:31:44,546 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:31:44,566 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:31:44,615 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:31:44,616 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:31:44,616 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:31:44,616 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:31:44,616 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:31:44,616 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:31:44,616 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:31:44,616 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:31:44,617 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:31:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states. [2019-10-02 12:31:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:31:44,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:44,693 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:44,696 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1751841435, now seen corresponding path program 1 times [2019-10-02 12:31:44,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:44,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:45,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:45,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:45,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:45,383 INFO L87 Difference]: Start difference. First operand 797 states. Second operand 7 states. [2019-10-02 12:31:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:45,704 INFO L93 Difference]: Finished difference Result 1259 states and 2038 transitions. [2019-10-02 12:31:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:45,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-10-02 12:31:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:45,731 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:31:45,732 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:31:45,747 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:31:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-02 12:31:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:31:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1014 transitions. [2019-10-02 12:31:45,902 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1014 transitions. Word has length 93 [2019-10-02 12:31:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:45,903 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1014 transitions. [2019-10-02 12:31:45,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1014 transitions. [2019-10-02 12:31:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:31:45,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:45,925 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:45,925 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 449544218, now seen corresponding path program 1 times [2019-10-02 12:31:45,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:45,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:45,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:46,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:46,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:31:46,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:31:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:31:46,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:31:46,167 INFO L87 Difference]: Start difference. First operand 636 states and 1014 transitions. Second operand 4 states. [2019-10-02 12:31:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:46,251 INFO L93 Difference]: Finished difference Result 1238 states and 1993 transitions. [2019-10-02 12:31:46,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:31:46,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-02 12:31:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:46,258 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 12:31:46,258 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 12:31:46,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 12:31:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 12:31:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:31:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 981 transitions. [2019-10-02 12:31:46,289 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 981 transitions. Word has length 94 [2019-10-02 12:31:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:46,289 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 981 transitions. [2019-10-02 12:31:46,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:31:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2019-10-02 12:31:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:31:46,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:46,293 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:46,293 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 451716357, now seen corresponding path program 1 times [2019-10-02 12:31:46,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:46,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:46,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:46,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:46,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:46,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:46,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:46,508 INFO L87 Difference]: Start difference. First operand 618 states and 981 transitions. Second operand 7 states. [2019-10-02 12:31:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:46,623 INFO L93 Difference]: Finished difference Result 1207 states and 1935 transitions. [2019-10-02 12:31:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:46,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-02 12:31:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:46,631 INFO L225 Difference]: With dead ends: 1207 [2019-10-02 12:31:46,631 INFO L226 Difference]: Without dead ends: 612 [2019-10-02 12:31:46,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-02 12:31:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-02 12:31:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:31:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 968 transitions. [2019-10-02 12:31:46,717 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 968 transitions. Word has length 94 [2019-10-02 12:31:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:46,718 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 968 transitions. [2019-10-02 12:31:46,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 968 transitions. [2019-10-02 12:31:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:31:46,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:46,721 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:46,721 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:46,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2112280439, now seen corresponding path program 1 times [2019-10-02 12:31:46,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:46,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:46,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:46,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:46,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:46,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:46,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:46,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:46,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:46,917 INFO L87 Difference]: Start difference. First operand 612 states and 968 transitions. Second operand 7 states. [2019-10-02 12:31:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:47,018 INFO L93 Difference]: Finished difference Result 1195 states and 1909 transitions. [2019-10-02 12:31:47,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:47,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 12:31:47,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:47,024 INFO L225 Difference]: With dead ends: 1195 [2019-10-02 12:31:47,024 INFO L226 Difference]: Without dead ends: 606 [2019-10-02 12:31:47,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-02 12:31:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-02 12:31:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-02 12:31:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 955 transitions. [2019-10-02 12:31:47,057 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 955 transitions. Word has length 95 [2019-10-02 12:31:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:47,058 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 955 transitions. [2019-10-02 12:31:47,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 955 transitions. [2019-10-02 12:31:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:31:47,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:47,060 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:47,061 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2146614103, now seen corresponding path program 1 times [2019-10-02 12:31:47,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:47,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:47,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:47,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:47,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:47,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:47,278 INFO L87 Difference]: Start difference. First operand 606 states and 955 transitions. Second operand 7 states. [2019-10-02 12:31:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:47,415 INFO L93 Difference]: Finished difference Result 1183 states and 1883 transitions. [2019-10-02 12:31:47,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:47,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-02 12:31:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:47,422 INFO L225 Difference]: With dead ends: 1183 [2019-10-02 12:31:47,422 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:47,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 942 transitions. [2019-10-02 12:31:47,459 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 942 transitions. Word has length 96 [2019-10-02 12:31:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:47,459 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 942 transitions. [2019-10-02 12:31:47,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 942 transitions. [2019-10-02 12:31:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:31:47,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:47,462 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:47,462 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash -757672278, now seen corresponding path program 1 times [2019-10-02 12:31:47,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:47,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:47,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:47,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:47,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:47,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:47,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:47,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:47,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:47,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:47,675 INFO L87 Difference]: Start difference. First operand 600 states and 942 transitions. Second operand 7 states. [2019-10-02 12:31:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:47,833 INFO L93 Difference]: Finished difference Result 1171 states and 1857 transitions. [2019-10-02 12:31:47,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:31:47,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-02 12:31:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:47,841 INFO L225 Difference]: With dead ends: 1171 [2019-10-02 12:31:47,842 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:47,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 941 transitions. [2019-10-02 12:31:47,881 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 941 transitions. Word has length 96 [2019-10-02 12:31:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:47,882 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 941 transitions. [2019-10-02 12:31:47,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 941 transitions. [2019-10-02 12:31:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:31:47,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:47,885 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:47,885 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1070802003, now seen corresponding path program 1 times [2019-10-02 12:31:47,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:47,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:47,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:47,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:47,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:48,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:48,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:48,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:48,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:48,096 INFO L87 Difference]: Start difference. First operand 600 states and 941 transitions. Second operand 5 states. [2019-10-02 12:31:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:48,182 INFO L93 Difference]: Finished difference Result 1170 states and 1854 transitions. [2019-10-02 12:31:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:48,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-02 12:31:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:48,187 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:31:48,188 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:48,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 940 transitions. [2019-10-02 12:31:48,217 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 940 transitions. Word has length 97 [2019-10-02 12:31:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:48,218 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 940 transitions. [2019-10-02 12:31:48,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 940 transitions. [2019-10-02 12:31:48,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:31:48,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:48,220 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:48,220 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:48,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:48,221 INFO L82 PathProgramCache]: Analyzing trace with hash -647387713, now seen corresponding path program 1 times [2019-10-02 12:31:48,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:48,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:48,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:48,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:48,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:48,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:48,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:48,365 INFO L87 Difference]: Start difference. First operand 600 states and 940 transitions. Second operand 5 states. [2019-10-02 12:31:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:48,459 INFO L93 Difference]: Finished difference Result 1170 states and 1852 transitions. [2019-10-02 12:31:48,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:48,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-02 12:31:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:48,468 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:31:48,468 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:48,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:48,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 939 transitions. [2019-10-02 12:31:48,507 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 939 transitions. Word has length 98 [2019-10-02 12:31:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:48,508 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 939 transitions. [2019-10-02 12:31:48,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 939 transitions. [2019-10-02 12:31:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:31:48,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:48,510 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:48,510 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:48,511 INFO L82 PathProgramCache]: Analyzing trace with hash 146491208, now seen corresponding path program 1 times [2019-10-02 12:31:48,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:48,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:48,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:48,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:48,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:48,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:48,657 INFO L87 Difference]: Start difference. First operand 600 states and 939 transitions. Second operand 5 states. [2019-10-02 12:31:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:48,728 INFO L93 Difference]: Finished difference Result 1170 states and 1850 transitions. [2019-10-02 12:31:48,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:48,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-02 12:31:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:48,733 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:31:48,734 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:48,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 938 transitions. [2019-10-02 12:31:48,759 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 938 transitions. Word has length 99 [2019-10-02 12:31:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:48,760 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 938 transitions. [2019-10-02 12:31:48,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 938 transitions. [2019-10-02 12:31:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 12:31:48,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:48,762 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:48,762 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:48,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash -460128198, now seen corresponding path program 1 times [2019-10-02 12:31:48,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:48,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:48,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:48,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:48,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:31:48,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:31:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:31:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:48,939 INFO L87 Difference]: Start difference. First operand 600 states and 938 transitions. Second operand 5 states. [2019-10-02 12:31:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:49,010 INFO L93 Difference]: Finished difference Result 1170 states and 1848 transitions. [2019-10-02 12:31:49,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:49,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-02 12:31:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:49,016 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:31:49,016 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:49,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:31:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 937 transitions. [2019-10-02 12:31:49,042 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 937 transitions. Word has length 100 [2019-10-02 12:31:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:49,043 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 937 transitions. [2019-10-02 12:31:49,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:31:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 937 transitions. [2019-10-02 12:31:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:31:49,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:49,045 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:49,045 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash 406639265, now seen corresponding path program 1 times [2019-10-02 12:31:49,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:49,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:49,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:49,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:49,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:31:49,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:31:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:31:49,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:31:49,246 INFO L87 Difference]: Start difference. First operand 600 states and 937 transitions. Second operand 9 states. [2019-10-02 12:31:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:49,405 INFO L93 Difference]: Finished difference Result 1172 states and 1847 transitions. [2019-10-02 12:31:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:31:49,406 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-02 12:31:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:49,411 INFO L225 Difference]: With dead ends: 1172 [2019-10-02 12:31:49,411 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:31:49,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:31:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:31:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-02 12:31:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-02 12:31:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 936 transitions. [2019-10-02 12:31:49,434 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 936 transitions. Word has length 101 [2019-10-02 12:31:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:49,435 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 936 transitions. [2019-10-02 12:31:49,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:31:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 936 transitions. [2019-10-02 12:31:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:31:49,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:49,437 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:49,437 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1532522781, now seen corresponding path program 1 times [2019-10-02 12:31:49,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:49,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:49,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:31:49,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:49,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:31:49,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:31:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:31:49,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:31:49,654 INFO L87 Difference]: Start difference. First operand 600 states and 936 transitions. Second operand 8 states. [2019-10-02 12:31:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:52,990 INFO L93 Difference]: Finished difference Result 2187 states and 3473 transitions. [2019-10-02 12:31:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:31:52,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-10-02 12:31:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:53,006 INFO L225 Difference]: With dead ends: 2187 [2019-10-02 12:31:53,006 INFO L226 Difference]: Without dead ends: 1621 [2019-10-02 12:31:53,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:31:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2019-10-02 12:31:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1609. [2019-10-02 12:31:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-10-02 12:31:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2515 transitions. [2019-10-02 12:31:53,163 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2515 transitions. Word has length 101 [2019-10-02 12:31:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:53,164 INFO L475 AbstractCegarLoop]: Abstraction has 1609 states and 2515 transitions. [2019-10-02 12:31:53,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:31:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2515 transitions. [2019-10-02 12:31:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:31:53,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:53,165 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:31:53,166 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash -756173853, now seen corresponding path program 1 times [2019-10-02 12:31:53,166 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:53,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:53,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 12:31:53,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:53,381 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:53,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:54,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 2951 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:31:54,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:31:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:31:54,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:31:54,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:31:54,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:31:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:31:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:31:54,168 INFO L87 Difference]: Start difference. First operand 1609 states and 2515 transitions. Second operand 12 states. [2019-10-02 12:32:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:01,783 INFO L93 Difference]: Finished difference Result 7871 states and 12911 transitions. [2019-10-02 12:32:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:32:01,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-02 12:32:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:01,847 INFO L225 Difference]: With dead ends: 7871 [2019-10-02 12:32:01,848 INFO L226 Difference]: Without dead ends: 6296 [2019-10-02 12:32:01,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:32:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6296 states. [2019-10-02 12:32:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6296 to 4062. [2019-10-02 12:32:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-10-02 12:32:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 6442 transitions. [2019-10-02 12:32:02,143 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 6442 transitions. Word has length 101 [2019-10-02 12:32:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:02,144 INFO L475 AbstractCegarLoop]: Abstraction has 4062 states and 6442 transitions. [2019-10-02 12:32:02,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:32:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 6442 transitions. [2019-10-02 12:32:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 12:32:02,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:02,146 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:32:02,146 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:02,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1285320346, now seen corresponding path program 1 times [2019-10-02 12:32:02,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:02,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:02,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:02,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:02,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:32:02,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:02,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:32:02,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:32:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:32:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:32:02,315 INFO L87 Difference]: Start difference. First operand 4062 states and 6442 transitions. Second operand 7 states. [2019-10-02 12:32:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:05,830 INFO L93 Difference]: Finished difference Result 12028 states and 19592 transitions. [2019-10-02 12:32:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:32:05,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2019-10-02 12:32:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:05,891 INFO L225 Difference]: With dead ends: 12028 [2019-10-02 12:32:05,891 INFO L226 Difference]: Without dead ends: 8000 [2019-10-02 12:32:05,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:32:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2019-10-02 12:32:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 7912. [2019-10-02 12:32:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7912 states. [2019-10-02 12:32:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7912 states to 7912 states and 12719 transitions. [2019-10-02 12:32:06,365 INFO L78 Accepts]: Start accepts. Automaton has 7912 states and 12719 transitions. Word has length 104 [2019-10-02 12:32:06,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:06,366 INFO L475 AbstractCegarLoop]: Abstraction has 7912 states and 12719 transitions. [2019-10-02 12:32:06,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:32:06,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7912 states and 12719 transitions. [2019-10-02 12:32:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 12:32:06,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:06,368 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:32:06,368 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1140684113, now seen corresponding path program 1 times [2019-10-02 12:32:06,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:06,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:06,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:06,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:32:06,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:06,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:32:06,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:32:06,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:32:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:32:06,509 INFO L87 Difference]: Start difference. First operand 7912 states and 12719 transitions. Second operand 4 states. [2019-10-02 12:32:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:06,866 INFO L93 Difference]: Finished difference Result 15445 states and 25086 transitions. [2019-10-02 12:32:06,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:32:06,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-02 12:32:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:06,976 INFO L225 Difference]: With dead ends: 15445 [2019-10-02 12:32:06,976 INFO L226 Difference]: Without dead ends: 7555 [2019-10-02 12:32:07,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:32:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7555 states. [2019-10-02 12:32:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7555 to 7533. [2019-10-02 12:32:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7533 states. [2019-10-02 12:32:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7533 states to 7533 states and 12073 transitions. [2019-10-02 12:32:07,560 INFO L78 Accepts]: Start accepts. Automaton has 7533 states and 12073 transitions. Word has length 105 [2019-10-02 12:32:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:07,564 INFO L475 AbstractCegarLoop]: Abstraction has 7533 states and 12073 transitions. [2019-10-02 12:32:07,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 7533 states and 12073 transitions. [2019-10-02 12:32:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 12:32:07,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:07,567 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:32:07,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:07,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1975309189, now seen corresponding path program 1 times [2019-10-02 12:32:07,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:07,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 12:32:07,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:07,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:32:07,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:32:07,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:32:07,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:32:07,770 INFO L87 Difference]: Start difference. First operand 7533 states and 12073 transitions. Second operand 7 states. [2019-10-02 12:32:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:11,274 INFO L93 Difference]: Finished difference Result 22523 states and 37216 transitions. [2019-10-02 12:32:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:32:11,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-10-02 12:32:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:11,393 INFO L225 Difference]: With dead ends: 22523 [2019-10-02 12:32:11,393 INFO L226 Difference]: Without dead ends: 15024 [2019-10-02 12:32:11,429 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:32:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2019-10-02 12:32:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14900. [2019-10-02 12:32:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14900 states. [2019-10-02 12:32:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14900 states to 14900 states and 24363 transitions. [2019-10-02 12:32:12,189 INFO L78 Accepts]: Start accepts. Automaton has 14900 states and 24363 transitions. Word has length 113 [2019-10-02 12:32:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:12,190 INFO L475 AbstractCegarLoop]: Abstraction has 14900 states and 24363 transitions. [2019-10-02 12:32:12,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:32:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 14900 states and 24363 transitions. [2019-10-02 12:32:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 12:32:12,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:12,193 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:32:12,193 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:12,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2114200266, now seen corresponding path program 1 times [2019-10-02 12:32:12,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:12,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:12,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:12,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:12,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:32:12,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:12,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:32:12,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:32:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:32:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:32:12,332 INFO L87 Difference]: Start difference. First operand 14900 states and 24363 transitions. Second operand 4 states. [2019-10-02 12:32:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:13,801 INFO L93 Difference]: Finished difference Result 29471 states and 48744 transitions. [2019-10-02 12:32:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:32:13,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 12:32:13,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:13,912 INFO L225 Difference]: With dead ends: 29471 [2019-10-02 12:32:13,913 INFO L226 Difference]: Without dead ends: 14593 [2019-10-02 12:32:13,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:32:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2019-10-02 12:32:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 14553. [2019-10-02 12:32:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14553 states. [2019-10-02 12:32:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14553 states to 14553 states and 23736 transitions. [2019-10-02 12:32:14,593 INFO L78 Accepts]: Start accepts. Automaton has 14553 states and 23736 transitions. Word has length 114 [2019-10-02 12:32:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:14,595 INFO L475 AbstractCegarLoop]: Abstraction has 14553 states and 23736 transitions. [2019-10-02 12:32:14,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 14553 states and 23736 transitions. [2019-10-02 12:32:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:32:14,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:14,596 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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-10-02 12:32:14,597 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash 423458253, now seen corresponding path program 1 times [2019-10-02 12:32:14,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:14,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:14,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:14,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:14,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:32:14,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:14,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:32:14,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:32:14,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:32:14,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:32:14,749 INFO L87 Difference]: Start difference. First operand 14553 states and 23736 transitions. Second operand 7 states. [2019-10-02 12:32:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:18,385 INFO L93 Difference]: Finished difference Result 43699 states and 74183 transitions. [2019-10-02 12:32:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:32:18,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-10-02 12:32:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:18,604 INFO L225 Difference]: With dead ends: 43699 [2019-10-02 12:32:18,604 INFO L226 Difference]: Without dead ends: 29180 [2019-10-02 12:32:18,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:32:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29180 states. [2019-10-02 12:32:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29180 to 28996. [2019-10-02 12:32:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28996 states. [2019-10-02 12:32:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28996 states to 28996 states and 48889 transitions. [2019-10-02 12:32:20,059 INFO L78 Accepts]: Start accepts. Automaton has 28996 states and 48889 transitions. Word has length 123 [2019-10-02 12:32:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:20,060 INFO L475 AbstractCegarLoop]: Abstraction has 28996 states and 48889 transitions. [2019-10-02 12:32:20,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:32:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 28996 states and 48889 transitions. [2019-10-02 12:32:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:32:20,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:20,061 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:32:20,062 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:20,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash 554898028, now seen corresponding path program 1 times [2019-10-02 12:32:20,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 12:32:20,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:20,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:32:20,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:32:20,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:32:20,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:32:20,166 INFO L87 Difference]: Start difference. First operand 28996 states and 48889 transitions. Second operand 4 states. [2019-10-02 12:32:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:21,271 INFO L93 Difference]: Finished difference Result 57713 states and 98815 transitions. [2019-10-02 12:32:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:32:21,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-02 12:32:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:21,450 INFO L225 Difference]: With dead ends: 57713 [2019-10-02 12:32:21,450 INFO L226 Difference]: Without dead ends: 28739 [2019-10-02 12:32:21,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:32:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28739 states. [2019-10-02 12:32:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28739 to 28663. [2019-10-02 12:32:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28663 states. [2019-10-02 12:32:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28663 states to 28663 states and 48229 transitions. [2019-10-02 12:32:22,872 INFO L78 Accepts]: Start accepts. Automaton has 28663 states and 48229 transitions. Word has length 124 [2019-10-02 12:32:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:22,872 INFO L475 AbstractCegarLoop]: Abstraction has 28663 states and 48229 transitions. [2019-10-02 12:32:22,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28663 states and 48229 transitions. [2019-10-02 12:32:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:32:22,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:22,874 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:32:22,875 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 923615464, now seen corresponding path program 1 times [2019-10-02 12:32:22,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:22,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:32:23,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:23,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:32:23,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:32:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:32:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:32:23,005 INFO L87 Difference]: Start difference. First operand 28663 states and 48229 transitions. Second operand 7 states. [2019-10-02 12:32:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:28,394 INFO L93 Difference]: Finished difference Result 86201 states and 153932 transitions. [2019-10-02 12:32:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:32:28,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-10-02 12:32:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:28,787 INFO L225 Difference]: With dead ends: 86201 [2019-10-02 12:32:28,787 INFO L226 Difference]: Without dead ends: 57572 [2019-10-02 12:32:28,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:32:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57572 states. [2019-10-02 12:32:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57572 to 57288. [2019-10-02 12:32:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57288 states. [2019-10-02 12:32:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57288 states to 57288 states and 102201 transitions. [2019-10-02 12:32:31,434 INFO L78 Accepts]: Start accepts. Automaton has 57288 states and 102201 transitions. Word has length 134 [2019-10-02 12:32:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:31,435 INFO L475 AbstractCegarLoop]: Abstraction has 57288 states and 102201 transitions. [2019-10-02 12:32:31,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:32:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 57288 states and 102201 transitions. [2019-10-02 12:32:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:32:31,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:31,436 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:32:31,437 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash 201654009, now seen corresponding path program 1 times [2019-10-02 12:32:31,437 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:31,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:31,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:31,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:31,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:32:31,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:31,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:32:31,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:32:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:32:31,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:32:31,591 INFO L87 Difference]: Start difference. First operand 57288 states and 102201 transitions. Second operand 4 states. [2019-10-02 12:32:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:35,433 INFO L93 Difference]: Finished difference Result 114124 states and 208296 transitions. [2019-10-02 12:32:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:32:35,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 12:32:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:35,827 INFO L225 Difference]: With dead ends: 114124 [2019-10-02 12:32:35,828 INFO L226 Difference]: Without dead ends: 56852 [2019-10-02 12:32:36,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:32:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56852 states. [2019-10-02 12:32:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56852 to 56708. [2019-10-02 12:32:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56708 states. [2019-10-02 12:32:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56708 states to 56708 states and 100862 transitions. [2019-10-02 12:32:38,272 INFO L78 Accepts]: Start accepts. Automaton has 56708 states and 100862 transitions. Word has length 135 [2019-10-02 12:32:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:38,273 INFO L475 AbstractCegarLoop]: Abstraction has 56708 states and 100862 transitions. [2019-10-02 12:32:38,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:32:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 56708 states and 100862 transitions. [2019-10-02 12:32:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:32:38,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:38,274 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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-10-02 12:32:38,274 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:38,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:38,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1797371377, now seen corresponding path program 1 times [2019-10-02 12:32:38,274 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:38,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:38,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:38,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:32:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:32:38,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:32:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:32:38,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:32:38,442 INFO L87 Difference]: Start difference. First operand 56708 states and 100862 transitions. Second operand 3 states. [2019-10-02 12:32:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:42,497 INFO L93 Difference]: Finished difference Result 116008 states and 204129 transitions. [2019-10-02 12:32:42,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:32:42,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-02 12:32:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:42,813 INFO L225 Difference]: With dead ends: 116008 [2019-10-02 12:32:42,813 INFO L226 Difference]: Without dead ends: 60553 [2019-10-02 12:32:42,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:32:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60553 states. [2019-10-02 12:32:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60553 to 59979. [2019-10-02 12:32:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59979 states. [2019-10-02 12:32:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59979 states to 59979 states and 106739 transitions. [2019-10-02 12:32:45,104 INFO L78 Accepts]: Start accepts. Automaton has 59979 states and 106739 transitions. Word has length 136 [2019-10-02 12:32:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:45,105 INFO L475 AbstractCegarLoop]: Abstraction has 59979 states and 106739 transitions. [2019-10-02 12:32:45,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:32:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 59979 states and 106739 transitions. [2019-10-02 12:32:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:32:45,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:45,108 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-02 12:32:45,108 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash -215505, now seen corresponding path program 1 times [2019-10-02 12:32:45,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:45,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:45,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:32:45,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:45,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:32:45,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:32:45,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:32:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:32:45,312 INFO L87 Difference]: Start difference. First operand 59979 states and 106739 transitions. Second operand 10 states. [2019-10-02 12:32:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:51,090 INFO L93 Difference]: Finished difference Result 134047 states and 253565 transitions. [2019-10-02 12:32:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:32:51,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2019-10-02 12:32:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:32:51,508 INFO L225 Difference]: With dead ends: 134047 [2019-10-02 12:32:51,508 INFO L226 Difference]: Without dead ends: 74102 [2019-10-02 12:32:51,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:32:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74102 states. [2019-10-02 12:32:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74102 to 74098. [2019-10-02 12:32:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74098 states. [2019-10-02 12:32:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74098 states to 74098 states and 138063 transitions. [2019-10-02 12:32:54,908 INFO L78 Accepts]: Start accepts. Automaton has 74098 states and 138063 transitions. Word has length 173 [2019-10-02 12:32:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:32:54,908 INFO L475 AbstractCegarLoop]: Abstraction has 74098 states and 138063 transitions. [2019-10-02 12:32:54,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:32:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 74098 states and 138063 transitions. [2019-10-02 12:32:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:32:54,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:32:54,912 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-02 12:32:54,912 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:32:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:32:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1463386968, now seen corresponding path program 1 times [2019-10-02 12:32:54,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:32:54,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:32:54,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:54,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:32:54,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:32:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:32:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:32:55,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:32:55,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 12:32:55,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:32:55,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:32:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:32:55,175 INFO L87 Difference]: Start difference. First operand 74098 states and 138063 transitions. Second operand 14 states. [2019-10-02 12:33:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:33:23,559 INFO L93 Difference]: Finished difference Result 257028 states and 576208 transitions. [2019-10-02 12:33:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:33:23,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 174 [2019-10-02 12:33:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:33:24,725 INFO L225 Difference]: With dead ends: 257028 [2019-10-02 12:33:24,725 INFO L226 Difference]: Without dead ends: 182862 [2019-10-02 12:33:25,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=2235, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 12:33:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182862 states. [2019-10-02 12:33:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182862 to 172688. [2019-10-02 12:33:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172688 states. [2019-10-02 12:33:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172688 states to 172688 states and 325872 transitions. [2019-10-02 12:33:47,979 INFO L78 Accepts]: Start accepts. Automaton has 172688 states and 325872 transitions. Word has length 174 [2019-10-02 12:33:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:33:47,980 INFO L475 AbstractCegarLoop]: Abstraction has 172688 states and 325872 transitions. [2019-10-02 12:33:47,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:33:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 172688 states and 325872 transitions. [2019-10-02 12:33:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:33:47,983 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:33:47,984 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-02 12:33:47,984 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:33:47,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:33:47,985 INFO L82 PathProgramCache]: Analyzing trace with hash -9829276, now seen corresponding path program 1 times [2019-10-02 12:33:47,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:33:47,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:33:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:33:47,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:33:47,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:33:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:33:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:33:48,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:33:48,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 12:33:48,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:33:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:33:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:33:48,236 INFO L87 Difference]: Start difference. First operand 172688 states and 325872 transitions. Second operand 14 states. [2019-10-02 12:34:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:41,410 INFO L93 Difference]: Finished difference Result 573670 states and 1262011 transitions. [2019-10-02 12:34:41,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:34:41,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2019-10-02 12:34:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:44,970 INFO L225 Difference]: With dead ends: 573670 [2019-10-02 12:34:44,971 INFO L226 Difference]: Without dead ends: 400738 [2019-10-02 12:34:55,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=2141, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 12:34:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400738 states. [2019-10-02 12:35:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400738 to 374804. [2019-10-02 12:35:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374804 states. [2019-10-02 12:35:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374804 states to 374804 states and 711172 transitions. [2019-10-02 12:35:31,590 INFO L78 Accepts]: Start accepts. Automaton has 374804 states and 711172 transitions. Word has length 175 [2019-10-02 12:35:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:31,591 INFO L475 AbstractCegarLoop]: Abstraction has 374804 states and 711172 transitions. [2019-10-02 12:35:31,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:35:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 374804 states and 711172 transitions. [2019-10-02 12:35:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:35:31,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:31,594 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 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-10-02 12:35:31,594 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:31,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1997989468, now seen corresponding path program 1 times [2019-10-02 12:35:31,595 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:31,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:35:31,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:35:31,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 12:35:31,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:35:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:35:31,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:35:31,824 INFO L87 Difference]: Start difference. First operand 374804 states and 711172 transitions. Second operand 14 states. [2019-10-02 12:37:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:08,839 INFO L93 Difference]: Finished difference Result 1058404 states and 2312197 transitions. [2019-10-02 12:37:08,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:37:08,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 176 [2019-10-02 12:37:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:15,677 INFO L225 Difference]: With dead ends: 1058404 [2019-10-02 12:37:15,677 INFO L226 Difference]: Without dead ends: 682830 [2019-10-02 12:37:38,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=2141, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 12:37:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682830 states.