java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:30:15,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:30:15,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:30:15,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:30:15,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:30:15,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:30:15,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:30:15,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:30:15,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:30:15,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:30:15,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:30:15,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:30:15,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:30:15,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:30:15,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:30:15,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:30:15,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:30:15,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:30:15,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:30:15,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:30:15,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:30:15,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:30:15,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:30:15,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:30:15,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:30:15,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:30:15,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:30:15,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:30:15,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:30:15,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:30:15,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:30:15,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:30:15,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:30:15,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:30:15,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:30:15,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:30:15,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:30:15,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:30:15,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:30:15,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:30:15,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:30:15,381 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:30:15,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:30:15,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:30:15,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:30:15,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:30:15,402 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:30:15,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:30:15,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:30:15,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:30:15,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:30:15,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:30:15,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:30:15,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:30:15,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:30:15,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:30:15,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:30:15,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:30:15,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:30:15,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:30:15,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:30:15,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:30:15,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:30:15,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:30:15,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:30:15,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:30:15,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:30:15,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:30:15,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:30:15,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:30:15,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:30:15,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:30:15,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:30:15,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:30:15,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:30:15,492 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:30:15,493 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c [2019-10-02 12:30:15,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733b3a93a/1406c2f8636142928d7120a6558cf786/FLAG6c744edb7 [2019-10-02 12:30:16,221 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:30:16,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product23.cil.c [2019-10-02 12:30:16,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733b3a93a/1406c2f8636142928d7120a6558cf786/FLAG6c744edb7 [2019-10-02 12:30:16,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733b3a93a/1406c2f8636142928d7120a6558cf786 [2019-10-02 12:30:16,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:30:16,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:30:16,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:30:16,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:30:16,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:30:16,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:30:16" (1/1) ... [2019-10-02 12:30:16,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a632ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:16, skipping insertion in model container [2019-10-02 12:30:16,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:30:16" (1/1) ... [2019-10-02 12:30:16,415 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:30:16,512 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:30:17,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:30:17,235 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:30:17,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:30:17,480 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:30:17,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17 WrapperNode [2019-10-02 12:30:17,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:30:17,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:30:17,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:30:17,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:30:17,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... [2019-10-02 12:30:17,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... [2019-10-02 12:30:17,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... [2019-10-02 12:30:17,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... [2019-10-02 12:30:17,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... [2019-10-02 12:30:17,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... [2019-10-02 12:30:17,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... [2019-10-02 12:30:17,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:30:17,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:30:17,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:30:17,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:30:17,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:30:17,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:30:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:30:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:30:17,810 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:30:17,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:30:17,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:30:17,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:30:17,812 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:30:17,812 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:30:17,812 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:30:17,812 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:30:17,813 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:30:17,813 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:30:17,813 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:30:17,814 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:30:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:30:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:30:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:30:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:30:17,817 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:30:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:30:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:30:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:30:17,818 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:30:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:30:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:30:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:30:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:30:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:30:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:30:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:30:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:30:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:30:17,820 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:30:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:30:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:30:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:30:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:30:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:30:17,821 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:30:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:30:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:30:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:30:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:30:17,822 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:30:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:30:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:30:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:30:17,823 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:30:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:30:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:30:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:30:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:30:17,824 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:30:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:30:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:30:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:30:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:30:17,825 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:30:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:30:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:30:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:30:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:30:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:30:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:30:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:30:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:30:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:30:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:30:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:30:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:30:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:30:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:30:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:30:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:30:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:30:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:30:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:30:17,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:30:17,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:30:17,831 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:30:17,832 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:30:17,832 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:30:17,832 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:30:17,833 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:30:17,833 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:30:17,833 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:30:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:30:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:30:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:30:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:30:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:30:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:30:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:30:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:30:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:30:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:30:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:30:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:30:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:30:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:30:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:30:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:30:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:30:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:30:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:30:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:30:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:30:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:30:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:30:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:30:17,838 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:30:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:30:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:30:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:30:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:30:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:30:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:30:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:30:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:30:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:30:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:30:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:30:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:30:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:30:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:30:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:30:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:30:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:30:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:30:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:30:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:30:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:30:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:30:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:30:17,844 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:30:17,844 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:30:17,844 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:30:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:30:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:30:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:30:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:30:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:30:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:30:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:30:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:30:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:30:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:30:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:30:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:30:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:30:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:30:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:30:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:30:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:30:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:30:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:30:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:30:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:30:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:30:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:30:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:30:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:30:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:30:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:30:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:30:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:30:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:30:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:30:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:30:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:30:20,179 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:30:20,180 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:30:20,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:30:20 BoogieIcfgContainer [2019-10-02 12:30:20,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:30:20,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:30:20,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:30:20,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:30:20,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:30:16" (1/3) ... [2019-10-02 12:30:20,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e43d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:30:20, skipping insertion in model container [2019-10-02 12:30:20,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:30:17" (2/3) ... [2019-10-02 12:30:20,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e43d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:30:20, skipping insertion in model container [2019-10-02 12:30:20,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:30:20" (3/3) ... [2019-10-02 12:30:20,191 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product23.cil.c [2019-10-02 12:30:20,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:30:20,213 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:30:20,232 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:30:20,283 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:30:20,283 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:30:20,284 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:30:20,284 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:30:20,284 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:30:20,284 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:30:20,285 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:30:20,285 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:30:20,285 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:30:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states. [2019-10-02 12:30:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:30:20,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:20,363 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:20,366 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:20,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1013618199, now seen corresponding path program 1 times [2019-10-02 12:30:20,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:20,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:20,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:20,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:20,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:21,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:21,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:21,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:21,291 INFO L87 Difference]: Start difference. First operand 821 states. Second operand 7 states. [2019-10-02 12:30:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:21,600 INFO L93 Difference]: Finished difference Result 1321 states and 2120 transitions. [2019-10-02 12:30:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:30:21,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-02 12:30:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:21,640 INFO L225 Difference]: With dead ends: 1321 [2019-10-02 12:30:21,640 INFO L226 Difference]: Without dead ends: 669 [2019-10-02 12:30:21,655 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:30:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-10-02 12:30:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2019-10-02 12:30:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-02 12:30:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1055 transitions. [2019-10-02 12:30:21,821 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1055 transitions. Word has length 141 [2019-10-02 12:30:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:21,822 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 1055 transitions. [2019-10-02 12:30:21,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1055 transitions. [2019-10-02 12:30:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:30:21,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:21,845 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:21,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1339739785, now seen corresponding path program 1 times [2019-10-02 12:30:21,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:21,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:21,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:21,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:21,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:22,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:22,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:30:22,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:30:22,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:30:22,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:30:22,100 INFO L87 Difference]: Start difference. First operand 667 states and 1055 transitions. Second operand 4 states. [2019-10-02 12:30:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:22,176 INFO L93 Difference]: Finished difference Result 1300 states and 2075 transitions. [2019-10-02 12:30:22,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:30:22,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-02 12:30:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:22,183 INFO L225 Difference]: With dead ends: 1300 [2019-10-02 12:30:22,183 INFO L226 Difference]: Without dead ends: 649 [2019-10-02 12:30:22,188 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:30:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-02 12:30:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2019-10-02 12:30:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-10-02 12:30:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1022 transitions. [2019-10-02 12:30:22,227 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1022 transitions. Word has length 142 [2019-10-02 12:30:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:22,228 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1022 transitions. [2019-10-02 12:30:22,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:30:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1022 transitions. [2019-10-02 12:30:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:30:22,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:22,234 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:22,235 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash -415526825, now seen corresponding path program 1 times [2019-10-02 12:30:22,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:22,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:22,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:22,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:22,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:22,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:22,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:22,533 INFO L87 Difference]: Start difference. First operand 649 states and 1022 transitions. Second operand 7 states. [2019-10-02 12:30:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:22,660 INFO L93 Difference]: Finished difference Result 1269 states and 2017 transitions. [2019-10-02 12:30:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:30:22,661 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-02 12:30:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:22,668 INFO L225 Difference]: With dead ends: 1269 [2019-10-02 12:30:22,669 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 12:30:22,672 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:30:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 12:30:22,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-02 12:30:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-02 12:30:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1009 transitions. [2019-10-02 12:30:22,716 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1009 transitions. Word has length 142 [2019-10-02 12:30:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:22,717 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1009 transitions. [2019-10-02 12:30:22,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1009 transitions. [2019-10-02 12:30:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:30:22,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:22,723 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:22,724 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:22,724 INFO L82 PathProgramCache]: Analyzing trace with hash -390482629, now seen corresponding path program 1 times [2019-10-02 12:30:22,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:22,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:22,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:22,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:22,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:22,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:22,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:22,941 INFO L87 Difference]: Start difference. First operand 643 states and 1009 transitions. Second operand 7 states. [2019-10-02 12:30:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:23,049 INFO L93 Difference]: Finished difference Result 1257 states and 1991 transitions. [2019-10-02 12:30:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:30:23,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 12:30:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:23,059 INFO L225 Difference]: With dead ends: 1257 [2019-10-02 12:30:23,059 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 12:30:23,066 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:30:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 12:30:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-02 12:30:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-02 12:30:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 996 transitions. [2019-10-02 12:30:23,100 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 996 transitions. Word has length 143 [2019-10-02 12:30:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:23,101 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 996 transitions. [2019-10-02 12:30:23,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 996 transitions. [2019-10-02 12:30:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:30:23,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:23,108 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:23,108 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:23,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:23,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1764754427, now seen corresponding path program 1 times [2019-10-02 12:30:23,109 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:23,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:23,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:23,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:23,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:23,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:23,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:23,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:23,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:23,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:23,315 INFO L87 Difference]: Start difference. First operand 637 states and 996 transitions. Second operand 7 states. [2019-10-02 12:30:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:23,426 INFO L93 Difference]: Finished difference Result 1245 states and 1965 transitions. [2019-10-02 12:30:23,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:30:23,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-02 12:30:23,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:23,493 INFO L225 Difference]: With dead ends: 1245 [2019-10-02 12:30:23,493 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 12:30:23,498 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:30:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 12:30:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-02 12:30:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 12:30:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 983 transitions. [2019-10-02 12:30:23,526 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 983 transitions. Word has length 144 [2019-10-02 12:30:23,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:23,526 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 983 transitions. [2019-10-02 12:30:23,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 983 transitions. [2019-10-02 12:30:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:30:23,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:23,531 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:23,531 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 525807612, now seen corresponding path program 1 times [2019-10-02 12:30:23,531 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:23,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:23,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:23,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:23,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:23,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:23,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:23,758 INFO L87 Difference]: Start difference. First operand 631 states and 983 transitions. Second operand 7 states. [2019-10-02 12:30:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:23,856 INFO L93 Difference]: Finished difference Result 1233 states and 1939 transitions. [2019-10-02 12:30:23,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:30:23,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-02 12:30:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:23,874 INFO L225 Difference]: With dead ends: 1233 [2019-10-02 12:30:23,874 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 12:30:23,880 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:30:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 12:30:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-02 12:30:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 12:30:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 982 transitions. [2019-10-02 12:30:23,907 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 982 transitions. Word has length 144 [2019-10-02 12:30:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:23,909 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 982 transitions. [2019-10-02 12:30:23,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 982 transitions. [2019-10-02 12:30:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:30:23,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:23,914 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:23,914 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1236493407, now seen corresponding path program 1 times [2019-10-02 12:30:23,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:23,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:24,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:24,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:30:24,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:30:24,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:30:24,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:30:24,099 INFO L87 Difference]: Start difference. First operand 631 states and 982 transitions. Second operand 5 states. [2019-10-02 12:30:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:24,187 INFO L93 Difference]: Finished difference Result 1232 states and 1936 transitions. [2019-10-02 12:30:24,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:24,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-02 12:30:24,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:24,192 INFO L225 Difference]: With dead ends: 1232 [2019-10-02 12:30:24,193 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 12:30:24,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:30:24,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 12:30:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-02 12:30:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 12:30:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 981 transitions. [2019-10-02 12:30:24,223 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 981 transitions. Word has length 145 [2019-10-02 12:30:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:24,224 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 981 transitions. [2019-10-02 12:30:24,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:30:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 981 transitions. [2019-10-02 12:30:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:30:24,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:24,231 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:24,231 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1973263729, now seen corresponding path program 1 times [2019-10-02 12:30:24,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:24,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:30:24,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:30:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:30:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:30:24,455 INFO L87 Difference]: Start difference. First operand 631 states and 981 transitions. Second operand 5 states. [2019-10-02 12:30:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:24,540 INFO L93 Difference]: Finished difference Result 1232 states and 1934 transitions. [2019-10-02 12:30:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:24,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-02 12:30:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:24,548 INFO L225 Difference]: With dead ends: 1232 [2019-10-02 12:30:24,548 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 12:30:24,552 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:30:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 12:30:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-02 12:30:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 12:30:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 980 transitions. [2019-10-02 12:30:24,580 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 980 transitions. Word has length 146 [2019-10-02 12:30:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:24,580 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 980 transitions. [2019-10-02 12:30:24,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:30:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 980 transitions. [2019-10-02 12:30:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:30:24,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:24,585 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:24,585 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:24,586 INFO L82 PathProgramCache]: Analyzing trace with hash 696479226, now seen corresponding path program 1 times [2019-10-02 12:30:24,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:24,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:24,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:24,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:24,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:24,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:30:24,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:30:24,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:30:24,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:30:24,736 INFO L87 Difference]: Start difference. First operand 631 states and 980 transitions. Second operand 5 states. [2019-10-02 12:30:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:24,832 INFO L93 Difference]: Finished difference Result 1232 states and 1932 transitions. [2019-10-02 12:30:24,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:24,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-02 12:30:24,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:24,838 INFO L225 Difference]: With dead ends: 1232 [2019-10-02 12:30:24,838 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 12:30:24,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:30:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 12:30:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-02 12:30:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 12:30:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 979 transitions. [2019-10-02 12:30:24,872 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 979 transitions. Word has length 147 [2019-10-02 12:30:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:24,873 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 979 transitions. [2019-10-02 12:30:24,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:30:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 979 transitions. [2019-10-02 12:30:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:30:24,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:24,880 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:24,880 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1424004588, now seen corresponding path program 1 times [2019-10-02 12:30:24,882 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:24,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:24,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:25,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:25,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:30:25,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:30:25,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:30:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:30:25,102 INFO L87 Difference]: Start difference. First operand 631 states and 979 transitions. Second operand 5 states. [2019-10-02 12:30:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:25,194 INFO L93 Difference]: Finished difference Result 1232 states and 1930 transitions. [2019-10-02 12:30:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:25,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-02 12:30:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:25,201 INFO L225 Difference]: With dead ends: 1232 [2019-10-02 12:30:25,201 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 12:30:25,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:30:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 12:30:25,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-10-02 12:30:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-10-02 12:30:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 978 transitions. [2019-10-02 12:30:25,246 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 978 transitions. Word has length 148 [2019-10-02 12:30:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:25,248 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 978 transitions. [2019-10-02 12:30:25,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:30:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 978 transitions. [2019-10-02 12:30:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:30:25,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:25,257 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:25,257 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:25,258 INFO L82 PathProgramCache]: Analyzing trace with hash -139373675, now seen corresponding path program 1 times [2019-10-02 12:30:25,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:25,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:25,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:25,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:30:25,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:30:25,574 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:30:25,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:26,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 3069 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:30:26,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:30:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:30:26,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:30:26,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 12:30:26,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:30:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:30:26,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:30:26,418 INFO L87 Difference]: Start difference. First operand 631 states and 978 transitions. Second operand 9 states. [2019-10-02 12:30:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:32,207 INFO L93 Difference]: Finished difference Result 3868 states and 6170 transitions. [2019-10-02 12:30:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 12:30:32,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-10-02 12:30:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:32,238 INFO L225 Difference]: With dead ends: 3868 [2019-10-02 12:30:32,238 INFO L226 Difference]: Without dead ends: 3271 [2019-10-02 12:30:32,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:30:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2019-10-02 12:30:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3145. [2019-10-02 12:30:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-10-02 12:30:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4932 transitions. [2019-10-02 12:30:32,405 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4932 transitions. Word has length 149 [2019-10-02 12:30:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:32,405 INFO L475 AbstractCegarLoop]: Abstraction has 3145 states and 4932 transitions. [2019-10-02 12:30:32,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:30:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4932 transitions. [2019-10-02 12:30:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:30:32,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:32,412 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:32,412 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1540774986, now seen corresponding path program 1 times [2019-10-02 12:30:32,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:32,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:32,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:32,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:32,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:30:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:30:32,645 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:30:32,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:33,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:30:33,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:30:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:30:33,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:30:33,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:30:33,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:30:33,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:30:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:30:33,481 INFO L87 Difference]: Start difference. First operand 3145 states and 4932 transitions. Second operand 12 states. [2019-10-02 12:30:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:39,510 INFO L93 Difference]: Finished difference Result 10353 states and 16647 transitions. [2019-10-02 12:30:39,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 12:30:39,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2019-10-02 12:30:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:39,572 INFO L225 Difference]: With dead ends: 10353 [2019-10-02 12:30:39,572 INFO L226 Difference]: Without dead ends: 7242 [2019-10-02 12:30:39,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:30:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2019-10-02 12:30:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 4877. [2019-10-02 12:30:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2019-10-02 12:30:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7646 transitions. [2019-10-02 12:30:39,882 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 7646 transitions. Word has length 150 [2019-10-02 12:30:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:39,883 INFO L475 AbstractCegarLoop]: Abstraction has 4877 states and 7646 transitions. [2019-10-02 12:30:39,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:30:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 7646 transitions. [2019-10-02 12:30:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:30:39,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:39,887 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:39,888 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:39,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2120758129, now seen corresponding path program 1 times [2019-10-02 12:30:39,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:39,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:39,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:40,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:40,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:40,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:40,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:40,058 INFO L87 Difference]: Start difference. First operand 4877 states and 7646 transitions. Second operand 7 states. [2019-10-02 12:30:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:43,411 INFO L93 Difference]: Finished difference Result 14409 states and 23109 transitions. [2019-10-02 12:30:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:30:43,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-10-02 12:30:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:43,492 INFO L225 Difference]: With dead ends: 14409 [2019-10-02 12:30:43,492 INFO L226 Difference]: Without dead ends: 9566 [2019-10-02 12:30:43,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:30:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9566 states. [2019-10-02 12:30:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9566 to 9474. [2019-10-02 12:30:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9474 states. [2019-10-02 12:30:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14912 transitions. [2019-10-02 12:30:44,018 INFO L78 Accepts]: Start accepts. Automaton has 9474 states and 14912 transitions. Word has length 152 [2019-10-02 12:30:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:44,019 INFO L475 AbstractCegarLoop]: Abstraction has 9474 states and 14912 transitions. [2019-10-02 12:30:44,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 9474 states and 14912 transitions. [2019-10-02 12:30:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:30:44,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:44,026 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:44,026 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:44,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:44,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1158602431, now seen corresponding path program 1 times [2019-10-02 12:30:44,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:44,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:44,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:30:44,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:44,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:30:44,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:30:44,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:30:44,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:30:44,167 INFO L87 Difference]: Start difference. First operand 9474 states and 14912 transitions. Second operand 4 states. [2019-10-02 12:30:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:44,618 INFO L93 Difference]: Finished difference Result 18515 states and 29475 transitions. [2019-10-02 12:30:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:44,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-02 12:30:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:44,703 INFO L225 Difference]: With dead ends: 18515 [2019-10-02 12:30:44,703 INFO L226 Difference]: Without dead ends: 9063 [2019-10-02 12:30:44,758 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:30:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2019-10-02 12:30:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9005. [2019-10-02 12:30:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9005 states. [2019-10-02 12:30:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 14162 transitions. [2019-10-02 12:30:45,882 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 14162 transitions. Word has length 153 [2019-10-02 12:30:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:45,883 INFO L475 AbstractCegarLoop]: Abstraction has 9005 states and 14162 transitions. [2019-10-02 12:30:45,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:30:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 14162 transitions. [2019-10-02 12:30:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:30:45,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:45,889 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:45,889 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1900086403, now seen corresponding path program 1 times [2019-10-02 12:30:45,890 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:45,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:45,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:45,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:30:46,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:46,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:46,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:46,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:46,092 INFO L87 Difference]: Start difference. First operand 9005 states and 14162 transitions. Second operand 7 states. [2019-10-02 12:30:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:49,164 INFO L93 Difference]: Finished difference Result 26896 states and 43349 transitions. [2019-10-02 12:30:49,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:30:49,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-02 12:30:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:49,280 INFO L225 Difference]: With dead ends: 26896 [2019-10-02 12:30:49,280 INFO L226 Difference]: Without dead ends: 17925 [2019-10-02 12:30:49,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:30:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17925 states. [2019-10-02 12:30:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17925 to 17793. [2019-10-02 12:30:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17793 states. [2019-10-02 12:30:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17793 states to 17793 states and 28263 transitions. [2019-10-02 12:30:50,109 INFO L78 Accepts]: Start accepts. Automaton has 17793 states and 28263 transitions. Word has length 161 [2019-10-02 12:30:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:50,110 INFO L475 AbstractCegarLoop]: Abstraction has 17793 states and 28263 transitions. [2019-10-02 12:30:50,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 17793 states and 28263 transitions. [2019-10-02 12:30:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:30:50,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:50,115 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:50,115 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash -156011429, now seen corresponding path program 1 times [2019-10-02 12:30:50,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:50,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:50,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:50,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:30:50,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:50,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:30:50,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:30:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:30:50,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:30:50,274 INFO L87 Difference]: Start difference. First operand 17793 states and 28263 transitions. Second operand 4 states. [2019-10-02 12:30:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:51,098 INFO L93 Difference]: Finished difference Result 35205 states and 56624 transitions. [2019-10-02 12:30:51,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:51,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-02 12:30:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:51,213 INFO L225 Difference]: With dead ends: 35205 [2019-10-02 12:30:51,213 INFO L226 Difference]: Without dead ends: 17434 [2019-10-02 12:30:51,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:30:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17434 states. [2019-10-02 12:30:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17434 to 17350. [2019-10-02 12:30:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17350 states. [2019-10-02 12:30:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17350 states to 17350 states and 27520 transitions. [2019-10-02 12:30:52,011 INFO L78 Accepts]: Start accepts. Automaton has 17350 states and 27520 transitions. Word has length 162 [2019-10-02 12:30:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:52,012 INFO L475 AbstractCegarLoop]: Abstraction has 17350 states and 27520 transitions. [2019-10-02 12:30:52,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:30:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 17350 states and 27520 transitions. [2019-10-02 12:30:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:30:52,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:52,018 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:52,018 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash -124170817, now seen corresponding path program 1 times [2019-10-02 12:30:52,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:52,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:52,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:30:52,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:52,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:30:52,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:30:52,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:30:52,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:30:52,182 INFO L87 Difference]: Start difference. First operand 17350 states and 27520 transitions. Second operand 7 states. [2019-10-02 12:30:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:56,310 INFO L93 Difference]: Finished difference Result 52072 states and 84958 transitions. [2019-10-02 12:30:56,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:30:56,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-10-02 12:30:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:56,643 INFO L225 Difference]: With dead ends: 52072 [2019-10-02 12:30:56,644 INFO L226 Difference]: Without dead ends: 34756 [2019-10-02 12:30:56,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:30:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34756 states. [2019-10-02 12:30:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34756 to 34556. [2019-10-02 12:30:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34556 states. [2019-10-02 12:30:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34556 states to 34556 states and 55727 transitions. [2019-10-02 12:30:58,218 INFO L78 Accepts]: Start accepts. Automaton has 34556 states and 55727 transitions. Word has length 171 [2019-10-02 12:30:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:30:58,218 INFO L475 AbstractCegarLoop]: Abstraction has 34556 states and 55727 transitions. [2019-10-02 12:30:58,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:30:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34556 states and 55727 transitions. [2019-10-02 12:30:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:30:58,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:30:58,224 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:30:58,224 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:30:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:30:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1814498977, now seen corresponding path program 1 times [2019-10-02 12:30:58,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:30:58,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:30:58,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:58,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:30:58,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:30:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:30:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 12:30:58,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:30:58,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:30:58,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:30:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:30:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:30:58,348 INFO L87 Difference]: Start difference. First operand 34556 states and 55727 transitions. Second operand 4 states. [2019-10-02 12:30:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:30:59,730 INFO L93 Difference]: Finished difference Result 68787 states and 112709 transitions. [2019-10-02 12:30:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:30:59,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-02 12:30:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:30:59,975 INFO L225 Difference]: With dead ends: 68787 [2019-10-02 12:30:59,976 INFO L226 Difference]: Without dead ends: 34253 [2019-10-02 12:31:00,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34253 states. [2019-10-02 12:31:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34253 to 34121. [2019-10-02 12:31:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34121 states. [2019-10-02 12:31:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34121 states to 34121 states and 54937 transitions. [2019-10-02 12:31:03,141 INFO L78 Accepts]: Start accepts. Automaton has 34121 states and 54937 transitions. Word has length 172 [2019-10-02 12:31:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:03,142 INFO L475 AbstractCegarLoop]: Abstraction has 34121 states and 54937 transitions. [2019-10-02 12:31:03,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:31:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 34121 states and 54937 transitions. [2019-10-02 12:31:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:31:03,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:03,148 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:03,148 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1004295635, now seen corresponding path program 1 times [2019-10-02 12:31:03,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:03,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:03,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:03,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:03,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:31:03,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:03,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:31:03,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:31:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:31:03,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:31:03,306 INFO L87 Difference]: Start difference. First operand 34121 states and 54937 transitions. Second operand 7 states. [2019-10-02 12:31:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:07,890 INFO L93 Difference]: Finished difference Result 102590 states and 171018 transitions. [2019-10-02 12:31:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:31:07,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:31:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:08,366 INFO L225 Difference]: With dead ends: 102590 [2019-10-02 12:31:08,366 INFO L226 Difference]: Without dead ends: 68503 [2019-10-02 12:31:08,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:31:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68503 states. [2019-10-02 12:31:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68503 to 68187. [2019-10-02 12:31:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68187 states. [2019-10-02 12:31:12,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68187 states to 68187 states and 112633 transitions. [2019-10-02 12:31:12,709 INFO L78 Accepts]: Start accepts. Automaton has 68187 states and 112633 transitions. Word has length 182 [2019-10-02 12:31:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:12,709 INFO L475 AbstractCegarLoop]: Abstraction has 68187 states and 112633 transitions. [2019-10-02 12:31:12,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:31:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 68187 states and 112633 transitions. [2019-10-02 12:31:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:31:12,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:12,716 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:12,716 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1242831813, now seen corresponding path program 1 times [2019-10-02 12:31:12,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:12,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:12,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:12,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:12,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 12:31:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:31:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:31:12,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:31:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:31:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:31:12,831 INFO L87 Difference]: Start difference. First operand 68187 states and 112633 transitions. Second operand 4 states. [2019-10-02 12:31:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:15,243 INFO L93 Difference]: Finished difference Result 135334 states and 228439 transitions. [2019-10-02 12:31:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:31:15,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-10-02 12:31:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:15,689 INFO L225 Difference]: With dead ends: 135334 [2019-10-02 12:31:15,690 INFO L226 Difference]: Without dead ends: 67163 [2019-10-02 12:31:15,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:31:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67163 states. [2019-10-02 12:31:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67163 to 66895. [2019-10-02 12:31:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66895 states. [2019-10-02 12:31:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66895 states to 66895 states and 110166 transitions. [2019-10-02 12:31:20,838 INFO L78 Accepts]: Start accepts. Automaton has 66895 states and 110166 transitions. Word has length 183 [2019-10-02 12:31:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:20,838 INFO L475 AbstractCegarLoop]: Abstraction has 66895 states and 110166 transitions. [2019-10-02 12:31:20,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:31:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 66895 states and 110166 transitions. [2019-10-02 12:31:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-02 12:31:20,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:20,866 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:20,866 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash 453082171, now seen corresponding path program 1 times [2019-10-02 12:31:20,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:20,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:20,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-02 12:31:21,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:21,082 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:21,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:21,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 3627 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:31:21,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:31:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 12:31:21,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:31:21,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:31:21,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:31:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:31:21,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:31:21,795 INFO L87 Difference]: Start difference. First operand 66895 states and 110166 transitions. Second operand 15 states. [2019-10-02 12:31:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:25,490 INFO L93 Difference]: Finished difference Result 134200 states and 229725 transitions. [2019-10-02 12:31:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:31:25,491 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2019-10-02 12:31:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:25,904 INFO L225 Difference]: With dead ends: 134200 [2019-10-02 12:31:25,905 INFO L226 Difference]: Without dead ends: 67339 [2019-10-02 12:31:26,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:31:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67339 states. [2019-10-02 12:31:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67339 to 67339. [2019-10-02 12:31:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67339 states. [2019-10-02 12:31:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67339 states to 67339 states and 110419 transitions. [2019-10-02 12:31:28,718 INFO L78 Accepts]: Start accepts. Automaton has 67339 states and 110419 transitions. Word has length 277 [2019-10-02 12:31:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:28,718 INFO L475 AbstractCegarLoop]: Abstraction has 67339 states and 110419 transitions. [2019-10-02 12:31:28,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:31:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 67339 states and 110419 transitions. [2019-10-02 12:31:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 12:31:28,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:28,744 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:28,744 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 440893956, now seen corresponding path program 1 times [2019-10-02 12:31:28,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:28,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:28,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:28,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:28,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 23 proven. 47 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-02 12:31:32,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:32,135 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:32,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:32,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 4477 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:31:32,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:31:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-02 12:31:33,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:31:33,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:31:33,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:31:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:31:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:31:33,050 INFO L87 Difference]: Start difference. First operand 67339 states and 110419 transitions. Second operand 15 states. [2019-10-02 12:31:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:36,819 INFO L93 Difference]: Finished difference Result 135231 states and 230054 transitions. [2019-10-02 12:31:36,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:31:36,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 438 [2019-10-02 12:31:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:37,180 INFO L225 Difference]: With dead ends: 135231 [2019-10-02 12:31:37,180 INFO L226 Difference]: Without dead ends: 67926 [2019-10-02 12:31:37,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:31:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67926 states. [2019-10-02 12:31:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67926 to 67926. [2019-10-02 12:31:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67926 states. [2019-10-02 12:31:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67926 states to 67926 states and 110911 transitions. [2019-10-02 12:31:40,015 INFO L78 Accepts]: Start accepts. Automaton has 67926 states and 110911 transitions. Word has length 438 [2019-10-02 12:31:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:40,016 INFO L475 AbstractCegarLoop]: Abstraction has 67926 states and 110911 transitions. [2019-10-02 12:31:40,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:31:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 67926 states and 110911 transitions. [2019-10-02 12:31:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 12:31:40,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:40,039 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:40,039 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1128448837, now seen corresponding path program 1 times [2019-10-02 12:31:40,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:40,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:40,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-10-02 12:31:40,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:40,276 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:40,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:40,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 3635 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:31:40,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:31:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-10-02 12:31:40,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:31:40,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:31:40,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:31:40,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:31:40,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:31:40,984 INFO L87 Difference]: Start difference. First operand 67926 states and 110911 transitions. Second operand 15 states. [2019-10-02 12:31:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:45,149 INFO L93 Difference]: Finished difference Result 136516 states and 230941 transitions. [2019-10-02 12:31:45,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:31:45,150 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 285 [2019-10-02 12:31:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:45,572 INFO L225 Difference]: With dead ends: 136516 [2019-10-02 12:31:45,572 INFO L226 Difference]: Without dead ends: 68624 [2019-10-02 12:31:45,828 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:31:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68624 states. [2019-10-02 12:31:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68624 to 68624. [2019-10-02 12:31:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68624 states. [2019-10-02 12:31:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68624 states to 68624 states and 111562 transitions. [2019-10-02 12:31:48,447 INFO L78 Accepts]: Start accepts. Automaton has 68624 states and 111562 transitions. Word has length 285 [2019-10-02 12:31:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:48,447 INFO L475 AbstractCegarLoop]: Abstraction has 68624 states and 111562 transitions. [2019-10-02 12:31:48,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:31:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 68624 states and 111562 transitions. [2019-10-02 12:31:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-10-02 12:31:48,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:48,469 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:48,469 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1047942080, now seen corresponding path program 1 times [2019-10-02 12:31:48,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:48,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 23 proven. 55 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-10-02 12:31:48,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:48,774 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:48,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:49,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 4487 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:31:49,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:31:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-10-02 12:31:49,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:31:49,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:31:49,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:31:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:31:49,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:31:49,697 INFO L87 Difference]: Start difference. First operand 68624 states and 111562 transitions. Second operand 15 states. [2019-10-02 12:31:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:31:55,696 INFO L93 Difference]: Finished difference Result 138015 states and 232202 transitions. [2019-10-02 12:31:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:31:55,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 448 [2019-10-02 12:31:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:31:56,066 INFO L225 Difference]: With dead ends: 138015 [2019-10-02 12:31:56,066 INFO L226 Difference]: Without dead ends: 69425 [2019-10-02 12:31:56,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:31:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69425 states. [2019-10-02 12:31:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69425 to 69425. [2019-10-02 12:31:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69425 states. [2019-10-02 12:31:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69425 states to 69425 states and 112340 transitions. [2019-10-02 12:31:58,667 INFO L78 Accepts]: Start accepts. Automaton has 69425 states and 112340 transitions. Word has length 448 [2019-10-02 12:31:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:31:58,668 INFO L475 AbstractCegarLoop]: Abstraction has 69425 states and 112340 transitions. [2019-10-02 12:31:58,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:31:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 69425 states and 112340 transitions. [2019-10-02 12:31:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-02 12:31:58,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:31:58,679 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:31:58,680 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:31:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:31:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1225729002, now seen corresponding path program 1 times [2019-10-02 12:31:58,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:31:58,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:31:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:58,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:31:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2019-10-02 12:31:58,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:31:58,955 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:31:59,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:31:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:31:59,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 4492 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 12:31:59,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:32:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 264 proven. 20 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-10-02 12:32:00,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:32:00,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-02 12:32:00,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:32:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:32:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:32:00,046 INFO L87 Difference]: Start difference. First operand 69425 states and 112340 transitions. Second operand 19 states. [2019-10-02 12:32:01,362 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-10-02 12:32:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:32:58,474 INFO L93 Difference]: Finished difference Result 430373 states and 859706 transitions. [2019-10-02 12:32:58,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-02 12:32:58,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 453 [2019-10-02 12:32:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:33:00,733 INFO L225 Difference]: With dead ends: 430373 [2019-10-02 12:33:00,734 INFO L226 Difference]: Without dead ends: 343242 [2019-10-02 12:33:01,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2506 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1141, Invalid=6515, Unknown=0, NotChecked=0, Total=7656 [2019-10-02 12:33:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343242 states. [2019-10-02 12:33:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343242 to 324231. [2019-10-02 12:33:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324231 states. [2019-10-02 12:33:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324231 states to 324231 states and 549965 transitions. [2019-10-02 12:33:33,865 INFO L78 Accepts]: Start accepts. Automaton has 324231 states and 549965 transitions. Word has length 453 [2019-10-02 12:33:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:33:33,866 INFO L475 AbstractCegarLoop]: Abstraction has 324231 states and 549965 transitions. [2019-10-02 12:33:33,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:33:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 324231 states and 549965 transitions. [2019-10-02 12:33:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 12:33:33,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:33:33,876 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:33:33,877 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:33:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:33:33,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1500599859, now seen corresponding path program 1 times [2019-10-02 12:33:33,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:33:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:33:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:33:33,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:33:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:33:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:33:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 30 proven. 13 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-02 12:33:34,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:33:34,225 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:33:34,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:33:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:33:34,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 3690 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:33:34,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:33:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 174 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 12:33:35,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:33:35,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2019-10-02 12:33:35,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:33:35,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:33:35,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:33:35,069 INFO L87 Difference]: Start difference. First operand 324231 states and 549965 transitions. Second operand 26 states.