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_spec1_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:04:25,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:04:25,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:04:25,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:04:25,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:04:25,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:04:25,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:04:25,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:04:25,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:04:25,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:04:25,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:04:25,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:04:25,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:04:25,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:04:25,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:04:25,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:04:25,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:04:25,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:04:25,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:04:25,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:04:25,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:04:25,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:04:25,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:04:25,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:04:25,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:04:25,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:04:25,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:04:25,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:04:25,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:04:25,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:04:25,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:04:25,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:04:25,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:04:25,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:04:25,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:04:25,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:04:25,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:04:25,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:04:25,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:04:25,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:04:25,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:04:25,909 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:04:25,934 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:04:25,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:04:25,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:04:25,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:04:25,938 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:04:25,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:04:25,939 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:04:25,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:04:25,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:04:25,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:04:25,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:04:25,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:04:25,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:04:25,941 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:04:25,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:04:25,942 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:04:25,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:04:25,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:04:25,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:04:25,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:04:25,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:04:25,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:04:25,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:04:25,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:04:25,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:04:25,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:04:25,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:04:25,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:04:25,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:04:25,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:04:25,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:04:25,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:04:25,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:04:25,996 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:04:25,997 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product23.cil.c [2019-10-02 12:04:26,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d008122e/cbd9093f0cd14dc89e04b30d1b1068cf/FLAG56b78b27b [2019-10-02 12:04:26,716 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:04:26,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product23.cil.c [2019-10-02 12:04:26,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d008122e/cbd9093f0cd14dc89e04b30d1b1068cf/FLAG56b78b27b [2019-10-02 12:04:26,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d008122e/cbd9093f0cd14dc89e04b30d1b1068cf [2019-10-02 12:04:26,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:04:26,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:04:26,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:04:26,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:04:26,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:04:26,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:04:26" (1/1) ... [2019-10-02 12:04:26,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d5ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:26, skipping insertion in model container [2019-10-02 12:04:26,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:04:26" (1/1) ... [2019-10-02 12:04:26,931 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:04:27,002 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:04:27,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:04:27,694 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:04:27,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:04:27,923 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:04:27,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27 WrapperNode [2019-10-02 12:04:27,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:04:27,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:04:27,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:04:27,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:04:27,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (1/1) ... [2019-10-02 12:04:27,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (1/1) ... [2019-10-02 12:04:28,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (1/1) ... [2019-10-02 12:04:28,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (1/1) ... [2019-10-02 12:04:28,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (1/1) ... [2019-10-02 12:04:28,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (1/1) ... [2019-10-02 12:04:28,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (1/1) ... [2019-10-02 12:04:28,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:04:28,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:04:28,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:04:28,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:04:28,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (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:04:28,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:04:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:04:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:04:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:04:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:04:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:04:28,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:04:28,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:04:28,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:04:28,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:04:28,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:04:28,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:04:28,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:04:28,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:04:28,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:04:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:04:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:04:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:04:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:04:28,192 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:04:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:04:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:04:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:04:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:04:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:04:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:04:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:04:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:04:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:04:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:04:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:04:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:04:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:04:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:04:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:04:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:04:28,196 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:04:28,196 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:04:28,196 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:04:28,196 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:04:28,196 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:04:28,196 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:04:28,197 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:04:28,197 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:04:28,197 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:04:28,197 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:04:28,197 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:04:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:04:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:04:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:04:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:04:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:04:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:04:28,199 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:04:28,199 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:04:28,199 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:04:28,199 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:04:28,199 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:04:28,200 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:04:28,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:04:28,200 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:04:28,200 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:04:28,200 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:04:28,200 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:04:28,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:04:28,201 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:04:28,201 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:04:28,201 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:04:28,201 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:04:28,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:04:28,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:04:28,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:04:28,202 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:04:28,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:04:28,203 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:04:28,203 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:04:28,203 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:04:28,203 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:04:28,203 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:04:28,203 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:04:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:04:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:04:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:04:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:04:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:04:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:04:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:04:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:04:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:04:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:04:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:04:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:04:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:04:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:04:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:04:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:04:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:04:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:04:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:04:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:04:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:04:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:04:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:04:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:04:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:04:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:04:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:04:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:04:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:04:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:04:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:04:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:04:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:04:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:04:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:04:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:04:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:04:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:04:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:04:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:04:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:04:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:04:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:04:28,210 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:04:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:04:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:04:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:04:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:04:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:04:28,211 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:04:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:04:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:04:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:04:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:04:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:04:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:04:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:04:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:04:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:04:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:04:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:04:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:04:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:04:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:04:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:04:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:04:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:04:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:04:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:04:28,214 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:04:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:04:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:04:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:04:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:04:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:04:28,215 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:04:28,216 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:04:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:04:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:04:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:04:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:04:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:04:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:04:28,217 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:04:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:04:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:04:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:04:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:04:30,528 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:04:30,528 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:04:30,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:04:30 BoogieIcfgContainer [2019-10-02 12:04:30,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:04:30,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:04:30,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:04:30,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:04:30,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:04:26" (1/3) ... [2019-10-02 12:04:30,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d9d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:04:30, skipping insertion in model container [2019-10-02 12:04:30,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:27" (2/3) ... [2019-10-02 12:04:30,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d9d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:04:30, skipping insertion in model container [2019-10-02 12:04:30,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:04:30" (3/3) ... [2019-10-02 12:04:30,540 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product23.cil.c [2019-10-02 12:04:30,550 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:04:30,564 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:04:30,581 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:04:30,635 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:04:30,636 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:04:30,636 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:04:30,636 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:04:30,636 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:04:30,636 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:04:30,637 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:04:30,637 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:04:30,637 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:04:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states. [2019-10-02 12:04:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:04:30,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:30,720 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:30,722 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 253029278, now seen corresponding path program 1 times [2019-10-02 12:04:30,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:30,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:30,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:04:31,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:31,399 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:31,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:32,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:04:32,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 12:04:32,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:32,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:04:32,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:04:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:04:32,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:04:32,281 INFO L87 Difference]: Start difference. First operand 802 states. Second operand 4 states. [2019-10-02 12:04:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:32,504 INFO L93 Difference]: Finished difference Result 1288 states and 2063 transitions. [2019-10-02 12:04:32,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:04:32,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 12:04:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:32,543 INFO L225 Difference]: With dead ends: 1288 [2019-10-02 12:04:32,544 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:04:32,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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:04:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:04:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:04:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:04:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1025 transitions. [2019-10-02 12:04:32,669 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1025 transitions. Word has length 164 [2019-10-02 12:04:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:32,670 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1025 transitions. [2019-10-02 12:04:32,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:04:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1025 transitions. [2019-10-02 12:04:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:04:32,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:32,681 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:32,681 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2138113805, now seen corresponding path program 1 times [2019-10-02 12:04:32,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:32,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:32,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:04:32,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:32,898 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:33,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:33,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:33,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:04:33,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:33,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 12:04:33,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:04:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:04:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:04:33,602 INFO L87 Difference]: Start difference. First operand 648 states and 1025 transitions. Second operand 5 states. [2019-10-02 12:04:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:33,850 INFO L93 Difference]: Finished difference Result 1802 states and 2896 transitions. [2019-10-02 12:04:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:04:33,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-10-02 12:04:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:33,873 INFO L225 Difference]: With dead ends: 1802 [2019-10-02 12:04:33,873 INFO L226 Difference]: Without dead ends: 1182 [2019-10-02 12:04:33,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-10-02 12:04:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1160. [2019-10-02 12:04:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-02 12:04:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1855 transitions. [2019-10-02 12:04:34,011 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1855 transitions. Word has length 168 [2019-10-02 12:04:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:34,014 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1855 transitions. [2019-10-02 12:04:34,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:04:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1855 transitions. [2019-10-02 12:04:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:04:34,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:34,024 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:34,024 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1896519639, now seen corresponding path program 1 times [2019-10-02 12:04:34,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:34,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:34,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:34,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:34,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:04:34,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:34,320 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:34,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:34,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 3292 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:34,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 12:04:35,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:35,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:35,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:35,003 INFO L87 Difference]: Start difference. First operand 1160 states and 1855 transitions. Second operand 6 states. [2019-10-02 12:04:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:35,108 INFO L93 Difference]: Finished difference Result 2296 states and 3688 transitions. [2019-10-02 12:04:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:04:35,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-10-02 12:04:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:35,119 INFO L225 Difference]: With dead ends: 2296 [2019-10-02 12:04:35,120 INFO L226 Difference]: Without dead ends: 1166 [2019-10-02 12:04:35,127 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-10-02 12:04:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2019-10-02 12:04:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-10-02 12:04:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1860 transitions. [2019-10-02 12:04:35,180 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1860 transitions. Word has length 170 [2019-10-02 12:04:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:35,181 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1860 transitions. [2019-10-02 12:04:35,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1860 transitions. [2019-10-02 12:04:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:04:35,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:35,188 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:35,188 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1839187851, now seen corresponding path program 1 times [2019-10-02 12:04:35,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:35,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:04:35,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:35,413 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:35,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:35,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:35,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:36,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:36,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:36,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:36,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:36,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:36,045 INFO L87 Difference]: Start difference. First operand 1166 states and 1860 transitions. Second operand 6 states. [2019-10-02 12:04:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:36,155 INFO L93 Difference]: Finished difference Result 2295 states and 3679 transitions. [2019-10-02 12:04:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:36,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-02 12:04:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:36,171 INFO L225 Difference]: With dead ends: 2295 [2019-10-02 12:04:36,171 INFO L226 Difference]: Without dead ends: 1166 [2019-10-02 12:04:36,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-10-02 12:04:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2019-10-02 12:04:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-10-02 12:04:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1859 transitions. [2019-10-02 12:04:36,235 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1859 transitions. Word has length 171 [2019-10-02 12:04:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:36,236 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1859 transitions. [2019-10-02 12:04:36,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1859 transitions. [2019-10-02 12:04:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:04:36,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:36,244 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:36,244 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:36,244 INFO L82 PathProgramCache]: Analyzing trace with hash 201198171, now seen corresponding path program 1 times [2019-10-02 12:04:36,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:36,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:36,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:36,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:04:36,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:36,419 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:36,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:37,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 3294 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:37,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:04:37,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:37,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:37,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:37,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:37,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:37,086 INFO L87 Difference]: Start difference. First operand 1166 states and 1859 transitions. Second operand 6 states. [2019-10-02 12:04:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:37,191 INFO L93 Difference]: Finished difference Result 2295 states and 3678 transitions. [2019-10-02 12:04:37,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:37,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-02 12:04:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:37,203 INFO L225 Difference]: With dead ends: 2295 [2019-10-02 12:04:37,203 INFO L226 Difference]: Without dead ends: 1166 [2019-10-02 12:04:37,210 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-10-02 12:04:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2019-10-02 12:04:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-10-02 12:04:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1858 transitions. [2019-10-02 12:04:37,263 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1858 transitions. Word has length 172 [2019-10-02 12:04:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:37,264 INFO L475 AbstractCegarLoop]: Abstraction has 1166 states and 1858 transitions. [2019-10-02 12:04:37,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1858 transitions. [2019-10-02 12:04:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:04:37,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:37,270 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:37,270 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1102421391, now seen corresponding path program 1 times [2019-10-02 12:04:37,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:37,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:37,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:37,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:37,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:04:37,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:37,532 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:37,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:38,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 3295 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:04:38,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:04:38,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:38,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 12:04:38,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:04:38,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:04:38,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:38,282 INFO L87 Difference]: Start difference. First operand 1166 states and 1858 transitions. Second operand 15 states. [2019-10-02 12:04:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:38,640 INFO L93 Difference]: Finished difference Result 2300 states and 3685 transitions. [2019-10-02 12:04:38,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:38,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 173 [2019-10-02 12:04:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:38,652 INFO L225 Difference]: With dead ends: 2300 [2019-10-02 12:04:38,652 INFO L226 Difference]: Without dead ends: 1175 [2019-10-02 12:04:38,660 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:04:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-10-02 12:04:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2019-10-02 12:04:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-10-02 12:04:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1868 transitions. [2019-10-02 12:04:38,720 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1868 transitions. Word has length 173 [2019-10-02 12:04:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:38,721 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1868 transitions. [2019-10-02 12:04:38,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:04:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1868 transitions. [2019-10-02 12:04:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:04:38,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:38,727 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:38,727 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1137245328, now seen corresponding path program 1 times [2019-10-02 12:04:38,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:38,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:38,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:38,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:04:38,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:38,867 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:38,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:39,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 3294 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:39,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:39,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:39,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:39,502 INFO L87 Difference]: Start difference. First operand 1173 states and 1868 transitions. Second operand 6 states. [2019-10-02 12:04:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:39,842 INFO L93 Difference]: Finished difference Result 2307 states and 3696 transitions. [2019-10-02 12:04:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:39,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-10-02 12:04:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:39,857 INFO L225 Difference]: With dead ends: 2307 [2019-10-02 12:04:39,857 INFO L226 Difference]: Without dead ends: 1169 [2019-10-02 12:04:39,868 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 173 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:04:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-10-02 12:04:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2019-10-02 12:04:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2019-10-02 12:04:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1856 transitions. [2019-10-02 12:04:39,932 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1856 transitions. Word has length 173 [2019-10-02 12:04:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:39,933 INFO L475 AbstractCegarLoop]: Abstraction has 1169 states and 1856 transitions. [2019-10-02 12:04:39,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1856 transitions. [2019-10-02 12:04:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:04:39,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:39,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:39,944 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:39,944 INFO L82 PathProgramCache]: Analyzing trace with hash -630420032, now seen corresponding path program 1 times [2019-10-02 12:04:39,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:39,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:04:40,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:40,197 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:40,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:41,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 3298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:41,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:04:41,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:41,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:41,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:41,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:41,162 INFO L87 Difference]: Start difference. First operand 1169 states and 1856 transitions. Second operand 8 states. [2019-10-02 12:04:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:41,562 INFO L93 Difference]: Finished difference Result 2303 states and 3679 transitions. [2019-10-02 12:04:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:41,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-10-02 12:04:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:41,581 INFO L225 Difference]: With dead ends: 2303 [2019-10-02 12:04:41,581 INFO L226 Difference]: Without dead ends: 1169 [2019-10-02 12:04:41,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-10-02 12:04:41,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2019-10-02 12:04:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2019-10-02 12:04:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1851 transitions. [2019-10-02 12:04:41,691 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1851 transitions. Word has length 176 [2019-10-02 12:04:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:41,692 INFO L475 AbstractCegarLoop]: Abstraction has 1169 states and 1851 transitions. [2019-10-02 12:04:41,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1851 transitions. [2019-10-02 12:04:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:04:41,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:41,704 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:41,704 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1273903986, now seen corresponding path program 1 times [2019-10-02 12:04:41,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:41,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:41,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:41,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:41,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:04:42,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:42,098 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:42,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:42,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 3300 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:42,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:04:42,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:42,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:42,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:42,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:42,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:42,879 INFO L87 Difference]: Start difference. First operand 1169 states and 1851 transitions. Second operand 8 states. [2019-10-02 12:04:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:43,182 INFO L93 Difference]: Finished difference Result 2324 states and 3700 transitions. [2019-10-02 12:04:43,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:43,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-10-02 12:04:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:43,192 INFO L225 Difference]: With dead ends: 2324 [2019-10-02 12:04:43,192 INFO L226 Difference]: Without dead ends: 1187 [2019-10-02 12:04:43,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-10-02 12:04:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1184. [2019-10-02 12:04:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-10-02 12:04:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1864 transitions. [2019-10-02 12:04:43,251 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1864 transitions. Word has length 178 [2019-10-02 12:04:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:43,252 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1864 transitions. [2019-10-02 12:04:43,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1864 transitions. [2019-10-02 12:04:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:04:43,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:43,259 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:43,259 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash -642615282, now seen corresponding path program 1 times [2019-10-02 12:04:43,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:43,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:43,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:43,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:43,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:04:43,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:43,452 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:43,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:44,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:04:44,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:44,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:44,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:04:44,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:04:44,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:04:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:44,228 INFO L87 Difference]: Start difference. First operand 1184 states and 1864 transitions. Second operand 14 states. [2019-10-02 12:04:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:44,546 INFO L93 Difference]: Finished difference Result 2314 states and 3665 transitions. [2019-10-02 12:04:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:44,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-10-02 12:04:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:44,556 INFO L225 Difference]: With dead ends: 2314 [2019-10-02 12:04:44,556 INFO L226 Difference]: Without dead ends: 1178 [2019-10-02 12:04:44,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:04:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-02 12:04:44,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1173. [2019-10-02 12:04:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-10-02 12:04:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1844 transitions. [2019-10-02 12:04:44,605 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1844 transitions. Word has length 178 [2019-10-02 12:04:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:44,605 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1844 transitions. [2019-10-02 12:04:44,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:04:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1844 transitions. [2019-10-02 12:04:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:04:44,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:44,611 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:44,611 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:44,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:44,612 INFO L82 PathProgramCache]: Analyzing trace with hash 66143099, now seen corresponding path program 1 times [2019-10-02 12:04:44,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:44,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:44,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:04:44,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:44,762 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:44,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:45,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 3303 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:45,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:45,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:45,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:45,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:45,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:45,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:45,347 INFO L87 Difference]: Start difference. First operand 1173 states and 1844 transitions. Second operand 8 states. [2019-10-02 12:04:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:45,548 INFO L93 Difference]: Finished difference Result 2296 states and 3634 transitions. [2019-10-02 12:04:45,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:45,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-10-02 12:04:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:45,559 INFO L225 Difference]: With dead ends: 2296 [2019-10-02 12:04:45,559 INFO L226 Difference]: Without dead ends: 1173 [2019-10-02 12:04:45,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-10-02 12:04:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2019-10-02 12:04:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-10-02 12:04:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1843 transitions. [2019-10-02 12:04:45,608 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1843 transitions. Word has length 181 [2019-10-02 12:04:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:45,609 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1843 transitions. [2019-10-02 12:04:45,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1843 transitions. [2019-10-02 12:04:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:04:45,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:45,616 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:45,616 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:45,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1122075742, now seen corresponding path program 1 times [2019-10-02 12:04:45,617 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:45,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:45,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:45,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:45,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:04:45,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:45,826 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:46,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:46,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 3304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:46,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:04:46,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:46,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:46,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:46,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:46,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:46,577 INFO L87 Difference]: Start difference. First operand 1173 states and 1843 transitions. Second operand 8 states. [2019-10-02 12:04:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:46,754 INFO L93 Difference]: Finished difference Result 2296 states and 3633 transitions. [2019-10-02 12:04:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:46,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-10-02 12:04:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:46,764 INFO L225 Difference]: With dead ends: 2296 [2019-10-02 12:04:46,764 INFO L226 Difference]: Without dead ends: 1173 [2019-10-02 12:04:46,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-10-02 12:04:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2019-10-02 12:04:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-10-02 12:04:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1842 transitions. [2019-10-02 12:04:46,813 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1842 transitions. Word has length 182 [2019-10-02 12:04:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:46,814 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1842 transitions. [2019-10-02 12:04:46,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1842 transitions. [2019-10-02 12:04:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:04:46,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:46,821 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:46,821 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:46,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:46,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1198271626, now seen corresponding path program 1 times [2019-10-02 12:04:46,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:46,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:04:47,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:47,076 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:47,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:47,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:04:47,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:47,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:47,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:04:47,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:04:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:04:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:47,810 INFO L87 Difference]: Start difference. First operand 1173 states and 1842 transitions. Second operand 18 states. [2019-10-02 12:04:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:48,375 INFO L93 Difference]: Finished difference Result 2312 states and 3660 transitions. [2019-10-02 12:04:48,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:04:48,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-10-02 12:04:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:48,385 INFO L225 Difference]: With dead ends: 2312 [2019-10-02 12:04:48,386 INFO L226 Difference]: Without dead ends: 1188 [2019-10-02 12:04:48,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:04:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2019-10-02 12:04:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1184. [2019-10-02 12:04:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-10-02 12:04:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1850 transitions. [2019-10-02 12:04:48,431 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1850 transitions. Word has length 183 [2019-10-02 12:04:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:48,431 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1850 transitions. [2019-10-02 12:04:48,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:04:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1850 transitions. [2019-10-02 12:04:48,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:04:48,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:48,437 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:48,437 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:48,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:48,438 INFO L82 PathProgramCache]: Analyzing trace with hash 492883370, now seen corresponding path program 1 times [2019-10-02 12:04:48,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:48,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:48,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:04:48,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:48,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:48,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:48,673 INFO L87 Difference]: Start difference. First operand 1184 states and 1850 transitions. Second operand 9 states. [2019-10-02 12:04:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:48,855 INFO L93 Difference]: Finished difference Result 2243 states and 3556 transitions. [2019-10-02 12:04:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:48,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-10-02 12:04:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:48,865 INFO L225 Difference]: With dead ends: 2243 [2019-10-02 12:04:48,865 INFO L226 Difference]: Without dead ends: 1181 [2019-10-02 12:04:48,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:04:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-02 12:04:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2019-10-02 12:04:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-10-02 12:04:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1845 transitions. [2019-10-02 12:04:48,911 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1845 transitions. Word has length 184 [2019-10-02 12:04:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:48,911 INFO L475 AbstractCegarLoop]: Abstraction has 1181 states and 1845 transitions. [2019-10-02 12:04:48,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1845 transitions. [2019-10-02 12:04:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:04:48,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:48,917 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:48,917 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash 500212010, now seen corresponding path program 1 times [2019-10-02 12:04:48,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:48,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:48,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:48,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:04:49,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:49,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:04:49,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:04:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:04:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:49,060 INFO L87 Difference]: Start difference. First operand 1181 states and 1845 transitions. Second operand 7 states. [2019-10-02 12:04:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:49,161 INFO L93 Difference]: Finished difference Result 2240 states and 3551 transitions. [2019-10-02 12:04:49,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:49,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-10-02 12:04:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:49,170 INFO L225 Difference]: With dead ends: 2240 [2019-10-02 12:04:49,170 INFO L226 Difference]: Without dead ends: 1160 [2019-10-02 12:04:49,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:04:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-02 12:04:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1158. [2019-10-02 12:04:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-10-02 12:04:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1815 transitions. [2019-10-02 12:04:49,217 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1815 transitions. Word has length 184 [2019-10-02 12:04:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:49,217 INFO L475 AbstractCegarLoop]: Abstraction has 1158 states and 1815 transitions. [2019-10-02 12:04:49,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:04:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1815 transitions. [2019-10-02 12:04:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:04:49,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:49,223 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:49,223 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash -75188141, now seen corresponding path program 1 times [2019-10-02 12:04:49,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:49,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:49,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:04:49,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:49,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:49,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:49,452 INFO L87 Difference]: Start difference. First operand 1158 states and 1815 transitions. Second operand 13 states. [2019-10-02 12:04:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:49,794 INFO L93 Difference]: Finished difference Result 2218 states and 3519 transitions. [2019-10-02 12:04:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:04:49,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-10-02 12:04:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:49,803 INFO L225 Difference]: With dead ends: 2218 [2019-10-02 12:04:49,803 INFO L226 Difference]: Without dead ends: 1151 [2019-10-02 12:04:49,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-10-02 12:04:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2019-10-02 12:04:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-10-02 12:04:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1806 transitions. [2019-10-02 12:04:49,851 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1806 transitions. Word has length 185 [2019-10-02 12:04:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:49,851 INFO L475 AbstractCegarLoop]: Abstraction has 1151 states and 1806 transitions. [2019-10-02 12:04:49,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1806 transitions. [2019-10-02 12:04:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 12:04:49,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:49,857 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:49,858 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1487118519, now seen corresponding path program 1 times [2019-10-02 12:04:49,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:49,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:49,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:04:50,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:50,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:50,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:50,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:50,061 INFO L87 Difference]: Start difference. First operand 1151 states and 1806 transitions. Second operand 13 states. [2019-10-02 12:04:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:50,431 INFO L93 Difference]: Finished difference Result 2269 states and 3587 transitions. [2019-10-02 12:04:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:04:50,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-10-02 12:04:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:50,440 INFO L225 Difference]: With dead ends: 2269 [2019-10-02 12:04:50,440 INFO L226 Difference]: Without dead ends: 1165 [2019-10-02 12:04:50,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-10-02 12:04:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1163. [2019-10-02 12:04:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-10-02 12:04:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1821 transitions. [2019-10-02 12:04:50,480 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1821 transitions. Word has length 186 [2019-10-02 12:04:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:50,480 INFO L475 AbstractCegarLoop]: Abstraction has 1163 states and 1821 transitions. [2019-10-02 12:04:50,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1821 transitions. [2019-10-02 12:04:50,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:04:50,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:50,486 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:50,486 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1695390488, now seen corresponding path program 1 times [2019-10-02 12:04:50,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:50,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:50,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:50,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:50,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:50,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:50,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:50,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:50,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:50,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:50,729 INFO L87 Difference]: Start difference. First operand 1163 states and 1821 transitions. Second operand 11 states. [2019-10-02 12:04:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:51,110 INFO L93 Difference]: Finished difference Result 2223 states and 3525 transitions. [2019-10-02 12:04:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:51,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-10-02 12:04:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:51,118 INFO L225 Difference]: With dead ends: 2223 [2019-10-02 12:04:51,119 INFO L226 Difference]: Without dead ends: 1163 [2019-10-02 12:04:51,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-10-02 12:04:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2019-10-02 12:04:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-10-02 12:04:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1820 transitions. [2019-10-02 12:04:51,165 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1820 transitions. Word has length 187 [2019-10-02 12:04:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:51,166 INFO L475 AbstractCegarLoop]: Abstraction has 1163 states and 1820 transitions. [2019-10-02 12:04:51,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1820 transitions. [2019-10-02 12:04:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:04:51,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:51,172 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:51,172 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:51,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash -704065026, now seen corresponding path program 1 times [2019-10-02 12:04:51,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:51,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:51,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:51,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:51,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:51,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:51,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:51,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:51,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:51,373 INFO L87 Difference]: Start difference. First operand 1163 states and 1820 transitions. Second operand 11 states. [2019-10-02 12:04:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:51,719 INFO L93 Difference]: Finished difference Result 2269 states and 3578 transitions. [2019-10-02 12:04:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:51,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-10-02 12:04:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:51,730 INFO L225 Difference]: With dead ends: 2269 [2019-10-02 12:04:51,731 INFO L226 Difference]: Without dead ends: 1160 [2019-10-02 12:04:51,738 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-02 12:04:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2019-10-02 12:04:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-10-02 12:04:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1812 transitions. [2019-10-02 12:04:51,792 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1812 transitions. Word has length 188 [2019-10-02 12:04:51,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:51,792 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1812 transitions. [2019-10-02 12:04:51,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1812 transitions. [2019-10-02 12:04:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:04:51,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:51,801 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:51,802 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:51,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1825211917, now seen corresponding path program 1 times [2019-10-02 12:04:51,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:51,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:51,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:51,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:51,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:51,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:51,999 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:52,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:52,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 3311 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:52,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:52,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:52,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:52,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:52,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:52,633 INFO L87 Difference]: Start difference. First operand 1160 states and 1812 transitions. Second operand 9 states. [2019-10-02 12:04:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:53,788 INFO L93 Difference]: Finished difference Result 2219 states and 3575 transitions. [2019-10-02 12:04:53,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:53,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-10-02 12:04:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:53,796 INFO L225 Difference]: With dead ends: 2219 [2019-10-02 12:04:53,796 INFO L226 Difference]: Without dead ends: 1168 [2019-10-02 12:04:53,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:04:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2019-10-02 12:04:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1168. [2019-10-02 12:04:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2019-10-02 12:04:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1820 transitions. [2019-10-02 12:04:53,839 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1820 transitions. Word has length 189 [2019-10-02 12:04:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:53,840 INFO L475 AbstractCegarLoop]: Abstraction has 1168 states and 1820 transitions. [2019-10-02 12:04:53,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1820 transitions. [2019-10-02 12:04:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:04:53,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:53,845 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:53,846 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1800177879, now seen corresponding path program 1 times [2019-10-02 12:04:53,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:53,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:54,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:54,052 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:54,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:54,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 3313 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:54,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:54,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:54,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:54,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:54,704 INFO L87 Difference]: Start difference. First operand 1168 states and 1820 transitions. Second operand 9 states. [2019-10-02 12:04:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:55,912 INFO L93 Difference]: Finished difference Result 2237 states and 3589 transitions. [2019-10-02 12:04:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:55,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-10-02 12:04:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:55,921 INFO L225 Difference]: With dead ends: 2237 [2019-10-02 12:04:55,921 INFO L226 Difference]: Without dead ends: 1178 [2019-10-02 12:04:55,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-02 12:04:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2019-10-02 12:04:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2019-10-02 12:04:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1830 transitions. [2019-10-02 12:04:55,964 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1830 transitions. Word has length 191 [2019-10-02 12:04:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:55,964 INFO L475 AbstractCegarLoop]: Abstraction has 1178 states and 1830 transitions. [2019-10-02 12:04:55,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1830 transitions. [2019-10-02 12:04:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:04:55,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:55,970 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:55,970 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:55,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1568939725, now seen corresponding path program 1 times [2019-10-02 12:04:55,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:55,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:55,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:56,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:56,119 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:56,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 3315 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:56,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:56,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:56,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:56,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:56,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:56,754 INFO L87 Difference]: Start difference. First operand 1178 states and 1830 transitions. Second operand 9 states. [2019-10-02 12:04:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:58,079 INFO L93 Difference]: Finished difference Result 2259 states and 3607 transitions. [2019-10-02 12:04:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:58,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-10-02 12:04:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:58,090 INFO L225 Difference]: With dead ends: 2259 [2019-10-02 12:04:58,090 INFO L226 Difference]: Without dead ends: 1190 [2019-10-02 12:04:58,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-10-02 12:04:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2019-10-02 12:04:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2019-10-02 12:04:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1842 transitions. [2019-10-02 12:04:58,131 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1842 transitions. Word has length 193 [2019-10-02 12:04:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:58,131 INFO L475 AbstractCegarLoop]: Abstraction has 1190 states and 1842 transitions. [2019-10-02 12:04:58,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1842 transitions. [2019-10-02 12:04:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:04:58,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:58,136 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:58,136 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2134709105, now seen corresponding path program 1 times [2019-10-02 12:04:58,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:58,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:58,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:58,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:58,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:58,284 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:58,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:58,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 3317 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:58,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:58,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:58,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:58,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:58,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:58,969 INFO L87 Difference]: Start difference. First operand 1190 states and 1842 transitions. Second operand 9 states. [2019-10-02 12:05:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:00,360 INFO L93 Difference]: Finished difference Result 2285 states and 3629 transitions. [2019-10-02 12:05:00,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:05:00,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-02 12:05:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:00,384 INFO L225 Difference]: With dead ends: 2285 [2019-10-02 12:05:00,385 INFO L226 Difference]: Without dead ends: 1204 [2019-10-02 12:05:00,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:05:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-10-02 12:05:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2019-10-02 12:05:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-10-02 12:05:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1856 transitions. [2019-10-02 12:05:00,458 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1856 transitions. Word has length 195 [2019-10-02 12:05:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:00,459 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1856 transitions. [2019-10-02 12:05:00,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1856 transitions. [2019-10-02 12:05:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:05:00,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:00,466 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:00,466 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1048553075, now seen corresponding path program 1 times [2019-10-02 12:05:00,467 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:00,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:00,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:05:00,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:00,841 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:01,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:01,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 3319 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:05:01,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:05:01,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:01,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:05:01,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:05:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:05:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:05:01,864 INFO L87 Difference]: Start difference. First operand 1204 states and 1856 transitions. Second operand 14 states. [2019-10-02 12:05:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:12,531 INFO L93 Difference]: Finished difference Result 3620 states and 5737 transitions. [2019-10-02 12:05:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:05:12,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2019-10-02 12:05:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:12,553 INFO L225 Difference]: With dead ends: 3620 [2019-10-02 12:05:12,553 INFO L226 Difference]: Without dead ends: 2525 [2019-10-02 12:05:12,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:05:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2019-10-02 12:05:12,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2445. [2019-10-02 12:05:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2445 states. [2019-10-02 12:05:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3839 transitions. [2019-10-02 12:05:12,648 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3839 transitions. Word has length 197 [2019-10-02 12:05:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:12,649 INFO L475 AbstractCegarLoop]: Abstraction has 2445 states and 3839 transitions. [2019-10-02 12:05:12,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:05:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3839 transitions. [2019-10-02 12:05:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 12:05:12,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:12,657 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:12,657 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -824044632, now seen corresponding path program 1 times [2019-10-02 12:05:12,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:12,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:12,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:12,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:05:12,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:12,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:05:12,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:05:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:05:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:12,844 INFO L87 Difference]: Start difference. First operand 2445 states and 3839 transitions. Second operand 9 states. [2019-10-02 12:05:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:13,014 INFO L93 Difference]: Finished difference Result 3545 states and 5575 transitions. [2019-10-02 12:05:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:05:13,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-10-02 12:05:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:13,027 INFO L225 Difference]: With dead ends: 3545 [2019-10-02 12:05:13,027 INFO L226 Difference]: Without dead ends: 1198 [2019-10-02 12:05:13,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2019-10-02 12:05:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2019-10-02 12:05:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-10-02 12:05:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1839 transitions. [2019-10-02 12:05:13,068 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1839 transitions. Word has length 205 [2019-10-02 12:05:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:13,069 INFO L475 AbstractCegarLoop]: Abstraction has 1198 states and 1839 transitions. [2019-10-02 12:05:13,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1839 transitions. [2019-10-02 12:05:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 12:05:13,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:13,074 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:13,074 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:13,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1327647080, now seen corresponding path program 1 times [2019-10-02 12:05:13,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:13,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:13,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:13,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:13,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:05:13,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:13,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:05:13,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:05:13,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:05:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:13,409 INFO L87 Difference]: Start difference. First operand 1198 states and 1839 transitions. Second operand 11 states. [2019-10-02 12:05:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:18,260 INFO L93 Difference]: Finished difference Result 2285 states and 3568 transitions. [2019-10-02 12:05:18,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:05:18,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 214 [2019-10-02 12:05:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:18,268 INFO L225 Difference]: With dead ends: 2285 [2019-10-02 12:05:18,268 INFO L226 Difference]: Without dead ends: 1194 [2019-10-02 12:05:18,271 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:05:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-10-02 12:05:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2019-10-02 12:05:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1194 states. [2019-10-02 12:05:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1831 transitions. [2019-10-02 12:05:18,307 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1831 transitions. Word has length 214 [2019-10-02 12:05:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:18,308 INFO L475 AbstractCegarLoop]: Abstraction has 1194 states and 1831 transitions. [2019-10-02 12:05:18,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:05:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1831 transitions. [2019-10-02 12:05:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:05:18,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:18,314 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:18,314 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash -893063483, now seen corresponding path program 1 times [2019-10-02 12:05:18,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:18,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:05:18,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:18,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:18,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:18,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:18,486 INFO L87 Difference]: Start difference. First operand 1194 states and 1831 transitions. Second operand 6 states. [2019-10-02 12:05:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:22,704 INFO L93 Difference]: Finished difference Result 3564 states and 5685 transitions. [2019-10-02 12:05:22,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:22,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-10-02 12:05:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:22,720 INFO L225 Difference]: With dead ends: 3564 [2019-10-02 12:05:22,720 INFO L226 Difference]: Without dead ends: 2477 [2019-10-02 12:05:22,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-10-02 12:05:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2436. [2019-10-02 12:05:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2436 states. [2019-10-02 12:05:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3838 transitions. [2019-10-02 12:05:22,831 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3838 transitions. Word has length 228 [2019-10-02 12:05:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:22,832 INFO L475 AbstractCegarLoop]: Abstraction has 2436 states and 3838 transitions. [2019-10-02 12:05:22,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3838 transitions. [2019-10-02 12:05:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 12:05:22,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:22,838 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:22,838 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:22,839 INFO L82 PathProgramCache]: Analyzing trace with hash 15607486, now seen corresponding path program 1 times [2019-10-02 12:05:22,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:22,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:22,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:22,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:22,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:05:23,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:23,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:23,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:23,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:23,038 INFO L87 Difference]: Start difference. First operand 2436 states and 3838 transitions. Second operand 6 states. [2019-10-02 12:05:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:27,420 INFO L93 Difference]: Finished difference Result 7902 states and 12991 transitions. [2019-10-02 12:05:27,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:27,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2019-10-02 12:05:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:27,468 INFO L225 Difference]: With dead ends: 7902 [2019-10-02 12:05:27,469 INFO L226 Difference]: Without dead ends: 5577 [2019-10-02 12:05:27,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2019-10-02 12:05:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 5120. [2019-10-02 12:05:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5120 states. [2019-10-02 12:05:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 8256 transitions. [2019-10-02 12:05:27,876 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 8256 transitions. Word has length 229 [2019-10-02 12:05:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:27,877 INFO L475 AbstractCegarLoop]: Abstraction has 5120 states and 8256 transitions. [2019-10-02 12:05:27,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 8256 transitions. [2019-10-02 12:05:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:05:27,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:27,898 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:27,899 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1476715679, now seen corresponding path program 1 times [2019-10-02 12:05:27,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:27,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:05:28,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:28,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:28,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:28,196 INFO L87 Difference]: Start difference. First operand 5120 states and 8256 transitions. Second operand 6 states. [2019-10-02 12:05:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:33,018 INFO L93 Difference]: Finished difference Result 17492 states and 29567 transitions. [2019-10-02 12:05:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:33,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2019-10-02 12:05:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:33,112 INFO L225 Difference]: With dead ends: 17492 [2019-10-02 12:05:33,112 INFO L226 Difference]: Without dead ends: 12491 [2019-10-02 12:05:33,147 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2019-10-02 12:05:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 11076. [2019-10-02 12:05:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-10-02 12:05:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 18270 transitions. [2019-10-02 12:05:33,828 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 18270 transitions. Word has length 230 [2019-10-02 12:05:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:33,829 INFO L475 AbstractCegarLoop]: Abstraction has 11076 states and 18270 transitions. [2019-10-02 12:05:33,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 18270 transitions. [2019-10-02 12:05:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 12:05:33,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:33,837 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:33,838 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -90445670, now seen corresponding path program 1 times [2019-10-02 12:05:33,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:33,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:05:34,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:34,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:34,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:34,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:34,011 INFO L87 Difference]: Start difference. First operand 11076 states and 18270 transitions. Second operand 6 states. [2019-10-02 12:05:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:39,127 INFO L93 Difference]: Finished difference Result 39430 states and 68543 transitions. [2019-10-02 12:05:39,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:39,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 231 [2019-10-02 12:05:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:39,391 INFO L225 Difference]: With dead ends: 39430 [2019-10-02 12:05:39,392 INFO L226 Difference]: Without dead ends: 28489 [2019-10-02 12:05:39,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28489 states. [2019-10-02 12:05:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28489 to 24656. [2019-10-02 12:05:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24656 states. [2019-10-02 12:05:42,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24656 states to 24656 states and 41680 transitions. [2019-10-02 12:05:42,180 INFO L78 Accepts]: Start accepts. Automaton has 24656 states and 41680 transitions. Word has length 231 [2019-10-02 12:05:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:42,180 INFO L475 AbstractCegarLoop]: Abstraction has 24656 states and 41680 transitions. [2019-10-02 12:05:42,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 24656 states and 41680 transitions. [2019-10-02 12:05:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 12:05:42,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:42,187 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:42,187 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash 337899517, now seen corresponding path program 1 times [2019-10-02 12:05:42,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:42,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:42,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:42,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:42,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:05:42,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:42,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:42,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:42,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:42,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:42,356 INFO L87 Difference]: Start difference. First operand 24656 states and 41680 transitions. Second operand 6 states. [2019-10-02 12:05:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:50,486 INFO L93 Difference]: Finished difference Result 91192 states and 163267 transitions. [2019-10-02 12:05:50,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:50,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 232 [2019-10-02 12:05:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:50,894 INFO L225 Difference]: With dead ends: 91192 [2019-10-02 12:05:50,895 INFO L226 Difference]: Without dead ends: 66703 [2019-10-02 12:05:51,007 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66703 states. [2019-10-02 12:05:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66703 to 56588. [2019-10-02 12:05:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56588 states. [2019-10-02 12:05:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56588 states to 56588 states and 98294 transitions. [2019-10-02 12:05:54,328 INFO L78 Accepts]: Start accepts. Automaton has 56588 states and 98294 transitions. Word has length 232 [2019-10-02 12:05:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:54,329 INFO L475 AbstractCegarLoop]: Abstraction has 56588 states and 98294 transitions. [2019-10-02 12:05:54,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 56588 states and 98294 transitions. [2019-10-02 12:05:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 12:05:54,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:54,337 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:54,337 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 438811484, now seen corresponding path program 1 times [2019-10-02 12:05:54,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:54,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:54,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:05:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:05:54,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:05:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:05:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:54,544 INFO L87 Difference]: Start difference. First operand 56588 states and 98294 transitions. Second operand 11 states. [2019-10-02 12:06:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:06,063 INFO L93 Difference]: Finished difference Result 120578 states and 208412 transitions. [2019-10-02 12:06:06,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:06:06,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2019-10-02 12:06:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:06,793 INFO L225 Difference]: With dead ends: 120578 [2019-10-02 12:06:06,793 INFO L226 Difference]: Without dead ends: 64221 [2019-10-02 12:06:06,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:06:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64221 states. [2019-10-02 12:06:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64221 to 60200. [2019-10-02 12:06:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60200 states. [2019-10-02 12:06:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60200 states to 60200 states and 99455 transitions. [2019-10-02 12:06:10,377 INFO L78 Accepts]: Start accepts. Automaton has 60200 states and 99455 transitions. Word has length 232 [2019-10-02 12:06:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:10,377 INFO L475 AbstractCegarLoop]: Abstraction has 60200 states and 99455 transitions. [2019-10-02 12:06:10,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:06:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 60200 states and 99455 transitions. [2019-10-02 12:06:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 12:06:10,383 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:10,383 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:10,383 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:10,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:10,384 INFO L82 PathProgramCache]: Analyzing trace with hash 602552256, now seen corresponding path program 1 times [2019-10-02 12:06:10,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:10,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:10,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:10,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:06:10,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:06:10,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:06:10,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:10,561 INFO L87 Difference]: Start difference. First operand 60200 states and 99455 transitions. Second operand 9 states. [2019-10-02 12:06:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:15,627 INFO L93 Difference]: Finished difference Result 122025 states and 201333 transitions. [2019-10-02 12:06:15,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:06:15,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 238 [2019-10-02 12:06:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:16,035 INFO L225 Difference]: With dead ends: 122025 [2019-10-02 12:06:16,035 INFO L226 Difference]: Without dead ends: 62056 [2019-10-02 12:06:16,223 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62056 states. [2019-10-02 12:06:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62056 to 61160. [2019-10-02 12:06:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61160 states. [2019-10-02 12:06:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61160 states to 61160 states and 100703 transitions. [2019-10-02 12:06:21,927 INFO L78 Accepts]: Start accepts. Automaton has 61160 states and 100703 transitions. Word has length 238 [2019-10-02 12:06:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:21,928 INFO L475 AbstractCegarLoop]: Abstraction has 61160 states and 100703 transitions. [2019-10-02 12:06:21,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:06:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 61160 states and 100703 transitions. [2019-10-02 12:06:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 12:06:21,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:21,935 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:21,935 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash 110208318, now seen corresponding path program 1 times [2019-10-02 12:06:21,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:21,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:22,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:22,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:06:22,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:06:22,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:06:22,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:22,089 INFO L87 Difference]: Start difference. First operand 61160 states and 100703 transitions. Second operand 5 states. [2019-10-02 12:06:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:25,295 INFO L93 Difference]: Finished difference Result 122391 states and 201451 transitions. [2019-10-02 12:06:25,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:06:25,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2019-10-02 12:06:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:25,622 INFO L225 Difference]: With dead ends: 122391 [2019-10-02 12:06:25,622 INFO L226 Difference]: Without dead ends: 61462 [2019-10-02 12:06:25,792 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:06:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61462 states. [2019-10-02 12:06:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61462 to 61152. [2019-10-02 12:06:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61152 states. [2019-10-02 12:06:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61152 states to 61152 states and 100684 transitions. [2019-10-02 12:06:31,326 INFO L78 Accepts]: Start accepts. Automaton has 61152 states and 100684 transitions. Word has length 238 [2019-10-02 12:06:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:31,327 INFO L475 AbstractCegarLoop]: Abstraction has 61152 states and 100684 transitions. [2019-10-02 12:06:31,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:06:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 61152 states and 100684 transitions. [2019-10-02 12:06:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 12:06:31,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:31,331 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:31,331 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash 689964441, now seen corresponding path program 1 times [2019-10-02 12:06:31,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:31,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:31,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:31,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:31,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:06:31,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:06:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:06:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:31,497 INFO L87 Difference]: Start difference. First operand 61152 states and 100684 transitions. Second operand 9 states. [2019-10-02 12:06:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:34,617 INFO L93 Difference]: Finished difference Result 123737 states and 203405 transitions. [2019-10-02 12:06:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:06:34,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 237 [2019-10-02 12:06:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:35,007 INFO L225 Difference]: With dead ends: 123737 [2019-10-02 12:06:35,007 INFO L226 Difference]: Without dead ends: 62816 [2019-10-02 12:06:35,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62816 states. [2019-10-02 12:06:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62816 to 61248. [2019-10-02 12:06:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61248 states. [2019-10-02 12:06:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61248 states to 61248 states and 100780 transitions. [2019-10-02 12:06:41,691 INFO L78 Accepts]: Start accepts. Automaton has 61248 states and 100780 transitions. Word has length 237 [2019-10-02 12:06:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:41,691 INFO L475 AbstractCegarLoop]: Abstraction has 61248 states and 100780 transitions. [2019-10-02 12:06:41,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:06:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 61248 states and 100780 transitions. [2019-10-02 12:06:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 12:06:41,698 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:41,698 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:41,698 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1914804318, now seen corresponding path program 1 times [2019-10-02 12:06:41,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:41,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:41,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:41,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:41,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 12:06:41,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:41,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:06:41,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:41,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:41,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:41,986 INFO L87 Difference]: Start difference. First operand 61248 states and 100780 transitions. Second operand 8 states. [2019-10-02 12:06:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:53,158 INFO L93 Difference]: Finished difference Result 205418 states and 342598 transitions. [2019-10-02 12:06:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:06:53,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 246 [2019-10-02 12:06:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:54,051 INFO L225 Difference]: With dead ends: 205418 [2019-10-02 12:06:54,052 INFO L226 Difference]: Without dead ends: 144337 [2019-10-02 12:06:54,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144337 states. [2019-10-02 12:07:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144337 to 144207. [2019-10-02 12:07:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144207 states. [2019-10-02 12:07:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144207 states to 144207 states and 238696 transitions. [2019-10-02 12:07:06,815 INFO L78 Accepts]: Start accepts. Automaton has 144207 states and 238696 transitions. Word has length 246 [2019-10-02 12:07:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:06,816 INFO L475 AbstractCegarLoop]: Abstraction has 144207 states and 238696 transitions. [2019-10-02 12:07:06,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 144207 states and 238696 transitions. [2019-10-02 12:07:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 12:07:06,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:06,822 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:06,823 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -570997708, now seen corresponding path program 1 times [2019-10-02 12:07:06,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:06,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:07:07,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:07,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:07,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:07,001 INFO L87 Difference]: Start difference. First operand 144207 states and 238696 transitions. Second operand 7 states. [2019-10-02 12:07:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:21,569 INFO L93 Difference]: Finished difference Result 268175 states and 443898 transitions. [2019-10-02 12:07:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:07:21,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 249 [2019-10-02 12:07:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:22,377 INFO L225 Difference]: With dead ends: 268175 [2019-10-02 12:07:22,377 INFO L226 Difference]: Without dead ends: 149154 [2019-10-02 12:07:28,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:07:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149154 states. [2019-10-02 12:07:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149154 to 147599. [2019-10-02 12:07:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147599 states. [2019-10-02 12:07:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147599 states to 147599 states and 243048 transitions. [2019-10-02 12:07:37,281 INFO L78 Accepts]: Start accepts. Automaton has 147599 states and 243048 transitions. Word has length 249 [2019-10-02 12:07:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:37,282 INFO L475 AbstractCegarLoop]: Abstraction has 147599 states and 243048 transitions. [2019-10-02 12:07:37,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:07:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 147599 states and 243048 transitions. [2019-10-02 12:07:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 12:07:37,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:37,287 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,288 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:37,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:37,288 INFO L82 PathProgramCache]: Analyzing trace with hash -410040944, now seen corresponding path program 1 times [2019-10-02 12:07:37,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:37,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:37,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 12:07:37,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:37,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:07:37,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:07:37,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:07:37,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:37,455 INFO L87 Difference]: Start difference. First operand 147599 states and 243048 transitions. Second operand 8 states. [2019-10-02 12:07:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:46,950 INFO L93 Difference]: Finished difference Result 147684 states and 243170 transitions. [2019-10-02 12:07:46,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:07:46,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2019-10-02 12:07:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:47,925 INFO L225 Difference]: With dead ends: 147684 [2019-10-02 12:07:47,925 INFO L226 Difference]: Without dead ends: 147667 [2019-10-02 12:07:47,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147667 states. [2019-10-02 12:07:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147667 to 147599. [2019-10-02 12:07:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147599 states. [2019-10-02 12:07:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147599 states to 147599 states and 242888 transitions. [2019-10-02 12:07:56,885 INFO L78 Accepts]: Start accepts. Automaton has 147599 states and 242888 transitions. Word has length 254 [2019-10-02 12:07:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:56,886 INFO L475 AbstractCegarLoop]: Abstraction has 147599 states and 242888 transitions. [2019-10-02 12:07:56,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 147599 states and 242888 transitions. [2019-10-02 12:07:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 12:07:56,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:56,894 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:56,894 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -885483164, now seen corresponding path program 1 times [2019-10-02 12:07:56,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:56,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:56,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:56,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:07:57,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:57,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:07:57,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:07:57,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:07:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:57,103 INFO L87 Difference]: Start difference. First operand 147599 states and 242888 transitions. Second operand 9 states. [2019-10-02 12:08:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:14,761 INFO L93 Difference]: Finished difference Result 295403 states and 486752 transitions. [2019-10-02 12:08:14,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:08:14,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 272 [2019-10-02 12:08:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:15,516 INFO L225 Difference]: With dead ends: 295403 [2019-10-02 12:08:15,516 INFO L226 Difference]: Without dead ends: 148047 [2019-10-02 12:08:15,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:08:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148047 states. [2019-10-02 12:08:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148047 to 147599. [2019-10-02 12:08:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147599 states. [2019-10-02 12:08:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147599 states to 147599 states and 242728 transitions. [2019-10-02 12:08:25,215 INFO L78 Accepts]: Start accepts. Automaton has 147599 states and 242728 transitions. Word has length 272 [2019-10-02 12:08:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:25,216 INFO L475 AbstractCegarLoop]: Abstraction has 147599 states and 242728 transitions. [2019-10-02 12:08:25,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 147599 states and 242728 transitions. [2019-10-02 12:08:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 12:08:25,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:25,225 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:25,225 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash -623060878, now seen corresponding path program 1 times [2019-10-02 12:08:25,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:25,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:25,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:08:25,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:08:25,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:08:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:08:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:08:25,415 INFO L87 Difference]: Start difference. First operand 147599 states and 242728 transitions. Second operand 4 states. [2019-10-02 12:08:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:40,143 INFO L93 Difference]: Finished difference Result 294514 states and 491855 transitions. [2019-10-02 12:08:40,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:08:40,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-10-02 12:08:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:40,843 INFO L225 Difference]: With dead ends: 294514 [2019-10-02 12:08:40,843 INFO L226 Difference]: Without dead ends: 147022 [2019-10-02 12:08:41,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:08:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147022 states. [2019-10-02 12:08:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147022 to 147022. [2019-10-02 12:08:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147022 states. [2019-10-02 12:08:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147022 states to 147022 states and 241574 transitions. [2019-10-02 12:08:55,405 INFO L78 Accepts]: Start accepts. Automaton has 147022 states and 241574 transitions. Word has length 282 [2019-10-02 12:08:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:55,406 INFO L475 AbstractCegarLoop]: Abstraction has 147022 states and 241574 transitions. [2019-10-02 12:08:55,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:08:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 147022 states and 241574 transitions. [2019-10-02 12:08:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 12:08:55,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:55,417 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:55,417 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2135323200, now seen corresponding path program 1 times [2019-10-02 12:08:55,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:55,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:55,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-02 12:08:55,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:55,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:08:55,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:08:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:08:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:55,717 INFO L87 Difference]: Start difference. First operand 147022 states and 241574 transitions. Second operand 9 states. [2019-10-02 12:09:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:31,920 INFO L93 Difference]: Finished difference Result 473630 states and 793630 transitions. [2019-10-02 12:09:31,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:09:31,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 283 [2019-10-02 12:09:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:33,844 INFO L225 Difference]: With dead ends: 473630 [2019-10-02 12:09:33,844 INFO L226 Difference]: Without dead ends: 326715 [2019-10-02 12:09:34,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:09:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326715 states. [2019-10-02 12:10:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326715 to 311758. [2019-10-02 12:10:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311758 states. [2019-10-02 12:10:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311758 states to 311758 states and 522352 transitions. [2019-10-02 12:10:06,482 INFO L78 Accepts]: Start accepts. Automaton has 311758 states and 522352 transitions. Word has length 283 [2019-10-02 12:10:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:06,482 INFO L475 AbstractCegarLoop]: Abstraction has 311758 states and 522352 transitions. [2019-10-02 12:10:06,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:10:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 311758 states and 522352 transitions. [2019-10-02 12:10:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 12:10:06,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:06,498 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:06,498 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:06,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:06,499 INFO L82 PathProgramCache]: Analyzing trace with hash -703178128, now seen corresponding path program 1 times [2019-10-02 12:10:06,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:06,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:06,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 12:10:06,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:06,703 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:06,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:07,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 3577 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 12:10:07,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 12:10:07,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:07,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2019-10-02 12:10:07,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:10:07,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:10:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:10:07,467 INFO L87 Difference]: Start difference. First operand 311758 states and 522352 transitions. Second operand 16 states. [2019-10-02 12:10:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:53,467 INFO L93 Difference]: Finished difference Result 666929 states and 1132780 transitions. [2019-10-02 12:10:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:10:53,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 283 [2019-10-02 12:10:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:56,294 INFO L225 Difference]: With dead ends: 666929 [2019-10-02 12:10:56,294 INFO L226 Difference]: Without dead ends: 355278 [2019-10-02 12:10:57,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-10-02 12:10:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355278 states. [2019-10-02 12:11:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355278 to 338203. [2019-10-02 12:11:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338203 states. [2019-10-02 12:11:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338203 states to 338203 states and 568862 transitions. [2019-10-02 12:11:35,888 INFO L78 Accepts]: Start accepts. Automaton has 338203 states and 568862 transitions. Word has length 283 [2019-10-02 12:11:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:35,889 INFO L475 AbstractCegarLoop]: Abstraction has 338203 states and 568862 transitions. [2019-10-02 12:11:35,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:11:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 338203 states and 568862 transitions. [2019-10-02 12:11:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-02 12:11:35,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:35,900 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:35,900 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:35,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:35,901 INFO L82 PathProgramCache]: Analyzing trace with hash -716521797, now seen corresponding path program 1 times [2019-10-02 12:11:35,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:35,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:35,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:35,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 12:11:36,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:11:36,087 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:11:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:38,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 3771 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:11:38,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:11:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 12:11:38,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:11:38,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-10-02 12:11:38,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:11:38,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:11:38,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:11:38,325 INFO L87 Difference]: Start difference. First operand 338203 states and 568862 transitions. Second operand 14 states. [2019-10-02 12:13:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:21,367 INFO L93 Difference]: Finished difference Result 1142884 states and 2025539 transitions. [2019-10-02 12:13:21,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 12:13:21,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 277 [2019-10-02 12:13:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:27,654 INFO L225 Difference]: With dead ends: 1142884 [2019-10-02 12:13:27,654 INFO L226 Difference]: Without dead ends: 803984 [2019-10-02 12:13:29,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=547, Invalid=2105, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 12:13:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803984 states.