java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:20:33,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:20:33,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:20:33,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:20:33,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:20:33,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:20:33,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:20:33,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:20:33,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:20:33,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:20:33,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:20:33,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:20:33,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:20:33,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:20:33,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:20:33,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:20:33,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:20:33,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:20:33,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:20:33,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:20:33,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:20:33,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:20:33,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:20:33,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:20:33,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:20:33,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:20:33,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:20:33,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:20:33,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:20:33,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:20:33,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:20:33,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:20:33,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:20:33,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:20:33,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:20:33,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:20:33,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:20:33,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:20:33,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:20:33,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:20:33,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:20:33,521 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:20:33,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:20:33,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:20:33,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:20:33,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:20:33,539 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:20:33,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:20:33,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:20:33,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:20:33,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:20:33,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:20:33,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:20:33,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:20:33,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:20:33,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:20:33,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:20:33,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:20:33,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:20:33,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:20:33,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:20:33,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:20:33,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:20:33,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:20:33,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:20:33,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:20:33,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:20:33,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:20:33,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:20:33,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:20:33,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:20:33,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:20:33,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:20:33,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:20:33,599 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:20:33,599 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:20:33,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-10-02 12:20:33,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d614e9a0/8128ce5b64c34f88a3e34b6fe8cfeab1/FLAG79272dfc3 [2019-10-02 12:20:34,293 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:20:34,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-10-02 12:20:34,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d614e9a0/8128ce5b64c34f88a3e34b6fe8cfeab1/FLAG79272dfc3 [2019-10-02 12:20:34,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d614e9a0/8128ce5b64c34f88a3e34b6fe8cfeab1 [2019-10-02 12:20:34,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:20:34,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:20:34,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:20:34,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:20:34,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:20:34,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:20:34" (1/1) ... [2019-10-02 12:20:34,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6c15aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:34, skipping insertion in model container [2019-10-02 12:20:34,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:20:34" (1/1) ... [2019-10-02 12:20:34,471 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:20:34,545 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:20:35,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:20:35,315 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:20:35,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:20:35,548 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:20:35,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35 WrapperNode [2019-10-02 12:20:35,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:20:35,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:20:35,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:20:35,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:20:35,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (1/1) ... [2019-10-02 12:20:35,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (1/1) ... [2019-10-02 12:20:35,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (1/1) ... [2019-10-02 12:20:35,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (1/1) ... [2019-10-02 12:20:35,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (1/1) ... [2019-10-02 12:20:35,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (1/1) ... [2019-10-02 12:20:35,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (1/1) ... [2019-10-02 12:20:35,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:20:35,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:20:35,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:20:35,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:20:35,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (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:20:35,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:20:35,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:20:35,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:20:35,931 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:20:35,931 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:20:35,932 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:20:35,932 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:20:35,932 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:20:35,932 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:20:35,933 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:20:35,933 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:20:35,933 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:20:35,933 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:20:35,934 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:20:35,934 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:20:35,934 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:20:35,934 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:20:35,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:20:35,935 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:20:35,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:20:35,935 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:20:35,935 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:20:35,935 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:20:35,936 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:20:35,936 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:20:35,936 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:20:35,936 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:20:35,936 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:20:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:20:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:20:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:20:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:20:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:20:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:20:35,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:20:35,938 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:20:35,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:20:35,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:20:35,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:20:35,938 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:20:35,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:20:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:20:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:20:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-02 12:20:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:20:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-02 12:20:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:20:35,939 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:20:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:20:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:20:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:20:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:20:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:20:35,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:20:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:20:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:20:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:20:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:20:35,941 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:20:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:20:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:20:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:20:35,942 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:20:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:20:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:20:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:20:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:20:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:20:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:20:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:20:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:20:35,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:20:35,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:20:35,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:20:35,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:20:35,946 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:20:35,946 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:20:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:20:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:20:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:20:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:20:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:20:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:20:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:20:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:20:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:20:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:20:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:20:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:20:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:20:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:20:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:20:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:20:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:20:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:20:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:20:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:20:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:20:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:20:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:20:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:20:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:20:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:20:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:20:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:20:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:20:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:20:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:20:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:20:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:20:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:20:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:20:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:20:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:20:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:20:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:20:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:20:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:20:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:20:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:20:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:20:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:20:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:20:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:20:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:20:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:20:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:20:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:20:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:20:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:20:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:20:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:20:35,958 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:20:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:20:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:20:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:20:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:20:35,959 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:20:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:20:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:20:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-02 12:20:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:20:35,960 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-02 12:20:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:20:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:20:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:20:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:20:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:20:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:20:35,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:20:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:20:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:20:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:20:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:20:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:20:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:20:35,962 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:20:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:20:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:20:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:20:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:20:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:20:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:20:35,963 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:20:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:20:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:20:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:20:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:20:35,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:20:38,473 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:20:38,474 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:20:38,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:20:38 BoogieIcfgContainer [2019-10-02 12:20:38,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:20:38,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:20:38,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:20:38,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:20:38,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:20:34" (1/3) ... [2019-10-02 12:20:38,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a6e763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:20:38, skipping insertion in model container [2019-10-02 12:20:38,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:20:35" (2/3) ... [2019-10-02 12:20:38,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a6e763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:20:38, skipping insertion in model container [2019-10-02 12:20:38,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:20:38" (3/3) ... [2019-10-02 12:20:38,484 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2019-10-02 12:20:38,494 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:20:38,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:20:38,523 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:20:38,561 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:20:38,562 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:20:38,562 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:20:38,562 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:20:38,562 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:20:38,563 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:20:38,563 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:20:38,563 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:20:38,563 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:20:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-10-02 12:20:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 12:20:38,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:38,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,620 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:38,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1815299235, now seen corresponding path program 1 times [2019-10-02 12:20:38,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:38,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:38,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:39,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:39,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:39,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:39,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:39,277 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-10-02 12:20:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:39,528 INFO L93 Difference]: Finished difference Result 1197 states and 1943 transitions. [2019-10-02 12:20:39,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:39,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-02 12:20:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:39,560 INFO L225 Difference]: With dead ends: 1197 [2019-10-02 12:20:39,560 INFO L226 Difference]: Without dead ends: 607 [2019-10-02 12:20:39,576 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:20:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-02 12:20:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-02 12:20:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 12:20:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 973 transitions. [2019-10-02 12:20:39,747 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 973 transitions. Word has length 85 [2019-10-02 12:20:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:39,748 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 973 transitions. [2019-10-02 12:20:39,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 973 transitions. [2019-10-02 12:20:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 12:20:39,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:39,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,763 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1195495049, now seen corresponding path program 1 times [2019-10-02 12:20:39,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:39,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:39,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:39,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:39,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:39,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:39,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:39,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:39,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:39,984 INFO L87 Difference]: Start difference. First operand 607 states and 973 transitions. Second operand 4 states. [2019-10-02 12:20:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:40,074 INFO L93 Difference]: Finished difference Result 1177 states and 1904 transitions. [2019-10-02 12:20:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:40,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-02 12:20:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:40,087 INFO L225 Difference]: With dead ends: 1177 [2019-10-02 12:20:40,087 INFO L226 Difference]: Without dead ends: 607 [2019-10-02 12:20:40,093 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:20:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-02 12:20:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-02 12:20:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 12:20:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 972 transitions. [2019-10-02 12:20:40,149 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 972 transitions. Word has length 88 [2019-10-02 12:20:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:40,149 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 972 transitions. [2019-10-02 12:20:40,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 972 transitions. [2019-10-02 12:20:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 12:20:40,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:40,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,155 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:40,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash -709071794, now seen corresponding path program 1 times [2019-10-02 12:20:40,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:40,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:40,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:40,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:40,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:40,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:40,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:40,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:40,338 INFO L87 Difference]: Start difference. First operand 607 states and 972 transitions. Second operand 4 states. [2019-10-02 12:20:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:40,424 INFO L93 Difference]: Finished difference Result 1177 states and 1903 transitions. [2019-10-02 12:20:40,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:40,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-02 12:20:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:40,433 INFO L225 Difference]: With dead ends: 1177 [2019-10-02 12:20:40,433 INFO L226 Difference]: Without dead ends: 607 [2019-10-02 12:20:40,436 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:20:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-02 12:20:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-02 12:20:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 12:20:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 971 transitions. [2019-10-02 12:20:40,472 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 971 transitions. Word has length 89 [2019-10-02 12:20:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:40,473 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 971 transitions. [2019-10-02 12:20:40,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 971 transitions. [2019-10-02 12:20:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 12:20:40,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:40,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,476 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:40,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1566496723, now seen corresponding path program 1 times [2019-10-02 12:20:40,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:40,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:40,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:40,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:40,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:40,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:40,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:40,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:40,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:40,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:40,642 INFO L87 Difference]: Start difference. First operand 607 states and 971 transitions. Second operand 4 states. [2019-10-02 12:20:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:40,752 INFO L93 Difference]: Finished difference Result 1177 states and 1902 transitions. [2019-10-02 12:20:40,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:40,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 12:20:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:40,758 INFO L225 Difference]: With dead ends: 1177 [2019-10-02 12:20:40,758 INFO L226 Difference]: Without dead ends: 607 [2019-10-02 12:20:40,761 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:20:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-02 12:20:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-02 12:20:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 12:20:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 970 transitions. [2019-10-02 12:20:40,786 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 970 transitions. Word has length 90 [2019-10-02 12:20:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:40,786 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 970 transitions. [2019-10-02 12:20:40,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2019-10-02 12:20:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 12:20:40,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:40,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,789 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash -823973782, now seen corresponding path program 1 times [2019-10-02 12:20:40,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:40,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:40,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:40,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:40,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:40,921 INFO L87 Difference]: Start difference. First operand 607 states and 970 transitions. Second operand 4 states. [2019-10-02 12:20:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:40,981 INFO L93 Difference]: Finished difference Result 1177 states and 1901 transitions. [2019-10-02 12:20:40,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:40,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 12:20:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:40,987 INFO L225 Difference]: With dead ends: 1177 [2019-10-02 12:20:40,987 INFO L226 Difference]: Without dead ends: 607 [2019-10-02 12:20:40,991 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:20:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-02 12:20:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-02 12:20:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 12:20:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 969 transitions. [2019-10-02 12:20:41,015 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 969 transitions. Word has length 91 [2019-10-02 12:20:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:41,016 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 969 transitions. [2019-10-02 12:20:41,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 969 transitions. [2019-10-02 12:20:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:20:41,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:41,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,019 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1832765905, now seen corresponding path program 1 times [2019-10-02 12:20:41,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:41,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:41,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:41,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:41,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:20:41,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:20:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:20:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:20:41,263 INFO L87 Difference]: Start difference. First operand 607 states and 969 transitions. Second operand 10 states. [2019-10-02 12:20:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:41,453 INFO L93 Difference]: Finished difference Result 1135 states and 1821 transitions. [2019-10-02 12:20:41,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:20:41,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-02 12:20:41,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:41,460 INFO L225 Difference]: With dead ends: 1135 [2019-10-02 12:20:41,468 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 12:20:41,472 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:20:41,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 12:20:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-10-02 12:20:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-02 12:20:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 978 transitions. [2019-10-02 12:20:41,524 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 978 transitions. Word has length 92 [2019-10-02 12:20:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:41,525 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 978 transitions. [2019-10-02 12:20:41,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:20:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 978 transitions. [2019-10-02 12:20:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:20:41,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:41,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,529 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1812428530, now seen corresponding path program 1 times [2019-10-02 12:20:41,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:41,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:41,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:41,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:41,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:41,630 INFO L87 Difference]: Start difference. First operand 614 states and 978 transitions. Second operand 4 states. [2019-10-02 12:20:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:41,701 INFO L93 Difference]: Finished difference Result 1183 states and 1907 transitions. [2019-10-02 12:20:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:20:41,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 12:20:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:41,709 INFO L225 Difference]: With dead ends: 1183 [2019-10-02 12:20:41,709 INFO L226 Difference]: Without dead ends: 601 [2019-10-02 12:20:41,713 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:20:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-02 12:20:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-02 12:20:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-02 12:20:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 955 transitions. [2019-10-02 12:20:41,741 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 955 transitions. Word has length 92 [2019-10-02 12:20:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:41,741 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 955 transitions. [2019-10-02 12:20:41,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 955 transitions. [2019-10-02 12:20:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:20:41,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:41,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,746 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1505086713, now seen corresponding path program 1 times [2019-10-02 12:20:41,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:41,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:41,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:41,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:41,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:41,971 INFO L87 Difference]: Start difference. First operand 601 states and 955 transitions. Second operand 6 states. [2019-10-02 12:20:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:42,177 INFO L93 Difference]: Finished difference Result 1123 states and 1799 transitions. [2019-10-02 12:20:42,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:42,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-02 12:20:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:42,183 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 12:20:42,183 INFO L226 Difference]: Without dead ends: 601 [2019-10-02 12:20:42,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:20:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-02 12:20:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-02 12:20:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-02 12:20:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 951 transitions. [2019-10-02 12:20:42,208 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 951 transitions. Word has length 93 [2019-10-02 12:20:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:42,208 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 951 transitions. [2019-10-02 12:20:42,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 951 transitions. [2019-10-02 12:20:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:20:42,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:42,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,211 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash 150462354, now seen corresponding path program 1 times [2019-10-02 12:20:42,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:42,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:42,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:42,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:42,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:42,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:42,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:42,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:42,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:42,337 INFO L87 Difference]: Start difference. First operand 601 states and 951 transitions. Second operand 6 states. [2019-10-02 12:20:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:42,540 INFO L93 Difference]: Finished difference Result 1123 states and 1795 transitions. [2019-10-02 12:20:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:42,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-02 12:20:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:42,547 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 12:20:42,547 INFO L226 Difference]: Without dead ends: 601 [2019-10-02 12:20:42,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:20:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-02 12:20:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-02 12:20:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-02 12:20:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 947 transitions. [2019-10-02 12:20:42,584 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 947 transitions. Word has length 94 [2019-10-02 12:20:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:42,584 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 947 transitions. [2019-10-02 12:20:42,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 947 transitions. [2019-10-02 12:20:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:20:42,587 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:42,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,587 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash -105920916, now seen corresponding path program 1 times [2019-10-02 12:20:42,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:42,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:42,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:42,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:42,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:42,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:42,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:42,716 INFO L87 Difference]: Start difference. First operand 601 states and 947 transitions. Second operand 6 states. [2019-10-02 12:20:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:42,881 INFO L93 Difference]: Finished difference Result 1123 states and 1791 transitions. [2019-10-02 12:20:42,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:42,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 12:20:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:42,887 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 12:20:42,888 INFO L226 Difference]: Without dead ends: 601 [2019-10-02 12:20:42,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:20:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-02 12:20:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-02 12:20:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-02 12:20:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 943 transitions. [2019-10-02 12:20:42,912 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 943 transitions. Word has length 95 [2019-10-02 12:20:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:42,913 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 943 transitions. [2019-10-02 12:20:42,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 943 transitions. [2019-10-02 12:20:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:20:42,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:42,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,915 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash 941933292, now seen corresponding path program 1 times [2019-10-02 12:20:42,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:42,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:42,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:42,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:42,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:43,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:43,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:20:43,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:20:43,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:20:43,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:20:43,100 INFO L87 Difference]: Start difference. First operand 601 states and 943 transitions. Second operand 7 states. [2019-10-02 12:20:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:43,181 INFO L93 Difference]: Finished difference Result 1123 states and 1787 transitions. [2019-10-02 12:20:43,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:20:43,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 12:20:43,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:43,186 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 12:20:43,187 INFO L226 Difference]: Without dead ends: 580 [2019-10-02 12:20:43,191 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:20:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-02 12:20:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-02 12:20:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-02 12:20:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 909 transitions. [2019-10-02 12:20:43,216 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 909 transitions. Word has length 95 [2019-10-02 12:20:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:43,216 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 909 transitions. [2019-10-02 12:20:43,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:20:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 909 transitions. [2019-10-02 12:20:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:20:43,218 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:43,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,219 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 497335511, now seen corresponding path program 1 times [2019-10-02 12:20:43,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:43,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:43,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:43,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:43,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:43,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:43,377 INFO L87 Difference]: Start difference. First operand 580 states and 909 transitions. Second operand 6 states. [2019-10-02 12:20:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:43,499 INFO L93 Difference]: Finished difference Result 1102 states and 1753 transitions. [2019-10-02 12:20:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:43,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 12:20:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:43,506 INFO L225 Difference]: With dead ends: 1102 [2019-10-02 12:20:43,507 INFO L226 Difference]: Without dead ends: 580 [2019-10-02 12:20:43,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:20:43,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-02 12:20:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-02 12:20:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-02 12:20:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 908 transitions. [2019-10-02 12:20:43,544 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 908 transitions. Word has length 96 [2019-10-02 12:20:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:43,546 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 908 transitions. [2019-10-02 12:20:43,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 908 transitions. [2019-10-02 12:20:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:20:43,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:43,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,549 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1979618769, now seen corresponding path program 1 times [2019-10-02 12:20:43,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:43,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:43,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:43,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:43,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:20:43,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:20:43,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:20:43,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:43,714 INFO L87 Difference]: Start difference. First operand 580 states and 908 transitions. Second operand 6 states. [2019-10-02 12:20:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:43,809 INFO L93 Difference]: Finished difference Result 1102 states and 1752 transitions. [2019-10-02 12:20:43,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:20:43,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 12:20:43,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:43,815 INFO L225 Difference]: With dead ends: 1102 [2019-10-02 12:20:43,816 INFO L226 Difference]: Without dead ends: 580 [2019-10-02 12:20:43,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:20:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-02 12:20:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-02 12:20:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-02 12:20:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 907 transitions. [2019-10-02 12:20:43,851 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 907 transitions. Word has length 97 [2019-10-02 12:20:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:43,853 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 907 transitions. [2019-10-02 12:20:43,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:20:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 907 transitions. [2019-10-02 12:20:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:20:43,855 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:43,856 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:43,856 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash 646962716, now seen corresponding path program 1 times [2019-10-02 12:20:43,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:43,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:43,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:44,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:44,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:20:44,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:20:44,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:20:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:20:44,052 INFO L87 Difference]: Start difference. First operand 580 states and 907 transitions. Second operand 12 states. [2019-10-02 12:20:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:44,246 INFO L93 Difference]: Finished difference Result 1103 states and 1751 transitions. [2019-10-02 12:20:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:20:44,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-02 12:20:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:44,252 INFO L225 Difference]: With dead ends: 1103 [2019-10-02 12:20:44,252 INFO L226 Difference]: Without dead ends: 580 [2019-10-02 12:20:44,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:20:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-02 12:20:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-02 12:20:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-02 12:20:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 906 transitions. [2019-10-02 12:20:44,279 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 906 transitions. Word has length 98 [2019-10-02 12:20:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:44,279 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 906 transitions. [2019-10-02 12:20:44,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:20:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 906 transitions. [2019-10-02 12:20:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:20:44,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:44,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:44,283 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1922891352, now seen corresponding path program 1 times [2019-10-02 12:20:44,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:44,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:44,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:44,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:44,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:20:44,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:20:44,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:20:44,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:20:44,528 INFO L87 Difference]: Start difference. First operand 580 states and 906 transitions. Second operand 9 states. [2019-10-02 12:20:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:51,234 INFO L93 Difference]: Finished difference Result 1574 states and 2521 transitions. [2019-10-02 12:20:51,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 12:20:51,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-10-02 12:20:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:51,244 INFO L225 Difference]: With dead ends: 1574 [2019-10-02 12:20:51,244 INFO L226 Difference]: Without dead ends: 1060 [2019-10-02 12:20:51,250 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:20:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-02 12:20:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1028. [2019-10-02 12:20:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-10-02 12:20:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1603 transitions. [2019-10-02 12:20:51,300 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1603 transitions. Word has length 99 [2019-10-02 12:20:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:51,300 INFO L475 AbstractCegarLoop]: Abstraction has 1028 states and 1603 transitions. [2019-10-02 12:20:51,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:20:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1603 transitions. [2019-10-02 12:20:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 12:20:51,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:51,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,303 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1808185200, now seen corresponding path program 1 times [2019-10-02 12:20:51,303 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:51,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:51,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:51,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:51,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:20:51,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:20:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:20:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:20:51,476 INFO L87 Difference]: Start difference. First operand 1028 states and 1603 transitions. Second operand 5 states. [2019-10-02 12:20:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:53,516 INFO L93 Difference]: Finished difference Result 3086 states and 4948 transitions. [2019-10-02 12:20:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:20:53,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-02 12:20:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:53,534 INFO L225 Difference]: With dead ends: 3086 [2019-10-02 12:20:53,534 INFO L226 Difference]: Without dead ends: 2125 [2019-10-02 12:20:53,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:20:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-10-02 12:20:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2097. [2019-10-02 12:20:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-10-02 12:20:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3364 transitions. [2019-10-02 12:20:53,660 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3364 transitions. Word has length 100 [2019-10-02 12:20:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:53,661 INFO L475 AbstractCegarLoop]: Abstraction has 2097 states and 3364 transitions. [2019-10-02 12:20:53,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:20:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3364 transitions. [2019-10-02 12:20:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:20:53,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:53,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:53,663 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:53,664 INFO L82 PathProgramCache]: Analyzing trace with hash -220478198, now seen corresponding path program 1 times [2019-10-02 12:20:53,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:53,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:53,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:53,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:53,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:53,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:53,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:53,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:53,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:53,802 INFO L87 Difference]: Start difference. First operand 2097 states and 3364 transitions. Second operand 4 states. [2019-10-02 12:20:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:55,912 INFO L93 Difference]: Finished difference Result 6525 states and 10791 transitions. [2019-10-02 12:20:55,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:20:55,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-02 12:20:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:55,953 INFO L225 Difference]: With dead ends: 6525 [2019-10-02 12:20:55,953 INFO L226 Difference]: Without dead ends: 4496 [2019-10-02 12:20:55,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:20:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2019-10-02 12:20:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4439. [2019-10-02 12:20:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4439 states. [2019-10-02 12:20:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7371 transitions. [2019-10-02 12:20:56,206 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7371 transitions. Word has length 101 [2019-10-02 12:20:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:56,206 INFO L475 AbstractCegarLoop]: Abstraction has 4439 states and 7371 transitions. [2019-10-02 12:20:56,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7371 transitions. [2019-10-02 12:20:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 12:20:56,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:56,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,209 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1753802514, now seen corresponding path program 1 times [2019-10-02 12:20:56,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:56,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:56,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:56,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:56,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:56,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:56,331 INFO L87 Difference]: Start difference. First operand 4439 states and 7371 transitions. Second operand 4 states. [2019-10-02 12:20:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:20:58,576 INFO L93 Difference]: Finished difference Result 14169 states and 24563 transitions. [2019-10-02 12:20:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:20:58,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-02 12:20:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:20:58,673 INFO L225 Difference]: With dead ends: 14169 [2019-10-02 12:20:58,673 INFO L226 Difference]: Without dead ends: 9800 [2019-10-02 12:20:58,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:20:58,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9800 states. [2019-10-02 12:20:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9800 to 9682. [2019-10-02 12:20:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2019-10-02 12:20:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 16883 transitions. [2019-10-02 12:20:59,376 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 16883 transitions. Word has length 102 [2019-10-02 12:20:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:59,376 INFO L475 AbstractCegarLoop]: Abstraction has 9682 states and 16883 transitions. [2019-10-02 12:20:59,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 16883 transitions. [2019-10-02 12:20:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 12:20:59,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:59,380 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,380 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1468000948, now seen corresponding path program 1 times [2019-10-02 12:20:59,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:59,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:59,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:59,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:20:59,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:59,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:59,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:59,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:59,517 INFO L87 Difference]: Start difference. First operand 9682 states and 16883 transitions. Second operand 4 states. [2019-10-02 12:21:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:03,160 INFO L93 Difference]: Finished difference Result 31568 states and 58826 transitions. [2019-10-02 12:21:03,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:21:03,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-02 12:21:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:03,383 INFO L225 Difference]: With dead ends: 31568 [2019-10-02 12:21:03,383 INFO L226 Difference]: Without dead ends: 21960 [2019-10-02 12:21:03,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:21:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21960 states. [2019-10-02 12:21:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21960 to 21709. [2019-10-02 12:21:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21709 states. [2019-10-02 12:21:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21709 states to 21709 states and 40667 transitions. [2019-10-02 12:21:04,950 INFO L78 Accepts]: Start accepts. Automaton has 21709 states and 40667 transitions. Word has length 103 [2019-10-02 12:21:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:04,950 INFO L475 AbstractCegarLoop]: Abstraction has 21709 states and 40667 transitions. [2019-10-02 12:21:04,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21709 states and 40667 transitions. [2019-10-02 12:21:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 12:21:04,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:04,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:04,953 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1735310740, now seen corresponding path program 1 times [2019-10-02 12:21:04,954 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:04,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:04,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:04,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:04,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:21:05,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:05,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:21:05,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:21:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:21:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:21:05,059 INFO L87 Difference]: Start difference. First operand 21709 states and 40667 transitions. Second operand 4 states. [2019-10-02 12:21:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:09,114 INFO L93 Difference]: Finished difference Result 72199 states and 150016 transitions. [2019-10-02 12:21:09,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:21:09,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-02 12:21:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:09,738 INFO L225 Difference]: With dead ends: 72199 [2019-10-02 12:21:09,740 INFO L226 Difference]: Without dead ends: 50560 [2019-10-02 12:21:10,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:21:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50560 states. [2019-10-02 12:21:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50560 to 50010. [2019-10-02 12:21:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50010 states. [2019-10-02 12:21:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50010 states to 50010 states and 103931 transitions. [2019-10-02 12:21:15,656 INFO L78 Accepts]: Start accepts. Automaton has 50010 states and 103931 transitions. Word has length 104 [2019-10-02 12:21:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:15,657 INFO L475 AbstractCegarLoop]: Abstraction has 50010 states and 103931 transitions. [2019-10-02 12:21:15,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:21:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 50010 states and 103931 transitions. [2019-10-02 12:21:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 12:21:15,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:15,686 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:15,686 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:15,687 INFO L82 PathProgramCache]: Analyzing trace with hash -655687788, now seen corresponding path program 1 times [2019-10-02 12:21:15,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:15,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:15,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:15,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 12:21:15,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:21:15,883 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:21:15,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:16,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 4110 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 12:21:16,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:21:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 12:21:16,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:21:16,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-10-02 12:21:16,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:21:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:21:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:21:16,913 INFO L87 Difference]: Start difference. First operand 50010 states and 103931 transitions. Second operand 12 states. [2019-10-02 12:21:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:31,006 INFO L93 Difference]: Finished difference Result 109490 states and 227605 transitions. [2019-10-02 12:21:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:21:31,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 282 [2019-10-02 12:21:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:31,589 INFO L225 Difference]: With dead ends: 109490 [2019-10-02 12:21:31,590 INFO L226 Difference]: Without dead ends: 59511 [2019-10-02 12:21:31,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-10-02 12:21:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59511 states. [2019-10-02 12:21:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59511 to 53928. [2019-10-02 12:21:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53928 states. [2019-10-02 12:21:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53928 states to 53928 states and 110772 transitions. [2019-10-02 12:21:37,901 INFO L78 Accepts]: Start accepts. Automaton has 53928 states and 110772 transitions. Word has length 282 [2019-10-02 12:21:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:21:37,901 INFO L475 AbstractCegarLoop]: Abstraction has 53928 states and 110772 transitions. [2019-10-02 12:21:37,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:21:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 53928 states and 110772 transitions. [2019-10-02 12:21:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:21:37,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:21:37,956 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:21:37,956 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:21:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:21:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -851689544, now seen corresponding path program 1 times [2019-10-02 12:21:37,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:21:37,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:21:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:37,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:21:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:21:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:21:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 12:21:38,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:21:38,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:21:38,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:21:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:21:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:21:38,174 INFO L87 Difference]: Start difference. First operand 53928 states and 110772 transitions. Second operand 12 states. [2019-10-02 12:21:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:21:52,620 INFO L93 Difference]: Finished difference Result 150537 states and 324719 transitions. [2019-10-02 12:21:52,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:21:52,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2019-10-02 12:21:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:21:54,049 INFO L225 Difference]: With dead ends: 150537 [2019-10-02 12:21:54,049 INFO L226 Difference]: Without dead ends: 96675 [2019-10-02 12:21:54,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:21:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96675 states. [2019-10-02 12:22:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96675 to 95285. [2019-10-02 12:22:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95285 states. [2019-10-02 12:22:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95285 states to 95285 states and 199703 transitions. [2019-10-02 12:22:02,665 INFO L78 Accepts]: Start accepts. Automaton has 95285 states and 199703 transitions. Word has length 228 [2019-10-02 12:22:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:02,665 INFO L475 AbstractCegarLoop]: Abstraction has 95285 states and 199703 transitions. [2019-10-02 12:22:02,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:22:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 95285 states and 199703 transitions. [2019-10-02 12:22:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:22:02,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:02,706 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:02,707 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash -505631221, now seen corresponding path program 1 times [2019-10-02 12:22:02,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:02,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:02,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 12:22:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:02,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:22:02,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:22:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:22:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:22:02,931 INFO L87 Difference]: Start difference. First operand 95285 states and 199703 transitions. Second operand 9 states. [2019-10-02 12:22:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:13,653 INFO L93 Difference]: Finished difference Result 191824 states and 428603 transitions. [2019-10-02 12:22:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:22:13,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2019-10-02 12:22:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:14,348 INFO L225 Difference]: With dead ends: 191824 [2019-10-02 12:22:14,348 INFO L226 Difference]: Without dead ends: 96605 [2019-10-02 12:22:14,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:22:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96605 states. [2019-10-02 12:22:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96605 to 96077. [2019-10-02 12:22:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96077 states. [2019-10-02 12:22:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96077 states to 96077 states and 202079 transitions. [2019-10-02 12:22:25,095 INFO L78 Accepts]: Start accepts. Automaton has 96077 states and 202079 transitions. Word has length 229 [2019-10-02 12:22:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:22:25,095 INFO L475 AbstractCegarLoop]: Abstraction has 96077 states and 202079 transitions. [2019-10-02 12:22:25,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:22:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 96077 states and 202079 transitions. [2019-10-02 12:22:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:22:25,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:22:25,127 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:22:25,127 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:22:25,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:22:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash 443189989, now seen corresponding path program 1 times [2019-10-02 12:22:25,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:22:25,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:22:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:25,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:22:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:22:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:22:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 12:22:25,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:22:25,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:22:25,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:22:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:22:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:22:25,309 INFO L87 Difference]: Start difference. First operand 96077 states and 202079 transitions. Second operand 8 states. [2019-10-02 12:22:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:46,728 INFO L93 Difference]: Finished difference Result 310899 states and 700482 transitions. [2019-10-02 12:22:46,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:22:46,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-10-02 12:22:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:48,180 INFO L225 Difference]: With dead ends: 310899 [2019-10-02 12:22:48,180 INFO L226 Difference]: Without dead ends: 214690 [2019-10-02 12:22:48,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:22:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214690 states. [2019-10-02 12:22:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214690 to 212320. [2019-10-02 12:22:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212320 states. [2019-10-02 12:23:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212320 states to 212320 states and 462370 transitions. [2019-10-02 12:23:11,133 INFO L78 Accepts]: Start accepts. Automaton has 212320 states and 462370 transitions. Word has length 230 [2019-10-02 12:23:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:23:11,133 INFO L475 AbstractCegarLoop]: Abstraction has 212320 states and 462370 transitions. [2019-10-02 12:23:11,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:23:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 212320 states and 462370 transitions. [2019-10-02 12:23:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:23:11,155 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:23:11,156 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:23:11,156 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:23:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:23:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1236122835, now seen corresponding path program 1 times [2019-10-02 12:23:11,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:23:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:23:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:11,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:23:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:23:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:23:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 12:23:11,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:23:11,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:23:11,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:23:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:23:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:23:11,380 INFO L87 Difference]: Start difference. First operand 212320 states and 462370 transitions. Second operand 9 states. [2019-10-02 12:24:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:24:17,732 INFO L93 Difference]: Finished difference Result 804893 states and 2425074 transitions. [2019-10-02 12:24:17,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:24:17,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 236 [2019-10-02 12:24:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:24:24,645 INFO L225 Difference]: With dead ends: 804893 [2019-10-02 12:24:24,646 INFO L226 Difference]: Without dead ends: 592447 [2019-10-02 12:24:40,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:24:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592447 states. [2019-10-02 12:26:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592447 to 510169. [2019-10-02 12:26:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510169 states.