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_spec9_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:37:17,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:37:17,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:37:17,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:37:17,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:37:17,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:37:17,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:37:17,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:37:17,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:37:17,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:37:17,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:37:17,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:37:17,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:37:17,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:37:17,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:37:17,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:37:17,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:37:17,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:37:17,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:37:17,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:37:17,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:37:17,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:37:17,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:37:17,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:37:17,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:37:17,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:37:17,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:37:17,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:37:17,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:37:17,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:37:17,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:37:17,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:37:17,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:37:17,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:37:17,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:37:17,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:37:17,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:37:17,834 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:37:17,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:37:17,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:37:17,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:37:17,836 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:37:17,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:37:17,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:37:17,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:37:17,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:37:17,854 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:37:17,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:37:17,854 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:37:17,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:37:17,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:37:17,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:37:17,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:37:17,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:37:17,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:37:17,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:37:17,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:37:17,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:37:17,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:37:17,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:37:17,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:37:17,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:37:17,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:37:17,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:37:17,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:37:17,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:37:17,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:37:17,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:37:17,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:37:17,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:37:17,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:37:17,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:37:17,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:37:17,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:37:17,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:37:17,909 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:37:17,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-02 12:37:17,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbdd04f99/b71415229854467eaf3a3139a6707f8f/FLAG78a05a60b [2019-10-02 12:37:18,659 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:37:18,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product26.cil.c [2019-10-02 12:37:18,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbdd04f99/b71415229854467eaf3a3139a6707f8f/FLAG78a05a60b [2019-10-02 12:37:18,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbdd04f99/b71415229854467eaf3a3139a6707f8f [2019-10-02 12:37:18,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:37:18,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:37:18,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:37:18,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:37:18,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:37:18,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:37:18" (1/1) ... [2019-10-02 12:37:18,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba36926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:18, skipping insertion in model container [2019-10-02 12:37:18,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:37:18" (1/1) ... [2019-10-02 12:37:18,868 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:37:18,947 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:37:19,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:37:19,803 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:37:19,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:37:20,067 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:37:20,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20 WrapperNode [2019-10-02 12:37:20,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:37:20,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:37:20,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:37:20,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:37:20,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (1/1) ... [2019-10-02 12:37:20,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (1/1) ... [2019-10-02 12:37:20,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (1/1) ... [2019-10-02 12:37:20,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (1/1) ... [2019-10-02 12:37:20,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (1/1) ... [2019-10-02 12:37:20,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (1/1) ... [2019-10-02 12:37:20,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (1/1) ... [2019-10-02 12:37:20,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:37:20,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:37:20,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:37:20,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:37:20,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (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:37:20,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:37:20,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:37:20,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:37:20,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:37:20,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:37:20,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:37:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:37:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:37:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:37:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:37:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:37:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:37:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:37:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:37:20,415 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:37:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:37:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:37:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:37:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:37:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:37:20,418 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:37:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:37:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:37:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:37:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:37:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:37:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:37:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:37:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:37:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:37:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:37:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:37:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:37:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:37:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:37:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:37:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:37:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-10-02 12:37:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:37:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-10-02 12:37:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:37:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:37:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:37:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:37:20,422 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:37:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:37:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:37:20,423 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:37:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:37:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:37:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:37:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:37:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:37:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:37:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:37:20,425 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:37:20,425 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:37:20,425 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:37:20,425 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:37:20,425 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:37:20,425 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:37:20,425 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:37:20,426 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:37:20,426 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:37:20,426 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:37:20,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:37:20,427 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:37:20,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:37:20,427 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:37:20,427 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:37:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:37:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:37:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:37:20,428 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:37:20,429 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:37:20,429 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:37:20,429 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:37:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:37:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:37:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:37:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:37:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:37:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:37:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:37:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:37:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:37:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:37:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:37:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:37:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:37:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:37:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:37:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:37:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:37:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:37:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:37:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:37:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:37:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:37:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:37:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:37:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:37:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:37:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:37:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:37:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:37:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:37:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:37:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:37:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:37:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:37:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:37:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:37:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:37:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:37:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:37:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:37:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:37:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:37:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:37:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:37:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:37:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:37:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:37:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:37:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:37:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:37:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:37:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:37:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:37:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-10-02 12:37:20,447 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-10-02 12:37:20,450 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:37:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:37:20,451 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:37:20,452 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:37:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:37:20,461 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:37:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:37:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:37:22,714 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:37:22,715 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:37:22,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:37:22 BoogieIcfgContainer [2019-10-02 12:37:22,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:37:22,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:37:22,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:37:22,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:37:22,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:37:18" (1/3) ... [2019-10-02 12:37:22,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0513be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:37:22, skipping insertion in model container [2019-10-02 12:37:22,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:37:20" (2/3) ... [2019-10-02 12:37:22,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0513be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:37:22, skipping insertion in model container [2019-10-02 12:37:22,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:37:22" (3/3) ... [2019-10-02 12:37:22,726 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2019-10-02 12:37:22,737 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:37:22,749 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:37:22,768 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:37:22,814 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:37:22,814 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:37:22,815 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:37:22,815 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:37:22,815 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:37:22,815 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:37:22,815 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:37:22,815 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:37:22,816 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:37:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states. [2019-10-02 12:37:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 12:37:22,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:22,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:22,897 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:22,904 INFO L82 PathProgramCache]: Analyzing trace with hash 750707123, now seen corresponding path program 1 times [2019-10-02 12:37:22,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:22,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:22,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:23,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:23,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:23,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:23,630 INFO L87 Difference]: Start difference. First operand 765 states. Second operand 4 states. [2019-10-02 12:37:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:23,826 INFO L93 Difference]: Finished difference Result 1179 states and 1913 transitions. [2019-10-02 12:37:23,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:23,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-02 12:37:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:23,864 INFO L225 Difference]: With dead ends: 1179 [2019-10-02 12:37:23,865 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:37:23,880 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:37:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:37:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-02 12:37:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:37:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-10-02 12:37:24,036 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 87 [2019-10-02 12:37:24,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:24,037 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-10-02 12:37:24,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-10-02 12:37:24,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 12:37:24,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:24,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:24,047 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:24,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:24,048 INFO L82 PathProgramCache]: Analyzing trace with hash 773508994, now seen corresponding path program 1 times [2019-10-02 12:37:24,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:24,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:24,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:24,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:24,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:24,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:24,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:24,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:24,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:24,422 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-10-02 12:37:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:24,533 INFO L93 Difference]: Finished difference Result 1159 states and 1874 transitions. [2019-10-02 12:37:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:24,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 12:37:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:24,541 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:37:24,541 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:37:24,546 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:37:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:37:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-02 12:37:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:37:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-10-02 12:37:24,601 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 90 [2019-10-02 12:37:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:24,602 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-10-02 12:37:24,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-10-02 12:37:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 12:37:24,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:24,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:24,607 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -580839806, now seen corresponding path program 1 times [2019-10-02 12:37:24,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:24,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:24,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:24,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:24,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:24,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:24,744 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-10-02 12:37:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:24,809 INFO L93 Difference]: Finished difference Result 1159 states and 1873 transitions. [2019-10-02 12:37:24,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:24,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 12:37:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:24,815 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:37:24,815 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:37:24,818 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:37:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:37:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-02 12:37:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:37:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-10-02 12:37:24,851 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 91 [2019-10-02 12:37:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:24,851 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-10-02 12:37:24,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-10-02 12:37:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:37:24,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:24,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:24,854 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1251478526, now seen corresponding path program 1 times [2019-10-02 12:37:24,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:24,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:24,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:24,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:24,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:24,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:24,979 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 4 states. [2019-10-02 12:37:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:25,044 INFO L93 Difference]: Finished difference Result 1159 states and 1872 transitions. [2019-10-02 12:37:25,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:25,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 12:37:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:25,054 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:37:25,054 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:37:25,059 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:37:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:37:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-02 12:37:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:37:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-10-02 12:37:25,134 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-10-02 12:37:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:25,137 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-10-02 12:37:25,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-10-02 12:37:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:37:25,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:25,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:25,147 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1208737154, now seen corresponding path program 1 times [2019-10-02 12:37:25,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:25,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:25,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:25,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:25,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:25,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:25,297 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-10-02 12:37:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:25,373 INFO L93 Difference]: Finished difference Result 1159 states and 1871 transitions. [2019-10-02 12:37:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:25,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-02 12:37:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:25,383 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:37:25,383 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:37:25,388 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:37:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:37:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-02 12:37:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:37:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 954 transitions. [2019-10-02 12:37:25,419 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 954 transitions. Word has length 93 [2019-10-02 12:37:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:25,420 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 954 transitions. [2019-10-02 12:37:25,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 954 transitions. [2019-10-02 12:37:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:37:25,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:25,424 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:25,424 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1229172839, now seen corresponding path program 1 times [2019-10-02 12:37:25,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:25,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:25,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:25,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:25,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:25,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:25,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:37:25,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:37:25,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:37:25,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:37:25,583 INFO L87 Difference]: Start difference. First operand 598 states and 954 transitions. Second operand 4 states. [2019-10-02 12:37:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:25,650 INFO L93 Difference]: Finished difference Result 1159 states and 1870 transitions. [2019-10-02 12:37:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:37:25,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-02 12:37:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:25,661 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:37:25,664 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:37:25,671 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:37:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:37:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-02 12:37:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:37:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 953 transitions. [2019-10-02 12:37:25,697 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 953 transitions. Word has length 94 [2019-10-02 12:37:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:25,700 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 953 transitions. [2019-10-02 12:37:25,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:37:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 953 transitions. [2019-10-02 12:37:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:37:25,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:25,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:25,703 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash 701446266, now seen corresponding path program 1 times [2019-10-02 12:37:25,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:25,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:25,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:25,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:25,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:25,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:25,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:37:25,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:37:25,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:37:25,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:37:25,909 INFO L87 Difference]: Start difference. First operand 598 states and 953 transitions. Second operand 10 states. [2019-10-02 12:37:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:26,071 INFO L93 Difference]: Finished difference Result 1111 states and 1782 transitions. [2019-10-02 12:37:26,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:37:26,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-02 12:37:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:26,079 INFO L225 Difference]: With dead ends: 1111 [2019-10-02 12:37:26,079 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:37:26,082 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:37:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:37:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:37:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:37:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 940 transitions. [2019-10-02 12:37:26,109 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 940 transitions. Word has length 94 [2019-10-02 12:37:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:26,109 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 940 transitions. [2019-10-02 12:37:26,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:37:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 940 transitions. [2019-10-02 12:37:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:37:26,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:26,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:26,113 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:26,113 INFO L82 PathProgramCache]: Analyzing trace with hash -870815129, now seen corresponding path program 1 times [2019-10-02 12:37:26,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:26,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:26,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:26,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:26,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:26,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:26,267 INFO L87 Difference]: Start difference. First operand 592 states and 940 transitions. Second operand 6 states. [2019-10-02 12:37:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:26,558 INFO L93 Difference]: Finished difference Result 1105 states and 1769 transitions. [2019-10-02 12:37:26,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:26,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 12:37:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:26,565 INFO L225 Difference]: With dead ends: 1105 [2019-10-02 12:37:26,565 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:37:26,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:37:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:37:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:37:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 936 transitions. [2019-10-02 12:37:26,598 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 936 transitions. Word has length 95 [2019-10-02 12:37:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:26,599 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 936 transitions. [2019-10-02 12:37:26,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 936 transitions. [2019-10-02 12:37:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:37:26,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:26,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:26,603 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash 48330685, now seen corresponding path program 1 times [2019-10-02 12:37:26,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:26,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:26,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:26,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:26,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:26,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:26,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:26,769 INFO L87 Difference]: Start difference. First operand 592 states and 936 transitions. Second operand 6 states. [2019-10-02 12:37:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:27,004 INFO L93 Difference]: Finished difference Result 1105 states and 1765 transitions. [2019-10-02 12:37:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:27,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 12:37:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:27,010 INFO L225 Difference]: With dead ends: 1105 [2019-10-02 12:37:27,010 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:37:27,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:37:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:37:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:37:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 932 transitions. [2019-10-02 12:37:27,037 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 932 transitions. Word has length 96 [2019-10-02 12:37:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:27,038 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 932 transitions. [2019-10-02 12:37:27,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 932 transitions. [2019-10-02 12:37:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:37:27,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:27,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:27,041 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash -151934484, now seen corresponding path program 1 times [2019-10-02 12:37:27,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:27,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:27,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:27,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:27,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:27,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:27,175 INFO L87 Difference]: Start difference. First operand 592 states and 932 transitions. Second operand 6 states. [2019-10-02 12:37:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:27,371 INFO L93 Difference]: Finished difference Result 1105 states and 1761 transitions. [2019-10-02 12:37:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:27,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 12:37:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:27,377 INFO L225 Difference]: With dead ends: 1105 [2019-10-02 12:37:27,377 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:37:27,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:27,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:37:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:37:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:37:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 928 transitions. [2019-10-02 12:37:27,403 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 928 transitions. Word has length 97 [2019-10-02 12:37:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:27,403 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 928 transitions. [2019-10-02 12:37:27,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 928 transitions. [2019-10-02 12:37:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:37:27,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:27,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:27,407 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:27,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1813612140, now seen corresponding path program 1 times [2019-10-02 12:37:27,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:27,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:27,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:27,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:27,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:37:27,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:37:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:37:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:37:27,563 INFO L87 Difference]: Start difference. First operand 592 states and 928 transitions. Second operand 7 states. [2019-10-02 12:37:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:27,706 INFO L93 Difference]: Finished difference Result 1105 states and 1757 transitions. [2019-10-02 12:37:27,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:37:27,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-02 12:37:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:27,713 INFO L225 Difference]: With dead ends: 1105 [2019-10-02 12:37:27,713 INFO L226 Difference]: Without dead ends: 571 [2019-10-02 12:37:27,718 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:37:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-02 12:37:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-02 12:37:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 12:37:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-10-02 12:37:27,741 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 97 [2019-10-02 12:37:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:27,741 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-10-02 12:37:27,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:37:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-10-02 12:37:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:37:27,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:27,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:27,744 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -694201758, now seen corresponding path program 1 times [2019-10-02 12:37:27,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:27,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:27,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:27,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:27,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:27,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:27,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:27,864 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 6 states. [2019-10-02 12:37:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:27,958 INFO L93 Difference]: Finished difference Result 1084 states and 1723 transitions. [2019-10-02 12:37:27,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:27,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-02 12:37:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:27,964 INFO L225 Difference]: With dead ends: 1084 [2019-10-02 12:37:27,964 INFO L226 Difference]: Without dead ends: 571 [2019-10-02 12:37:27,967 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-02 12:37:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-02 12:37:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 12:37:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-10-02 12:37:27,986 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 98 [2019-10-02 12:37:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:27,986 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-10-02 12:37:27,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-10-02 12:37:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:37:27,989 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:27,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:27,989 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1046367601, now seen corresponding path program 1 times [2019-10-02 12:37:27,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:28,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:28,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:28,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:28,099 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 6 states. [2019-10-02 12:37:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:28,191 INFO L93 Difference]: Finished difference Result 1084 states and 1722 transitions. [2019-10-02 12:37:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:28,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 12:37:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:28,196 INFO L225 Difference]: With dead ends: 1084 [2019-10-02 12:37:28,196 INFO L226 Difference]: Without dead ends: 571 [2019-10-02 12:37:28,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-02 12:37:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-02 12:37:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 12:37:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 892 transitions. [2019-10-02 12:37:28,218 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 892 transitions. Word has length 99 [2019-10-02 12:37:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:28,218 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 892 transitions. [2019-10-02 12:37:28,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 892 transitions. [2019-10-02 12:37:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 12:37:28,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:28,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:28,221 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 540428551, now seen corresponding path program 1 times [2019-10-02 12:37:28,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:28,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:28,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:28,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:28,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:28,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:28,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:37:28,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:37:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:37:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:37:28,415 INFO L87 Difference]: Start difference. First operand 571 states and 892 transitions. Second operand 12 states. [2019-10-02 12:37:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:28,664 INFO L93 Difference]: Finished difference Result 1085 states and 1721 transitions. [2019-10-02 12:37:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:37:28,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-02 12:37:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:28,670 INFO L225 Difference]: With dead ends: 1085 [2019-10-02 12:37:28,671 INFO L226 Difference]: Without dead ends: 571 [2019-10-02 12:37:28,674 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:37:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-02 12:37:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-02 12:37:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 12:37:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 891 transitions. [2019-10-02 12:37:28,698 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 891 transitions. Word has length 100 [2019-10-02 12:37:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:28,699 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 891 transitions. [2019-10-02 12:37:28,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:37:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 891 transitions. [2019-10-02 12:37:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:37:28,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:28,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:28,701 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1660047310, now seen corresponding path program 1 times [2019-10-02 12:37:28,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:28,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:28,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:28,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:28,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:28,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:37:28,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:37:28,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:37:28,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:37:28,938 INFO L87 Difference]: Start difference. First operand 571 states and 891 transitions. Second operand 6 states. [2019-10-02 12:37:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:32,500 INFO L93 Difference]: Finished difference Result 1686 states and 2716 transitions. [2019-10-02 12:37:32,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:37:32,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-02 12:37:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:32,510 INFO L225 Difference]: With dead ends: 1686 [2019-10-02 12:37:32,510 INFO L226 Difference]: Without dead ends: 1181 [2019-10-02 12:37:32,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-02 12:37:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1054. [2019-10-02 12:37:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-02 12:37:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1692 transitions. [2019-10-02 12:37:32,589 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1692 transitions. Word has length 101 [2019-10-02 12:37:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:32,590 INFO L475 AbstractCegarLoop]: Abstraction has 1054 states and 1692 transitions. [2019-10-02 12:37:32,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:37:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1692 transitions. [2019-10-02 12:37:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:37:32,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:32,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:32,595 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:32,596 INFO L82 PathProgramCache]: Analyzing trace with hash -165410431, now seen corresponding path program 1 times [2019-10-02 12:37:32,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:32,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:32,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:32,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:32,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:32,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:32,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:37:32,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:37:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:37:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:37:32,810 INFO L87 Difference]: Start difference. First operand 1054 states and 1692 transitions. Second operand 9 states. [2019-10-02 12:37:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:36,277 INFO L93 Difference]: Finished difference Result 2054 states and 3371 transitions. [2019-10-02 12:37:36,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:37:36,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-10-02 12:37:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:36,285 INFO L225 Difference]: With dead ends: 2054 [2019-10-02 12:37:36,286 INFO L226 Difference]: Without dead ends: 1066 [2019-10-02 12:37:36,292 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:37:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-10-02 12:37:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1062. [2019-10-02 12:37:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-02 12:37:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1730 transitions. [2019-10-02 12:37:36,348 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1730 transitions. Word has length 134 [2019-10-02 12:37:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:36,348 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1730 transitions. [2019-10-02 12:37:36,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:37:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1730 transitions. [2019-10-02 12:37:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:37:36,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:36,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:36,353 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash -167018225, now seen corresponding path program 1 times [2019-10-02 12:37:36,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:36,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:36,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:36,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:37:36,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:37:36,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:37:36,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:37:36,598 INFO L87 Difference]: Start difference. First operand 1062 states and 1730 transitions. Second operand 12 states. [2019-10-02 12:37:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:46,910 INFO L93 Difference]: Finished difference Result 3402 states and 5593 transitions. [2019-10-02 12:37:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:37:46,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-10-02 12:37:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:46,932 INFO L225 Difference]: With dead ends: 3402 [2019-10-02 12:37:46,932 INFO L226 Difference]: Without dead ends: 2406 [2019-10-02 12:37:46,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:37:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2019-10-02 12:37:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2344. [2019-10-02 12:37:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2344 states. [2019-10-02 12:37:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3796 transitions. [2019-10-02 12:37:47,130 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3796 transitions. Word has length 134 [2019-10-02 12:37:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:47,130 INFO L475 AbstractCegarLoop]: Abstraction has 2344 states and 3796 transitions. [2019-10-02 12:37:47,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:37:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3796 transitions. [2019-10-02 12:37:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:37:47,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:47,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:47,135 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:47,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1058567112, now seen corresponding path program 1 times [2019-10-02 12:37:47,135 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:47,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:47,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:47,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:47,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:47,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:37:47,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:37:47,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:37:47,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:37:47,327 INFO L87 Difference]: Start difference. First operand 2344 states and 3796 transitions. Second operand 8 states. [2019-10-02 12:37:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:53,421 INFO L93 Difference]: Finished difference Result 7947 states and 13293 transitions. [2019-10-02 12:37:53,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:37:53,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2019-10-02 12:37:53,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:53,469 INFO L225 Difference]: With dead ends: 7947 [2019-10-02 12:37:53,469 INFO L226 Difference]: Without dead ends: 5669 [2019-10-02 12:37:53,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:37:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2019-10-02 12:37:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 5621. [2019-10-02 12:37:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5621 states. [2019-10-02 12:37:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5621 states to 5621 states and 8997 transitions. [2019-10-02 12:37:53,780 INFO L78 Accepts]: Start accepts. Automaton has 5621 states and 8997 transitions. Word has length 135 [2019-10-02 12:37:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:53,781 INFO L475 AbstractCegarLoop]: Abstraction has 5621 states and 8997 transitions. [2019-10-02 12:37:53,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:37:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5621 states and 8997 transitions. [2019-10-02 12:37:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:37:53,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:53,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,785 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:53,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2066663089, now seen corresponding path program 1 times [2019-10-02 12:37:53,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:53,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:53,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:37:54,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:54,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:37:54,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:37:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:37:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:37:54,010 INFO L87 Difference]: Start difference. First operand 5621 states and 8997 transitions. Second operand 9 states. [2019-10-02 12:38:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:02,734 INFO L93 Difference]: Finished difference Result 15053 states and 24778 transitions. [2019-10-02 12:38:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:38:02,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-10-02 12:38:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:02,843 INFO L225 Difference]: With dead ends: 15053 [2019-10-02 12:38:02,843 INFO L226 Difference]: Without dead ends: 9492 [2019-10-02 12:38:02,897 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:38:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9492 states. [2019-10-02 12:38:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9492 to 8882. [2019-10-02 12:38:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-10-02 12:38:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 14232 transitions. [2019-10-02 12:38:03,790 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 14232 transitions. Word has length 141 [2019-10-02 12:38:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:03,791 INFO L475 AbstractCegarLoop]: Abstraction has 8882 states and 14232 transitions. [2019-10-02 12:38:03,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:38:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 14232 transitions. [2019-10-02 12:38:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:38:03,797 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:03,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:03,798 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash 141129778, now seen corresponding path program 1 times [2019-10-02 12:38:03,799 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:03,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:03,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:38:04,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:04,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:38:04,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:38:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:38:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:38:04,051 INFO L87 Difference]: Start difference. First operand 8882 states and 14232 transitions. Second operand 7 states. [2019-10-02 12:38:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:09,196 INFO L93 Difference]: Finished difference Result 25593 states and 42286 transitions. [2019-10-02 12:38:09,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:38:09,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-02 12:38:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:09,341 INFO L225 Difference]: With dead ends: 25593 [2019-10-02 12:38:09,341 INFO L226 Difference]: Without dead ends: 18010 [2019-10-02 12:38:09,375 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:38:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18010 states. [2019-10-02 12:38:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18010 to 17628. [2019-10-02 12:38:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17628 states. [2019-10-02 12:38:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17628 states to 17628 states and 28629 transitions. [2019-10-02 12:38:10,461 INFO L78 Accepts]: Start accepts. Automaton has 17628 states and 28629 transitions. Word has length 141 [2019-10-02 12:38:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:10,464 INFO L475 AbstractCegarLoop]: Abstraction has 17628 states and 28629 transitions. [2019-10-02 12:38:10,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:38:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 17628 states and 28629 transitions. [2019-10-02 12:38:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:38:10,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:10,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:10,478 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1685261202, now seen corresponding path program 1 times [2019-10-02 12:38:10,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:10,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:10,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:10,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:38:10,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:10,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:38:10,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:38:10,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:38:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:38:10,625 INFO L87 Difference]: Start difference. First operand 17628 states and 28629 transitions. Second operand 5 states. [2019-10-02 12:38:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:11,382 INFO L93 Difference]: Finished difference Result 34197 states and 56126 transitions. [2019-10-02 12:38:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:38:11,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-02 12:38:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:11,496 INFO L225 Difference]: With dead ends: 34197 [2019-10-02 12:38:11,496 INFO L226 Difference]: Without dead ends: 18033 [2019-10-02 12:38:11,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:38:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18033 states. [2019-10-02 12:38:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18033 to 17817. [2019-10-02 12:38:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17817 states. [2019-10-02 12:38:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17817 states to 17817 states and 28893 transitions. [2019-10-02 12:38:13,530 INFO L78 Accepts]: Start accepts. Automaton has 17817 states and 28893 transitions. Word has length 146 [2019-10-02 12:38:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:13,531 INFO L475 AbstractCegarLoop]: Abstraction has 17817 states and 28893 transitions. [2019-10-02 12:38:13,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:38:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17817 states and 28893 transitions. [2019-10-02 12:38:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:38:13,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:13,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,538 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:13,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:13,539 INFO L82 PathProgramCache]: Analyzing trace with hash 793992918, now seen corresponding path program 1 times [2019-10-02 12:38:13,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:13,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:13,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:13,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:13,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:38:13,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:13,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:38:13,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:38:13,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:38:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:38:13,704 INFO L87 Difference]: Start difference. First operand 17817 states and 28893 transitions. Second operand 7 states. [2019-10-02 12:38:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:14,586 INFO L93 Difference]: Finished difference Result 36363 states and 60524 transitions. [2019-10-02 12:38:14,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:38:14,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-02 12:38:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:14,682 INFO L225 Difference]: With dead ends: 36363 [2019-10-02 12:38:14,682 INFO L226 Difference]: Without dead ends: 17817 [2019-10-02 12:38:14,751 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:38:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17817 states. [2019-10-02 12:38:15,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17817 to 17817. [2019-10-02 12:38:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17817 states. [2019-10-02 12:38:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17817 states to 17817 states and 28503 transitions. [2019-10-02 12:38:15,783 INFO L78 Accepts]: Start accepts. Automaton has 17817 states and 28503 transitions. Word has length 153 [2019-10-02 12:38:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:15,783 INFO L475 AbstractCegarLoop]: Abstraction has 17817 states and 28503 transitions. [2019-10-02 12:38:15,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:38:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 17817 states and 28503 transitions. [2019-10-02 12:38:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:38:15,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:15,789 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,789 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1507371187, now seen corresponding path program 1 times [2019-10-02 12:38:15,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:38:15,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:15,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:38:15,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:38:15,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:38:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:38:15,939 INFO L87 Difference]: Start difference. First operand 17817 states and 28503 transitions. Second operand 7 states. [2019-10-02 12:38:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:20,914 INFO L93 Difference]: Finished difference Result 35751 states and 57743 transitions. [2019-10-02 12:38:20,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:38:20,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-02 12:38:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:21,006 INFO L225 Difference]: With dead ends: 35751 [2019-10-02 12:38:21,007 INFO L226 Difference]: Without dead ends: 19420 [2019-10-02 12:38:21,069 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:38:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19420 states. [2019-10-02 12:38:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19420 to 18879. [2019-10-02 12:38:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18879 states. [2019-10-02 12:38:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18879 states to 18879 states and 29934 transitions. [2019-10-02 12:38:22,113 INFO L78 Accepts]: Start accepts. Automaton has 18879 states and 29934 transitions. Word has length 158 [2019-10-02 12:38:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:22,114 INFO L475 AbstractCegarLoop]: Abstraction has 18879 states and 29934 transitions. [2019-10-02 12:38:22,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:38:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 18879 states and 29934 transitions. [2019-10-02 12:38:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:38:22,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:22,120 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,121 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1591637241, now seen corresponding path program 1 times [2019-10-02 12:38:22,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:22,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:22,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:38:22,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:22,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:38:22,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:38:22,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:38:22,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:22,245 INFO L87 Difference]: Start difference. First operand 18879 states and 29934 transitions. Second operand 6 states. [2019-10-02 12:38:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:23,040 INFO L93 Difference]: Finished difference Result 44187 states and 71278 transitions. [2019-10-02 12:38:23,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:38:23,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-10-02 12:38:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:23,223 INFO L225 Difference]: With dead ends: 44187 [2019-10-02 12:38:23,223 INFO L226 Difference]: Without dead ends: 26794 [2019-10-02 12:38:23,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:38:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26794 states. [2019-10-02 12:38:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26794 to 24812. [2019-10-02 12:38:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24812 states. [2019-10-02 12:38:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24812 states to 24812 states and 39761 transitions. [2019-10-02 12:38:25,404 INFO L78 Accepts]: Start accepts. Automaton has 24812 states and 39761 transitions. Word has length 163 [2019-10-02 12:38:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:25,404 INFO L475 AbstractCegarLoop]: Abstraction has 24812 states and 39761 transitions. [2019-10-02 12:38:25,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:38:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24812 states and 39761 transitions. [2019-10-02 12:38:25,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:38:25,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:25,414 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:25,414 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:25,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1859324553, now seen corresponding path program 1 times [2019-10-02 12:38:25,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:25,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:38:25,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:38:25,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:38:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:38:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:38:25,588 INFO L87 Difference]: Start difference. First operand 24812 states and 39761 transitions. Second operand 10 states. [2019-10-02 12:38:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:32,983 INFO L93 Difference]: Finished difference Result 70465 states and 119374 transitions. [2019-10-02 12:38:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:38:32,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2019-10-02 12:38:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:33,148 INFO L225 Difference]: With dead ends: 70465 [2019-10-02 12:38:33,148 INFO L226 Difference]: Without dead ends: 45719 [2019-10-02 12:38:33,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:38:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45719 states. [2019-10-02 12:38:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45719 to 44687. [2019-10-02 12:38:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44687 states. [2019-10-02 12:38:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44687 states to 44687 states and 72416 transitions. [2019-10-02 12:38:35,072 INFO L78 Accepts]: Start accepts. Automaton has 44687 states and 72416 transitions. Word has length 163 [2019-10-02 12:38:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:35,073 INFO L475 AbstractCegarLoop]: Abstraction has 44687 states and 72416 transitions. [2019-10-02 12:38:35,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:38:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 44687 states and 72416 transitions. [2019-10-02 12:38:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:38:35,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:35,079 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:35,079 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1137680581, now seen corresponding path program 1 times [2019-10-02 12:38:35,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:35,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:35,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:38:35,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:38:35,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:38:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:38:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:38:35,252 INFO L87 Difference]: Start difference. First operand 44687 states and 72416 transitions. Second operand 10 states. [2019-10-02 12:38:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:44,673 INFO L93 Difference]: Finished difference Result 136931 states and 236747 transitions. [2019-10-02 12:38:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:38:44,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 164 [2019-10-02 12:38:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:45,153 INFO L225 Difference]: With dead ends: 136931 [2019-10-02 12:38:45,153 INFO L226 Difference]: Without dead ends: 92310 [2019-10-02 12:38:45,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:38:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92310 states. [2019-10-02 12:38:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92310 to 90980. [2019-10-02 12:38:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90980 states. [2019-10-02 12:38:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90980 states to 90980 states and 150934 transitions. [2019-10-02 12:38:52,091 INFO L78 Accepts]: Start accepts. Automaton has 90980 states and 150934 transitions. Word has length 164 [2019-10-02 12:38:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:52,091 INFO L475 AbstractCegarLoop]: Abstraction has 90980 states and 150934 transitions. [2019-10-02 12:38:52,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:38:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 90980 states and 150934 transitions. [2019-10-02 12:38:52,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:38:52,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:52,099 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:52,100 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:52,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1639224946, now seen corresponding path program 1 times [2019-10-02 12:38:52,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:52,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:52,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:38:52,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:52,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:38:52,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:38:52,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:38:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:38:52,275 INFO L87 Difference]: Start difference. First operand 90980 states and 150934 transitions. Second operand 11 states. [2019-10-02 12:39:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:05,737 INFO L93 Difference]: Finished difference Result 199731 states and 334281 transitions. [2019-10-02 12:39:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:39:05,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 167 [2019-10-02 12:39:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:06,346 INFO L225 Difference]: With dead ends: 199731 [2019-10-02 12:39:06,346 INFO L226 Difference]: Without dead ends: 113916 [2019-10-02 12:39:06,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:39:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113916 states. [2019-10-02 12:39:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113916 to 106796. [2019-10-02 12:39:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106796 states. [2019-10-02 12:39:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106796 states to 106796 states and 173941 transitions. [2019-10-02 12:39:14,984 INFO L78 Accepts]: Start accepts. Automaton has 106796 states and 173941 transitions. Word has length 167 [2019-10-02 12:39:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:14,984 INFO L475 AbstractCegarLoop]: Abstraction has 106796 states and 173941 transitions. [2019-10-02 12:39:14,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:39:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 106796 states and 173941 transitions. [2019-10-02 12:39:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:39:14,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:14,991 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:14,991 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:14,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1289844429, now seen corresponding path program 1 times [2019-10-02 12:39:14,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:14,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:14,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:39:15,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:15,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:15,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:15,178 INFO L87 Difference]: Start difference. First operand 106796 states and 173941 transitions. Second operand 10 states. [2019-10-02 12:39:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:32,849 INFO L93 Difference]: Finished difference Result 342170 states and 598654 transitions. [2019-10-02 12:39:32,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:32,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2019-10-02 12:39:32,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:34,242 INFO L225 Difference]: With dead ends: 342170 [2019-10-02 12:39:34,242 INFO L226 Difference]: Without dead ends: 235440 [2019-10-02 12:39:34,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235440 states. [2019-10-02 12:39:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235440 to 233438. [2019-10-02 12:39:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233438 states. [2019-10-02 12:39:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233438 states to 233438 states and 393198 transitions. [2019-10-02 12:39:51,571 INFO L78 Accepts]: Start accepts. Automaton has 233438 states and 393198 transitions. Word has length 165 [2019-10-02 12:39:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:51,572 INFO L475 AbstractCegarLoop]: Abstraction has 233438 states and 393198 transitions. [2019-10-02 12:39:51,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 233438 states and 393198 transitions. [2019-10-02 12:39:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:39:51,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:51,579 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:51,580 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash -247375457, now seen corresponding path program 1 times [2019-10-02 12:39:51,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:51,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:57,689 WARN L191 SmtUtils]: Spent 5.97 s on a formula simplification that was a NOOP. DAG size: 4 [2019-10-02 12:39:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:39:57,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:57,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:57,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:57,732 INFO L87 Difference]: Start difference. First operand 233438 states and 393198 transitions. Second operand 10 states. [2019-10-02 12:40:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:36,017 INFO L93 Difference]: Finished difference Result 788769 states and 1455650 transitions. [2019-10-02 12:40:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:40:36,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 168 [2019-10-02 12:40:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:49,474 INFO L225 Difference]: With dead ends: 788769 [2019-10-02 12:40:49,475 INFO L226 Difference]: Without dead ends: 555397 [2019-10-02 12:40:50,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:40:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555397 states. [2019-10-02 12:41:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555397 to 551975. [2019-10-02 12:41:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551975 states. [2019-10-02 12:41:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551975 states to 551975 states and 974366 transitions. [2019-10-02 12:41:54,204 INFO L78 Accepts]: Start accepts. Automaton has 551975 states and 974366 transitions. Word has length 168 [2019-10-02 12:41:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:54,205 INFO L475 AbstractCegarLoop]: Abstraction has 551975 states and 974366 transitions. [2019-10-02 12:41:54,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:41:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 551975 states and 974366 transitions. [2019-10-02 12:41:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:41:54,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:54,210 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,211 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:54,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:54,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2046518033, now seen corresponding path program 1 times [2019-10-02 12:41:54,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:54,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:54,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:41:54,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:41:54,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:41:54,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:41:54,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:41:54,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:41:54,407 INFO L87 Difference]: Start difference. First operand 551975 states and 974366 transitions. Second operand 10 states.