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_spec14_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:53:20,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:53:20,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:53:20,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:53:20,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:53:20,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:53:20,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:53:20,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:53:20,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:53:20,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:53:20,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:53:20,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:53:20,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:53:20,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:53:20,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:53:20,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:53:20,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:53:20,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:53:20,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:53:20,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:53:20,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:53:20,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:53:20,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:53:20,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:53:20,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:53:20,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:53:20,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:53:20,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:53:20,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:53:20,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:53:20,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:53:20,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:53:20,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:53:20,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:53:20,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:53:20,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:53:20,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:53:20,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:53:20,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:53:20,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:53:20,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:53:20,878 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 11:53:20,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:53:20,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:53:20,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:53:20,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:53:20,894 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:53:20,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:53:20,894 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:53:20,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:53:20,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:53:20,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:53:20,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:53:20,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:53:20,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:53:20,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:53:20,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:53:20,896 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:53:20,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:53:20,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:53:20,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:53:20,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:53:20,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:53:20,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:53:20,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:53:20,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:53:20,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:53:20,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:53:20,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:53:20,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:53:20,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:53:20,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:53:20,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:53:20,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:53:20,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:53:20,968 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:53:20,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-02 11:53:21,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda62d8dd/e298865e054e4d40b85b54347dae970b/FLAGf80877748 [2019-10-02 11:53:21,613 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:53:21,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-02 11:53:21,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda62d8dd/e298865e054e4d40b85b54347dae970b/FLAGf80877748 [2019-10-02 11:53:21,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda62d8dd/e298865e054e4d40b85b54347dae970b [2019-10-02 11:53:21,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:53:21,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:53:21,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:53:21,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:53:21,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:53:21,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:53:21" (1/1) ... [2019-10-02 11:53:21,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dab14c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:21, skipping insertion in model container [2019-10-02 11:53:21,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:53:21" (1/1) ... [2019-10-02 11:53:21,913 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:53:21,997 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:53:22,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:53:22,696 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:53:22,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:53:22,910 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:53:22,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22 WrapperNode [2019-10-02 11:53:22,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:53:22,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:53:22,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:53:22,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:53:22,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (1/1) ... [2019-10-02 11:53:22,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (1/1) ... [2019-10-02 11:53:22,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (1/1) ... [2019-10-02 11:53:22,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (1/1) ... [2019-10-02 11:53:23,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (1/1) ... [2019-10-02 11:53:23,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (1/1) ... [2019-10-02 11:53:23,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (1/1) ... [2019-10-02 11:53:23,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:53:23,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:53:23,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:53:23,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:53:23,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (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 11:53:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:53:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:53:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:53:23,202 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:53:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:53:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:53:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:53:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:53:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:53:23,205 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:53:23,205 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:53:23,205 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:53:23,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:53:23,206 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:53:23,207 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:53:23,207 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:53:23,210 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:53:23,210 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:53:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:53:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:53:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:53:23,211 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:53:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:53:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:53:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:53:23,212 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:53:23,213 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:53:23,213 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:53:23,213 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:53:23,213 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:53:23,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:53:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:53:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:53:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:53:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:53:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:53:23,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:53:23,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:53:23,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:53:23,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:53:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:53:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:53:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:53:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:53:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:53:23,216 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:53:23,217 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:53:23,217 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:53:23,217 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:53:23,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:53:23,217 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:53:23,217 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:53:23,218 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:53:23,218 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:53:23,218 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:53:23,218 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:53:23,218 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:53:23,218 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:53:23,218 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:53:23,219 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:53:23,219 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:53:23,219 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:53:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:53:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:53:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:53:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:53:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:53:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:53:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:53:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:53:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:53:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:53:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:53:23,222 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:53:23,223 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:53:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:53:23,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:53:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:53:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:53:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:53:23,224 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:53:23,225 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:53:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:53:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:53:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:53:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:53:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:53:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:53:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:53:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:53:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:53:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:53:23,230 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:53:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:53:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:53:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:53:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:53:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:53:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:53:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:53:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:53:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:53:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:53:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:53:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:53:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:53:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:53:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:53:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:53:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:53:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:53:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:53:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:53:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:53:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:53:23,235 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:53:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:53:23,236 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:53:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:53:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:53:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:53:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:53:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:53:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:53:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:53:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:53:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:53:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:53:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:53:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:53:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:53:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:53:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:53:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:53:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:53:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:53:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:53:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:53:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:53:23,249 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:53:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:53:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:53:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:53:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:53:23,257 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:53:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:53:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:53:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:53:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:53:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:53:23,260 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:53:23,260 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:53:23,260 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:53:23,260 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:53:23,260 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:53:23,260 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:53:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:53:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:53:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:53:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:53:23,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:53:25,857 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:53:25,857 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:53:25,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:53:25 BoogieIcfgContainer [2019-10-02 11:53:25,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:53:25,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:53:25,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:53:25,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:53:25,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:53:21" (1/3) ... [2019-10-02 11:53:25,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408f99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:53:25, skipping insertion in model container [2019-10-02 11:53:25,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:53:22" (2/3) ... [2019-10-02 11:53:25,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4408f99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:53:25, skipping insertion in model container [2019-10-02 11:53:25,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:53:25" (3/3) ... [2019-10-02 11:53:25,870 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product19.cil.c [2019-10-02 11:53:25,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:53:25,894 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:53:25,912 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:53:25,958 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:53:25,959 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:53:25,959 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:53:25,959 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:53:25,959 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:53:25,959 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:53:25,960 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:53:25,960 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:53:25,960 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:53:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states. [2019-10-02 11:53:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 11:53:26,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:26,042 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:26,045 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:26,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1411507135, now seen corresponding path program 1 times [2019-10-02 11:53:26,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:26,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:26,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:26,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:26,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:26,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:53:26,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:53:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:53:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:53:26,763 INFO L87 Difference]: Start difference. First operand 735 states. Second operand 4 states. [2019-10-02 11:53:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:26,977 INFO L93 Difference]: Finished difference Result 1168 states and 1874 transitions. [2019-10-02 11:53:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:53:26,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 11:53:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:27,003 INFO L225 Difference]: With dead ends: 1168 [2019-10-02 11:53:27,004 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 11:53:27,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:53:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 11:53:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 11:53:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 11:53:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 928 transitions. [2019-10-02 11:53:27,119 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 928 transitions. Word has length 135 [2019-10-02 11:53:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:27,120 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 928 transitions. [2019-10-02 11:53:27,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:53:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 928 transitions. [2019-10-02 11:53:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 11:53:27,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:27,127 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:27,128 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1349279833, now seen corresponding path program 1 times [2019-10-02 11:53:27,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:27,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:27,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:27,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:27,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:27,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:27,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:53:27,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:53:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:53:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:53:27,384 INFO L87 Difference]: Start difference. First operand 587 states and 928 transitions. Second operand 4 states. [2019-10-02 11:53:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:27,492 INFO L93 Difference]: Finished difference Result 1141 states and 1817 transitions. [2019-10-02 11:53:27,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:53:27,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-02 11:53:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:27,499 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 11:53:27,499 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 11:53:27,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:53:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 11:53:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 11:53:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 11:53:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 927 transitions. [2019-10-02 11:53:27,537 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 927 transitions. Word has length 136 [2019-10-02 11:53:27,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:27,538 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 927 transitions. [2019-10-02 11:53:27,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:53:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 927 transitions. [2019-10-02 11:53:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 11:53:27,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:27,543 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:27,545 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:27,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1382966461, now seen corresponding path program 1 times [2019-10-02 11:53:27,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:27,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:27,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:27,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:27,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:53:27,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:53:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:53:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:53:27,840 INFO L87 Difference]: Start difference. First operand 587 states and 927 transitions. Second operand 4 states. [2019-10-02 11:53:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:27,965 INFO L93 Difference]: Finished difference Result 1141 states and 1816 transitions. [2019-10-02 11:53:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:53:27,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-02 11:53:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:27,978 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 11:53:27,979 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 11:53:27,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:53:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 11:53:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 11:53:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 11:53:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 926 transitions. [2019-10-02 11:53:28,041 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 926 transitions. Word has length 137 [2019-10-02 11:53:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:28,042 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 926 transitions. [2019-10-02 11:53:28,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:53:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 926 transitions. [2019-10-02 11:53:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 11:53:28,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:28,053 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:28,053 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1519078827, now seen corresponding path program 1 times [2019-10-02 11:53:28,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:28,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:28,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:28,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:28,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:28,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:53:28,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:53:28,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:53:28,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:53:28,316 INFO L87 Difference]: Start difference. First operand 587 states and 926 transitions. Second operand 4 states. [2019-10-02 11:53:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:28,410 INFO L93 Difference]: Finished difference Result 1141 states and 1815 transitions. [2019-10-02 11:53:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:53:28,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 11:53:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:28,416 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 11:53:28,416 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 11:53:28,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:53:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 11:53:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 11:53:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 11:53:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 925 transitions. [2019-10-02 11:53:28,451 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 925 transitions. Word has length 138 [2019-10-02 11:53:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:28,451 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 925 transitions. [2019-10-02 11:53:28,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:53:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 925 transitions. [2019-10-02 11:53:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 11:53:28,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:28,457 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:28,457 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:28,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash -939532999, now seen corresponding path program 1 times [2019-10-02 11:53:28,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:28,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:28,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:28,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:28,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:53:28,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:53:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:53:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:53:28,607 INFO L87 Difference]: Start difference. First operand 587 states and 925 transitions. Second operand 4 states. [2019-10-02 11:53:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:28,682 INFO L93 Difference]: Finished difference Result 1141 states and 1814 transitions. [2019-10-02 11:53:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:53:28,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 11:53:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:28,692 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 11:53:28,693 INFO L226 Difference]: Without dead ends: 587 [2019-10-02 11:53:28,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:53:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-02 11:53:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-02 11:53:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-02 11:53:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 924 transitions. [2019-10-02 11:53:28,725 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 924 transitions. Word has length 139 [2019-10-02 11:53:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:28,725 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 924 transitions. [2019-10-02 11:53:28,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:53:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 924 transitions. [2019-10-02 11:53:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 11:53:28,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:28,731 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:28,731 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:28,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash 195155025, now seen corresponding path program 1 times [2019-10-02 11:53:28,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:28,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:28,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:29,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:29,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:53:29,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:53:29,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:53:29,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:53:29,027 INFO L87 Difference]: Start difference. First operand 587 states and 924 transitions. Second operand 10 states. [2019-10-02 11:53:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:29,231 INFO L93 Difference]: Finished difference Result 1146 states and 1821 transitions. [2019-10-02 11:53:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:53:29,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-02 11:53:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:29,237 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 11:53:29,237 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:53:29,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:53:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:53:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2019-10-02 11:53:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-02 11:53:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 934 transitions. [2019-10-02 11:53:29,264 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 934 transitions. Word has length 140 [2019-10-02 11:53:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:29,264 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 934 transitions. [2019-10-02 11:53:29,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:53:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 934 transitions. [2019-10-02 11:53:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 11:53:29,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:29,269 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:29,270 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -791427664, now seen corresponding path program 1 times [2019-10-02 11:53:29,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:29,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:29,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:29,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:29,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:29,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:53:29,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:53:29,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:53:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:53:29,383 INFO L87 Difference]: Start difference. First operand 594 states and 934 transitions. Second operand 4 states. [2019-10-02 11:53:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:29,450 INFO L93 Difference]: Finished difference Result 1147 states and 1822 transitions. [2019-10-02 11:53:29,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:53:29,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 11:53:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:29,461 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 11:53:29,461 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 11:53:29,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:53:29,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 11:53:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-02 11:53:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-02 11:53:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-10-02 11:53:29,493 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 140 [2019-10-02 11:53:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:29,493 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-10-02 11:53:29,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:53:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-10-02 11:53:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 11:53:29,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:29,499 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:29,499 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -306965809, now seen corresponding path program 1 times [2019-10-02 11:53:29,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:29,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:29,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:53:29,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:53:29,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:53:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:53:29,708 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-10-02 11:53:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:30,016 INFO L93 Difference]: Finished difference Result 1160 states and 1846 transitions. [2019-10-02 11:53:30,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:53:30,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 11:53:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:30,022 INFO L225 Difference]: With dead ends: 1160 [2019-10-02 11:53:30,022 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 11:53:30,026 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:53:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 11:53:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2019-10-02 11:53:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-02 11:53:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 928 transitions. [2019-10-02 11:53:30,055 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 928 transitions. Word has length 141 [2019-10-02 11:53:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:30,056 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 928 transitions. [2019-10-02 11:53:30,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:53:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 928 transitions. [2019-10-02 11:53:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 11:53:30,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:30,060 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:30,061 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash 394745588, now seen corresponding path program 1 times [2019-10-02 11:53:30,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:30,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:30,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:30,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:30,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:30,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:30,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:53:30,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:53:30,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:53:30,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:53:30,227 INFO L87 Difference]: Start difference. First operand 595 states and 928 transitions. Second operand 6 states. [2019-10-02 11:53:30,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:30,454 INFO L93 Difference]: Finished difference Result 1123 states and 1761 transitions. [2019-10-02 11:53:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:53:30,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 11:53:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:30,461 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 11:53:30,461 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 11:53:30,465 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:53:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 11:53:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-02 11:53:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-02 11:53:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 924 transitions. [2019-10-02 11:53:30,488 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 924 transitions. Word has length 142 [2019-10-02 11:53:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:30,488 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 924 transitions. [2019-10-02 11:53:30,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:53:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 924 transitions. [2019-10-02 11:53:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:53:30,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:30,493 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:30,493 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash -447409932, now seen corresponding path program 1 times [2019-10-02 11:53:30,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:30,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:30,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:30,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:30,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:53:30,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:53:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:53:30,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:53:30,623 INFO L87 Difference]: Start difference. First operand 595 states and 924 transitions. Second operand 6 states. [2019-10-02 11:53:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:30,857 INFO L93 Difference]: Finished difference Result 1123 states and 1757 transitions. [2019-10-02 11:53:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:53:30,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 11:53:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:30,902 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 11:53:30,903 INFO L226 Difference]: Without dead ends: 595 [2019-10-02 11:53:30,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:53:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-02 11:53:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-02 11:53:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-02 11:53:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 920 transitions. [2019-10-02 11:53:30,926 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 920 transitions. Word has length 143 [2019-10-02 11:53:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:30,926 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 920 transitions. [2019-10-02 11:53:30,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:53:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 920 transitions. [2019-10-02 11:53:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 11:53:30,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:30,931 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:30,931 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash -170078860, now seen corresponding path program 1 times [2019-10-02 11:53:30,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:30,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:30,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:30,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:30,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:31,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:31,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:53:31,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:53:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:53:31,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:53:31,058 INFO L87 Difference]: Start difference. First operand 595 states and 920 transitions. Second operand 7 states. [2019-10-02 11:53:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:31,188 INFO L93 Difference]: Finished difference Result 1126 states and 1757 transitions. [2019-10-02 11:53:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:53:31,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 11:53:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:31,195 INFO L225 Difference]: With dead ends: 1126 [2019-10-02 11:53:31,196 INFO L226 Difference]: Without dead ends: 577 [2019-10-02 11:53:31,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:53:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-02 11:53:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-10-02 11:53:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:53:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 883 transitions. [2019-10-02 11:53:31,226 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 883 transitions. Word has length 143 [2019-10-02 11:53:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:31,226 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 883 transitions. [2019-10-02 11:53:31,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:53:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 883 transitions. [2019-10-02 11:53:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 11:53:31,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:31,230 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:31,231 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:31,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1904799623, now seen corresponding path program 1 times [2019-10-02 11:53:31,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:31,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:31,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:31,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:31,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:31,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:53:31,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:53:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:53:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:53:31,357 INFO L87 Difference]: Start difference. First operand 574 states and 883 transitions. Second operand 6 states. [2019-10-02 11:53:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:31,486 INFO L93 Difference]: Finished difference Result 1102 states and 1716 transitions. [2019-10-02 11:53:31,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:53:31,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 11:53:31,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:31,493 INFO L225 Difference]: With dead ends: 1102 [2019-10-02 11:53:31,493 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 11:53:31,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:53:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 11:53:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-02 11:53:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:53:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-10-02 11:53:31,520 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 144 [2019-10-02 11:53:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:31,520 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-10-02 11:53:31,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:53:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-10-02 11:53:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 11:53:31,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:31,525 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:31,525 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -959612135, now seen corresponding path program 1 times [2019-10-02 11:53:31,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:31,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:31,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:31,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:31,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:31,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:31,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:53:31,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:53:31,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:53:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:53:31,655 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 6 states. [2019-10-02 11:53:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:31,800 INFO L93 Difference]: Finished difference Result 1102 states and 1715 transitions. [2019-10-02 11:53:31,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:53:31,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 11:53:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:31,805 INFO L225 Difference]: With dead ends: 1102 [2019-10-02 11:53:31,806 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 11:53:31,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:53:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 11:53:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-02 11:53:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:53:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 881 transitions. [2019-10-02 11:53:31,829 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 881 transitions. Word has length 145 [2019-10-02 11:53:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:31,829 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 881 transitions. [2019-10-02 11:53:31,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:53:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 881 transitions. [2019-10-02 11:53:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 11:53:31,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:31,834 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:31,834 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1451023870, now seen corresponding path program 1 times [2019-10-02 11:53:31,835 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:31,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:31,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:31,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:31,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:53:32,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:32,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:53:32,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:53:32,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:53:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:53:32,025 INFO L87 Difference]: Start difference. First operand 574 states and 881 transitions. Second operand 12 states. [2019-10-02 11:53:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:32,278 INFO L93 Difference]: Finished difference Result 1108 states and 1725 transitions. [2019-10-02 11:53:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:53:32,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-02 11:53:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:32,284 INFO L225 Difference]: With dead ends: 1108 [2019-10-02 11:53:32,285 INFO L226 Difference]: Without dead ends: 581 [2019-10-02 11:53:32,289 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:53:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-02 11:53:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-10-02 11:53:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-02 11:53:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 887 transitions. [2019-10-02 11:53:32,315 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 887 transitions. Word has length 146 [2019-10-02 11:53:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:32,317 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 887 transitions. [2019-10-02 11:53:32,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:53:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 887 transitions. [2019-10-02 11:53:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 11:53:32,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:32,323 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:32,323 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:32,324 INFO L82 PathProgramCache]: Analyzing trace with hash 457980586, now seen corresponding path program 1 times [2019-10-02 11:53:32,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:32,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:32,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:32,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:53:32,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:32,539 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 11:53:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:33,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:53:33,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:53:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 11:53:33,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:53:33,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:53:33,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:53:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:53:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:53:33,263 INFO L87 Difference]: Start difference. First operand 579 states and 887 transitions. Second operand 13 states. [2019-10-02 11:53:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:44,448 INFO L93 Difference]: Finished difference Result 1689 states and 2724 transitions. [2019-10-02 11:53:44,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:53:44,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-10-02 11:53:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:44,459 INFO L225 Difference]: With dead ends: 1689 [2019-10-02 11:53:44,460 INFO L226 Difference]: Without dead ends: 1163 [2019-10-02 11:53:44,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:53:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2019-10-02 11:53:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1146. [2019-10-02 11:53:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-10-02 11:53:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1818 transitions. [2019-10-02 11:53:44,532 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1818 transitions. Word has length 147 [2019-10-02 11:53:44,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:44,533 INFO L475 AbstractCegarLoop]: Abstraction has 1146 states and 1818 transitions. [2019-10-02 11:53:44,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:53:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1818 transitions. [2019-10-02 11:53:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:53:44,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:44,538 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:53:44,538 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:44,539 INFO L82 PathProgramCache]: Analyzing trace with hash -182206803, now seen corresponding path program 1 times [2019-10-02 11:53:44,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:44,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:44,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:44,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:44,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:53:44,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:53:44,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:53:44,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:53:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:53:44,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:53:44,692 INFO L87 Difference]: Start difference. First operand 1146 states and 1818 transitions. Second operand 3 states. [2019-10-02 11:53:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:44,759 INFO L93 Difference]: Finished difference Result 2555 states and 4023 transitions. [2019-10-02 11:53:44,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:53:44,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-02 11:53:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:44,772 INFO L225 Difference]: With dead ends: 2555 [2019-10-02 11:53:44,773 INFO L226 Difference]: Without dead ends: 1462 [2019-10-02 11:53:44,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:53:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-10-02 11:53:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1459. [2019-10-02 11:53:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-10-02 11:53:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2251 transitions. [2019-10-02 11:53:44,856 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2251 transitions. Word has length 156 [2019-10-02 11:53:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:44,856 INFO L475 AbstractCegarLoop]: Abstraction has 1459 states and 2251 transitions. [2019-10-02 11:53:44,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:53:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2251 transitions. [2019-10-02 11:53:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 11:53:44,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:44,861 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:44,861 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2114750731, now seen corresponding path program 1 times [2019-10-02 11:53:44,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:44,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:44,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:44,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:44,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 11:53:45,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:45,026 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 11:53:45,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:45,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:53:45,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:53:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 11:53:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:53:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:53:45,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:53:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:53:45,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:53:45,680 INFO L87 Difference]: Start difference. First operand 1459 states and 2251 transitions. Second operand 9 states. [2019-10-02 11:53:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:47,036 INFO L93 Difference]: Finished difference Result 2889 states and 4585 transitions. [2019-10-02 11:53:47,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:53:47,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-10-02 11:53:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:47,051 INFO L225 Difference]: With dead ends: 2889 [2019-10-02 11:53:47,051 INFO L226 Difference]: Without dead ends: 1475 [2019-10-02 11:53:47,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:53:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-10-02 11:53:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2019-10-02 11:53:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-10-02 11:53:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2245 transitions. [2019-10-02 11:53:47,147 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2245 transitions. Word has length 150 [2019-10-02 11:53:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:47,148 INFO L475 AbstractCegarLoop]: Abstraction has 1475 states and 2245 transitions. [2019-10-02 11:53:47,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:53:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2245 transitions. [2019-10-02 11:53:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 11:53:47,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:47,152 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:47,152 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:47,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:47,153 INFO L82 PathProgramCache]: Analyzing trace with hash 395684240, now seen corresponding path program 1 times [2019-10-02 11:53:47,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:47,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:47,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:47,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:47,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:53:47,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:47,324 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 11:53:47,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:47,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 2637 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:53:47,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:53:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:53:48,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:53:48,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:53:48,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:53:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:53:48,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:53:48,071 INFO L87 Difference]: Start difference. First operand 1475 states and 2245 transitions. Second operand 13 states. [2019-10-02 11:53:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:58,719 INFO L93 Difference]: Finished difference Result 4663 states and 7394 transitions. [2019-10-02 11:53:58,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:53:58,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2019-10-02 11:53:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:58,745 INFO L225 Difference]: With dead ends: 4663 [2019-10-02 11:53:58,745 INFO L226 Difference]: Without dead ends: 3241 [2019-10-02 11:53:58,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:53:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2019-10-02 11:53:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3170. [2019-10-02 11:53:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2019-10-02 11:53:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4916 transitions. [2019-10-02 11:53:58,922 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4916 transitions. Word has length 153 [2019-10-02 11:53:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:58,922 INFO L475 AbstractCegarLoop]: Abstraction has 3170 states and 4916 transitions. [2019-10-02 11:53:58,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:53:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4916 transitions. [2019-10-02 11:53:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:53:58,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:58,931 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:58,931 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash 110325351, now seen corresponding path program 1 times [2019-10-02 11:53:58,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:58,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:58,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:53:59,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:59,135 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:53:59,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:53:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:59,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:53:59,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:53:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:53:59,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:53:59,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:53:59,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:53:59,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:53:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:53:59,783 INFO L87 Difference]: Start difference. First operand 3170 states and 4916 transitions. Second operand 13 states. [2019-10-02 11:54:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:10,396 INFO L93 Difference]: Finished difference Result 9084 states and 14476 transitions. [2019-10-02 11:54:10,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:54:10,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 156 [2019-10-02 11:54:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:10,440 INFO L225 Difference]: With dead ends: 9084 [2019-10-02 11:54:10,441 INFO L226 Difference]: Without dead ends: 5973 [2019-10-02 11:54:10,463 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:54:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2019-10-02 11:54:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5821. [2019-10-02 11:54:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5821 states. [2019-10-02 11:54:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5821 states to 5821 states and 9090 transitions. [2019-10-02 11:54:10,798 INFO L78 Accepts]: Start accepts. Automaton has 5821 states and 9090 transitions. Word has length 156 [2019-10-02 11:54:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:10,799 INFO L475 AbstractCegarLoop]: Abstraction has 5821 states and 9090 transitions. [2019-10-02 11:54:10,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:54:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5821 states and 9090 transitions. [2019-10-02 11:54:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 11:54:10,815 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:10,816 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:54:10,816 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash -638133708, now seen corresponding path program 1 times [2019-10-02 11:54:10,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:10,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:10,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:54:11,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:11,063 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 11:54:11,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:11,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 2643 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:54:11,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:54:11,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:11,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:54:11,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:54:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:54:11,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:54:11,690 INFO L87 Difference]: Start difference. First operand 5821 states and 9090 transitions. Second operand 13 states. [2019-10-02 11:54:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:29,173 INFO L93 Difference]: Finished difference Result 24470 states and 39169 transitions. [2019-10-02 11:54:29,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:54:29,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-10-02 11:54:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:29,313 INFO L225 Difference]: With dead ends: 24470 [2019-10-02 11:54:29,314 INFO L226 Difference]: Without dead ends: 18714 [2019-10-02 11:54:29,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 11:54:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18714 states. [2019-10-02 11:54:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18714 to 18071. [2019-10-02 11:54:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18071 states. [2019-10-02 11:54:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18071 states to 18071 states and 28462 transitions. [2019-10-02 11:54:30,274 INFO L78 Accepts]: Start accepts. Automaton has 18071 states and 28462 transitions. Word has length 159 [2019-10-02 11:54:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:30,275 INFO L475 AbstractCegarLoop]: Abstraction has 18071 states and 28462 transitions. [2019-10-02 11:54:30,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:54:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 18071 states and 28462 transitions. [2019-10-02 11:54:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 11:54:30,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:30,293 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 11:54:30,293 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:30,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash -851883090, now seen corresponding path program 1 times [2019-10-02 11:54:30,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:30,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:30,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:30,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:30,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 11:54:30,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:30,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:54:30,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:54:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:54:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:30,448 INFO L87 Difference]: Start difference. First operand 18071 states and 28462 transitions. Second operand 9 states. [2019-10-02 11:54:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:31,706 INFO L93 Difference]: Finished difference Result 25465 states and 39949 transitions. [2019-10-02 11:54:31,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:54:31,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-02 11:54:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:31,752 INFO L225 Difference]: With dead ends: 25465 [2019-10-02 11:54:31,753 INFO L226 Difference]: Without dead ends: 7441 [2019-10-02 11:54:31,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:54:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7441 states. [2019-10-02 11:54:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7441 to 7433. [2019-10-02 11:54:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7433 states. [2019-10-02 11:54:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 11512 transitions. [2019-10-02 11:54:32,200 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 11512 transitions. Word has length 167 [2019-10-02 11:54:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:32,202 INFO L475 AbstractCegarLoop]: Abstraction has 7433 states and 11512 transitions. [2019-10-02 11:54:32,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:54:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 11512 transitions. [2019-10-02 11:54:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 11:54:32,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:32,209 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:54:32,210 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:32,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:32,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1281235935, now seen corresponding path program 1 times [2019-10-02 11:54:32,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:32,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:32,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:32,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 11:54:32,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:32,374 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 11:54:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:32,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:54:32,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:54:32,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:32,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 11:54:33,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:54:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:54:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:33,000 INFO L87 Difference]: Start difference. First operand 7433 states and 11512 transitions. Second operand 9 states. [2019-10-02 11:54:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:45,391 INFO L93 Difference]: Finished difference Result 18791 states and 29623 transitions. [2019-10-02 11:54:45,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:54:45,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-10-02 11:54:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:45,446 INFO L225 Difference]: With dead ends: 18791 [2019-10-02 11:54:45,447 INFO L226 Difference]: Without dead ends: 11411 [2019-10-02 11:54:45,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:54:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11411 states. [2019-10-02 11:54:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11411 to 7497. [2019-10-02 11:54:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7497 states. [2019-10-02 11:54:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7497 states to 7497 states and 11607 transitions. [2019-10-02 11:54:45,920 INFO L78 Accepts]: Start accepts. Automaton has 7497 states and 11607 transitions. Word has length 170 [2019-10-02 11:54:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:45,921 INFO L475 AbstractCegarLoop]: Abstraction has 7497 states and 11607 transitions. [2019-10-02 11:54:45,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:54:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 7497 states and 11607 transitions. [2019-10-02 11:54:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 11:54:45,927 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:45,928 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:54:45,928 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:45,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:45,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1801988446, now seen corresponding path program 1 times [2019-10-02 11:54:45,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:45,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:45,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:45,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:45,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 11:54:46,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:46,099 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 11:54:46,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:46,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 2679 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:54:46,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 17 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 11:54:46,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:46,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 11:54:46,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:54:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:54:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:46,708 INFO L87 Difference]: Start difference. First operand 7497 states and 11607 transitions. Second operand 9 states. [2019-10-02 11:54:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:51,588 INFO L93 Difference]: Finished difference Result 35453 states and 55878 transitions. [2019-10-02 11:54:51,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:54:51,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 171 [2019-10-02 11:54:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:51,774 INFO L225 Difference]: With dead ends: 35453 [2019-10-02 11:54:51,774 INFO L226 Difference]: Without dead ends: 27529 [2019-10-02 11:54:51,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:54:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27529 states. [2019-10-02 11:54:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27529 to 27239. [2019-10-02 11:54:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27239 states. [2019-10-02 11:54:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27239 states to 27239 states and 41711 transitions. [2019-10-02 11:54:53,402 INFO L78 Accepts]: Start accepts. Automaton has 27239 states and 41711 transitions. Word has length 171 [2019-10-02 11:54:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:53,402 INFO L475 AbstractCegarLoop]: Abstraction has 27239 states and 41711 transitions. [2019-10-02 11:54:53,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:54:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 27239 states and 41711 transitions. [2019-10-02 11:54:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:54:53,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:53,408 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:54:53,408 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1998234462, now seen corresponding path program 1 times [2019-10-02 11:54:53,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:53,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 11:54:53,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:53,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:54:53,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:54:53,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:54:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:54:53,574 INFO L87 Difference]: Start difference. First operand 27239 states and 41711 transitions. Second operand 7 states. [2019-10-02 11:54:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:57,636 INFO L93 Difference]: Finished difference Result 80320 states and 126508 transitions. [2019-10-02 11:54:57,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:54:57,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2019-10-02 11:54:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:58,009 INFO L225 Difference]: With dead ends: 80320 [2019-10-02 11:54:58,009 INFO L226 Difference]: Without dead ends: 53014 [2019-10-02 11:54:58,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:54:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53014 states. [2019-10-02 11:55:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53014 to 52611. [2019-10-02 11:55:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52611 states. [2019-10-02 11:55:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52611 states to 52611 states and 81327 transitions. [2019-10-02 11:55:02,316 INFO L78 Accepts]: Start accepts. Automaton has 52611 states and 81327 transitions. Word has length 177 [2019-10-02 11:55:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:02,317 INFO L475 AbstractCegarLoop]: Abstraction has 52611 states and 81327 transitions. [2019-10-02 11:55:02,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:55:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52611 states and 81327 transitions. [2019-10-02 11:55:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:55:02,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:02,322 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:55:02,322 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1087490595, now seen corresponding path program 1 times [2019-10-02 11:55:02,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:02,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:02,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:02,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 11:55:02,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:02,486 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 11:55:02,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:02,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 2700 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-02 11:55:02,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 11:55:03,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:03,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2019-10-02 11:55:03,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:55:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:55:03,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:55:03,081 INFO L87 Difference]: Start difference. First operand 52611 states and 81327 transitions. Second operand 15 states. [2019-10-02 11:55:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:17,287 INFO L93 Difference]: Finished difference Result 101579 states and 158169 transitions. [2019-10-02 11:55:17,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:55:17,288 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 177 [2019-10-02 11:55:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:17,617 INFO L225 Difference]: With dead ends: 101579 [2019-10-02 11:55:17,617 INFO L226 Difference]: Without dead ends: 53246 [2019-10-02 11:55:17,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:55:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53246 states. [2019-10-02 11:55:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53246 to 52469. [2019-10-02 11:55:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52469 states. [2019-10-02 11:55:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52469 states to 52469 states and 81097 transitions. [2019-10-02 11:55:22,491 INFO L78 Accepts]: Start accepts. Automaton has 52469 states and 81097 transitions. Word has length 177 [2019-10-02 11:55:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:22,491 INFO L475 AbstractCegarLoop]: Abstraction has 52469 states and 81097 transitions. [2019-10-02 11:55:22,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:55:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 52469 states and 81097 transitions. [2019-10-02 11:55:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 11:55:22,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:22,497 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:55:22,497 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:22,498 INFO L82 PathProgramCache]: Analyzing trace with hash 538033342, now seen corresponding path program 1 times [2019-10-02 11:55:22,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:22,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:22,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 11:55:22,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:22,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:55:22,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:55:22,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:55:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:55:22,635 INFO L87 Difference]: Start difference. First operand 52469 states and 81097 transitions. Second operand 7 states. [2019-10-02 11:55:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:25,101 INFO L93 Difference]: Finished difference Result 101113 states and 156979 transitions. [2019-10-02 11:55:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:55:25,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2019-10-02 11:55:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:25,356 INFO L225 Difference]: With dead ends: 101113 [2019-10-02 11:55:25,356 INFO L226 Difference]: Without dead ends: 52922 [2019-10-02 11:55:25,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:55:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52922 states. [2019-10-02 11:55:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52922 to 52669. [2019-10-02 11:55:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52669 states. [2019-10-02 11:55:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52669 states to 52669 states and 81407 transitions. [2019-10-02 11:55:27,926 INFO L78 Accepts]: Start accepts. Automaton has 52669 states and 81407 transitions. Word has length 179 [2019-10-02 11:55:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:27,927 INFO L475 AbstractCegarLoop]: Abstraction has 52669 states and 81407 transitions. [2019-10-02 11:55:27,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:55:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 52669 states and 81407 transitions. [2019-10-02 11:55:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 11:55:27,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:27,931 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:55:27,931 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash 630850636, now seen corresponding path program 1 times [2019-10-02 11:55:27,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:27,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 11:55:28,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:28,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:55:28,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:55:28,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:55:28,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:55:28,096 INFO L87 Difference]: Start difference. First operand 52669 states and 81407 transitions. Second operand 7 states. [2019-10-02 11:55:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:29,896 INFO L93 Difference]: Finished difference Result 101790 states and 159068 transitions. [2019-10-02 11:55:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:55:29,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-10-02 11:55:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:30,188 INFO L225 Difference]: With dead ends: 101790 [2019-10-02 11:55:30,188 INFO L226 Difference]: Without dead ends: 53399 [2019-10-02 11:55:30,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:55:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53399 states. [2019-10-02 11:55:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53399 to 53203. [2019-10-02 11:55:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53203 states. [2019-10-02 11:55:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53203 states to 53203 states and 82403 transitions. [2019-10-02 11:55:32,983 INFO L78 Accepts]: Start accepts. Automaton has 53203 states and 82403 transitions. Word has length 184 [2019-10-02 11:55:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:32,983 INFO L475 AbstractCegarLoop]: Abstraction has 53203 states and 82403 transitions. [2019-10-02 11:55:32,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:55:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 53203 states and 82403 transitions. [2019-10-02 11:55:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:55:32,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:32,988 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:55:32,989 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1225047642, now seen corresponding path program 1 times [2019-10-02 11:55:32,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:32,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:32,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:32,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 11:55:33,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:55:33,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:55:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:55:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:55:33,159 INFO L87 Difference]: Start difference. First operand 53203 states and 82403 transitions. Second operand 9 states. [2019-10-02 11:55:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:36,841 INFO L93 Difference]: Finished difference Result 105038 states and 165255 transitions. [2019-10-02 11:55:36,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:55:36,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-10-02 11:55:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:37,117 INFO L225 Difference]: With dead ends: 105038 [2019-10-02 11:55:37,117 INFO L226 Difference]: Without dead ends: 53203 [2019-10-02 11:55:37,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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 11:55:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53203 states. [2019-10-02 11:55:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53203 to 53203. [2019-10-02 11:55:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53203 states. [2019-10-02 11:55:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53203 states to 53203 states and 81983 transitions. [2019-10-02 11:55:39,427 INFO L78 Accepts]: Start accepts. Automaton has 53203 states and 81983 transitions. Word has length 191 [2019-10-02 11:55:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:39,428 INFO L475 AbstractCegarLoop]: Abstraction has 53203 states and 81983 transitions. [2019-10-02 11:55:39,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:55:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 53203 states and 81983 transitions. [2019-10-02 11:55:39,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 11:55:39,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:39,433 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:55:39,433 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:39,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:39,434 INFO L82 PathProgramCache]: Analyzing trace with hash -205864527, now seen corresponding path program 1 times [2019-10-02 11:55:39,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:39,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:39,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:39,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 11:55:39,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:55:39,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:55:39,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:55:39,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:55:39,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:55:39,592 INFO L87 Difference]: Start difference. First operand 53203 states and 81983 transitions. Second operand 9 states. [2019-10-02 11:55:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:47,908 INFO L93 Difference]: Finished difference Result 105395 states and 165713 transitions. [2019-10-02 11:55:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:55:47,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2019-10-02 11:55:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:48,313 INFO L225 Difference]: With dead ends: 105395 [2019-10-02 11:55:48,313 INFO L226 Difference]: Without dead ends: 17684 [2019-10-02 11:55:48,550 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:55:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17684 states. [2019-10-02 11:55:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17684 to 17330. [2019-10-02 11:55:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17330 states. [2019-10-02 11:55:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17330 states to 17330 states and 26102 transitions. [2019-10-02 11:55:49,086 INFO L78 Accepts]: Start accepts. Automaton has 17330 states and 26102 transitions. Word has length 196 [2019-10-02 11:55:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:49,087 INFO L475 AbstractCegarLoop]: Abstraction has 17330 states and 26102 transitions. [2019-10-02 11:55:49,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:55:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 17330 states and 26102 transitions. [2019-10-02 11:55:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-10-02 11:55:49,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:49,115 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:55:49,115 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash -834755079, now seen corresponding path program 1 times [2019-10-02 11:55:49,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:49,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:49,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 31 proven. 30 refuted. 0 times theorem prover too weak. 1277 trivial. 0 not checked. [2019-10-02 11:55:49,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:49,406 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 11:55:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:50,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 5304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:55:50,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-02 11:55:50,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:50,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:55:50,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:55:50,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:55:50,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:55:50,616 INFO L87 Difference]: Start difference. First operand 17330 states and 26102 transitions. Second operand 9 states. [2019-10-02 11:55:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:52,520 INFO L93 Difference]: Finished difference Result 35259 states and 53795 transitions. [2019-10-02 11:55:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:55:52,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 579 [2019-10-02 11:55:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:52,587 INFO L225 Difference]: With dead ends: 35259 [2019-10-02 11:55:52,587 INFO L226 Difference]: Without dead ends: 18698 [2019-10-02 11:55:52,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:55:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18698 states. [2019-10-02 11:55:53,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18698 to 18698. [2019-10-02 11:55:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18698 states. [2019-10-02 11:55:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18698 states to 18698 states and 28419 transitions. [2019-10-02 11:55:53,172 INFO L78 Accepts]: Start accepts. Automaton has 18698 states and 28419 transitions. Word has length 579 [2019-10-02 11:55:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:53,172 INFO L475 AbstractCegarLoop]: Abstraction has 18698 states and 28419 transitions. [2019-10-02 11:55:53,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:55:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 18698 states and 28419 transitions. [2019-10-02 11:55:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-10-02 11:55:53,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:53,189 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:55:53,190 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash -360643781, now seen corresponding path program 1 times [2019-10-02 11:55:53,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:53,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:53,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 32 proven. 45 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2019-10-02 11:55:53,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:53,500 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 11:55:53,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:54,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 5312 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:55:54,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 418 proven. 368 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2019-10-02 11:55:54,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:55:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 11:55:54,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:55:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:55:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:55:54,872 INFO L87 Difference]: Start difference. First operand 18698 states and 28419 transitions. Second operand 15 states. [2019-10-02 11:56:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:15,003 INFO L93 Difference]: Finished difference Result 66517 states and 107935 transitions. [2019-10-02 11:56:15,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 11:56:15,004 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 591 [2019-10-02 11:56:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:15,199 INFO L225 Difference]: With dead ends: 66517 [2019-10-02 11:56:15,199 INFO L226 Difference]: Without dead ends: 47398 [2019-10-02 11:56:15,266 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=546, Invalid=2316, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 11:56:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47398 states. [2019-10-02 11:56:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47398 to 43173. [2019-10-02 11:56:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43173 states. [2019-10-02 11:56:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43173 states to 43173 states and 66250 transitions. [2019-10-02 11:56:16,746 INFO L78 Accepts]: Start accepts. Automaton has 43173 states and 66250 transitions. Word has length 591 [2019-10-02 11:56:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:16,746 INFO L475 AbstractCegarLoop]: Abstraction has 43173 states and 66250 transitions. [2019-10-02 11:56:16,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:56:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 43173 states and 66250 transitions. [2019-10-02 11:56:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-10-02 11:56:16,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:16,767 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 15, 14, 14, 14, 12, 12, 12, 12, 12, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:56:16,767 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:16,767 INFO L82 PathProgramCache]: Analyzing trace with hash 513740489, now seen corresponding path program 1 times [2019-10-02 11:56:16,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:16,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:16,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:16,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:16,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 65 proven. 50 refuted. 0 times theorem prover too weak. 1532 trivial. 0 not checked. [2019-10-02 11:56:17,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:56:17,511 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 11:56:17,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:18,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 4760 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:56:18,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:56:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1647 backedges. 978 proven. 63 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-02 11:56:18,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:56:18,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 11:56:18,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:56:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:56:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:56:18,613 INFO L87 Difference]: Start difference. First operand 43173 states and 66250 transitions. Second operand 19 states. [2019-10-02 11:56:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:35,112 INFO L93 Difference]: Finished difference Result 128255 states and 200560 transitions. [2019-10-02 11:56:35,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:56:35,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 561 [2019-10-02 11:56:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:35,641 INFO L225 Difference]: With dead ends: 128255 [2019-10-02 11:56:35,641 INFO L226 Difference]: Without dead ends: 88500 [2019-10-02 11:56:35,768 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 11:56:35,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88500 states. [2019-10-02 11:56:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88500 to 87711. [2019-10-02 11:56:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87711 states. [2019-10-02 11:56:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87711 states to 87711 states and 137672 transitions. [2019-10-02 11:56:39,340 INFO L78 Accepts]: Start accepts. Automaton has 87711 states and 137672 transitions. Word has length 561 [2019-10-02 11:56:39,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:39,341 INFO L475 AbstractCegarLoop]: Abstraction has 87711 states and 137672 transitions. [2019-10-02 11:56:39,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:56:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 87711 states and 137672 transitions. [2019-10-02 11:56:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-10-02 11:56:39,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:39,386 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 16, 16, 16, 14, 14, 14, 14, 14, 12, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:56:39,386 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2023484792, now seen corresponding path program 1 times [2019-10-02 11:56:39,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:39,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:39,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 52 proven. 40 refuted. 0 times theorem prover too weak. 1916 trivial. 0 not checked. [2019-10-02 11:56:42,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:56:42,749 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 11:56:42,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:43,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 4974 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:56:43,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:56:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 1160 proven. 72 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-10-02 11:56:43,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:56:43,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-10-02 11:56:43,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:56:43,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:56:43,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:56:43,806 INFO L87 Difference]: Start difference. First operand 87711 states and 137672 transitions. Second operand 15 states. [2019-10-02 11:57:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:03,159 INFO L93 Difference]: Finished difference Result 241493 states and 397514 transitions. [2019-10-02 11:57:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 11:57:03,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 638 [2019-10-02 11:57:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:03,892 INFO L225 Difference]: With dead ends: 241493 [2019-10-02 11:57:03,893 INFO L226 Difference]: Without dead ends: 161664 [2019-10-02 11:57:04,108 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:57:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161664 states. [2019-10-02 11:57:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161664 to 160135. [2019-10-02 11:57:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160135 states. [2019-10-02 11:57:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160135 states to 160135 states and 265045 transitions. [2019-10-02 11:57:14,863 INFO L78 Accepts]: Start accepts. Automaton has 160135 states and 265045 transitions. Word has length 638 [2019-10-02 11:57:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:14,863 INFO L475 AbstractCegarLoop]: Abstraction has 160135 states and 265045 transitions. [2019-10-02 11:57:14,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:57:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 160135 states and 265045 transitions. [2019-10-02 11:57:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-10-02 11:57:14,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:14,906 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 13, 13, 13, 13, 13, 13, 13, 13, 11, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:57:14,906 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:14,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2059605857, now seen corresponding path program 1 times [2019-10-02 11:57:14,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:14,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:14,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:14,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:14,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 1623 trivial. 0 not checked. [2019-10-02 11:57:15,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:15,234 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 11:57:15,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:16,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 4855 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:57:16,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 904 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2019-10-02 11:57:16,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:16,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-10-02 11:57:16,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:57:16,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:57:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:57:16,172 INFO L87 Difference]: Start difference. First operand 160135 states and 265045 transitions. Second operand 11 states. [2019-10-02 11:57:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:27,821 INFO L93 Difference]: Finished difference Result 341922 states and 590771 transitions. [2019-10-02 11:57:27,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:57:27,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 579 [2019-10-02 11:57:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:28,758 INFO L225 Difference]: With dead ends: 341922 [2019-10-02 11:57:28,759 INFO L226 Difference]: Without dead ends: 183573 [2019-10-02 11:57:29,405 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 582 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:57:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183573 states. [2019-10-02 11:57:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183573 to 179800. [2019-10-02 11:57:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179800 states. [2019-10-02 11:57:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179800 states to 179800 states and 299039 transitions. [2019-10-02 11:57:44,198 INFO L78 Accepts]: Start accepts. Automaton has 179800 states and 299039 transitions. Word has length 579 [2019-10-02 11:57:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:44,199 INFO L475 AbstractCegarLoop]: Abstraction has 179800 states and 299039 transitions. [2019-10-02 11:57:44,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:57:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 179800 states and 299039 transitions. [2019-10-02 11:57:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-10-02 11:57:45,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:45,132 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:45,132 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:45,133 INFO L82 PathProgramCache]: Analyzing trace with hash -941796071, now seen corresponding path program 1 times [2019-10-02 11:57:45,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:45,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 52 proven. 20 refuted. 0 times theorem prover too weak. 1978 trivial. 0 not checked. [2019-10-02 11:57:45,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:45,447 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 11:57:45,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:46,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 5032 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:57:46,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2050 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 1435 trivial. 0 not checked. [2019-10-02 11:57:46,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:46,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:57:46,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:57:46,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:57:46,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:57:46,479 INFO L87 Difference]: Start difference. First operand 179800 states and 299039 transitions. Second operand 12 states. [2019-10-02 11:57:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:58,808 INFO L93 Difference]: Finished difference Result 360705 states and 622875 transitions. [2019-10-02 11:57:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:57:58,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 655 [2019-10-02 11:57:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:00,480 INFO L225 Difference]: With dead ends: 360705 [2019-10-02 11:58:00,480 INFO L226 Difference]: Without dead ends: 181227 [2019-10-02 11:58:01,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:58:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181227 states. [2019-10-02 11:58:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181227 to 180629. [2019-10-02 11:58:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180629 states. [2019-10-02 11:58:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180629 states to 180629 states and 302878 transitions. [2019-10-02 11:58:16,525 INFO L78 Accepts]: Start accepts. Automaton has 180629 states and 302878 transitions. Word has length 655 [2019-10-02 11:58:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:16,525 INFO L475 AbstractCegarLoop]: Abstraction has 180629 states and 302878 transitions. [2019-10-02 11:58:16,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:58:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 180629 states and 302878 transitions. [2019-10-02 11:58:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2019-10-02 11:58:16,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:16,603 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 18, 17, 17, 17, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:16,603 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:16,604 INFO L82 PathProgramCache]: Analyzing trace with hash -95116079, now seen corresponding path program 1 times [2019-10-02 11:58:16,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:16,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:16,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:16,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:16,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 39 proven. 47 refuted. 0 times theorem prover too weak. 2342 trivial. 0 not checked. [2019-10-02 11:58:17,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:17,753 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 11:58:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:18,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 5164 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:58:18,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 679 proven. 47 refuted. 0 times theorem prover too weak. 1702 trivial. 0 not checked. [2019-10-02 11:58:18,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:58:18,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-10-02 11:58:18,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:58:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:58:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:58:18,846 INFO L87 Difference]: Start difference. First operand 180629 states and 302878 transitions. Second operand 16 states. [2019-10-02 11:58:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:49,690 INFO L93 Difference]: Finished difference Result 406487 states and 770932 transitions. [2019-10-02 11:58:49,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:58:49,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 700 [2019-10-02 11:58:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:50,747 INFO L225 Difference]: With dead ends: 406487 [2019-10-02 11:58:50,747 INFO L226 Difference]: Without dead ends: 225495 [2019-10-02 11:58:52,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:58:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225495 states. [2019-10-02 11:59:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225495 to 221890. [2019-10-02 11:59:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221890 states. [2019-10-02 11:59:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221890 states to 221890 states and 407836 transitions. [2019-10-02 11:59:06,290 INFO L78 Accepts]: Start accepts. Automaton has 221890 states and 407836 transitions. Word has length 700 [2019-10-02 11:59:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:06,291 INFO L475 AbstractCegarLoop]: Abstraction has 221890 states and 407836 transitions. [2019-10-02 11:59:06,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:59:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 221890 states and 407836 transitions. [2019-10-02 11:59:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-10-02 11:59:06,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:06,346 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:59:06,347 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1498167103, now seen corresponding path program 1 times [2019-10-02 11:59:06,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:06,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2169 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 2084 trivial. 0 not checked. [2019-10-02 11:59:07,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:07,809 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 11:59:07,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:08,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 5038 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:59:08,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2169 backedges. 1214 proven. 0 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2019-10-02 11:59:08,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:08,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:59:08,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:59:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:59:08,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:59:08,883 INFO L87 Difference]: Start difference. First operand 221890 states and 407836 transitions. Second operand 14 states. [2019-10-02 11:59:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:38,534 INFO L93 Difference]: Finished difference Result 451329 states and 882342 transitions. [2019-10-02 11:59:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 11:59:38,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 663 [2019-10-02 11:59:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:39,704 INFO L225 Difference]: With dead ends: 451329 [2019-10-02 11:59:39,705 INFO L226 Difference]: Without dead ends: 215460 [2019-10-02 11:59:49,449 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:59:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215460 states. [2019-10-02 12:00:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215460 to 204758. [2019-10-02 12:00:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204758 states. [2019-10-02 12:00:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204758 states to 204758 states and 348828 transitions. [2019-10-02 12:00:01,819 INFO L78 Accepts]: Start accepts. Automaton has 204758 states and 348828 transitions. Word has length 663 [2019-10-02 12:00:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:01,819 INFO L475 AbstractCegarLoop]: Abstraction has 204758 states and 348828 transitions. [2019-10-02 12:00:01,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:00:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 204758 states and 348828 transitions. [2019-10-02 12:00:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-10-02 12:00:01,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:01,883 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 13, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:01,883 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:01,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1649896553, now seen corresponding path program 1 times [2019-10-02 12:00:01,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:01,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 64 proven. 70 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2019-10-02 12:00:02,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:02,251 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:00:09,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:09,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 4789 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:00:09,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2019-10-02 12:00:10,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:00:10,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-10-02 12:00:10,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:00:10,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:00:10,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:00:10,039 INFO L87 Difference]: Start difference. First operand 204758 states and 348828 transitions. Second operand 14 states. [2019-10-02 12:01:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:01,621 INFO L93 Difference]: Finished difference Result 673510 states and 1294327 transitions. [2019-10-02 12:01:01,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:01:01,621 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 567 [2019-10-02 12:01:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:04,473 INFO L225 Difference]: With dead ends: 673510 [2019-10-02 12:01:04,473 INFO L226 Difference]: Without dead ends: 469487 [2019-10-02 12:01:06,160 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 583 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 12:01:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469487 states. [2019-10-02 12:01:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469487 to 450080. [2019-10-02 12:01:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450080 states. [2019-10-02 12:01:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450080 states to 450080 states and 781056 transitions. [2019-10-02 12:01:56,989 INFO L78 Accepts]: Start accepts. Automaton has 450080 states and 781056 transitions. Word has length 567 [2019-10-02 12:01:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:56,990 INFO L475 AbstractCegarLoop]: Abstraction has 450080 states and 781056 transitions. [2019-10-02 12:01:56,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:01:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 450080 states and 781056 transitions. [2019-10-02 12:01:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-10-02 12:01:57,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:57,067 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 16, 12, 12, 12, 12, 12, 12, 12, 11, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:57,067 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:57,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1232263861, now seen corresponding path program 1 times [2019-10-02 12:01:57,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:57,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:57,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:57,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 84 proven. 81 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked. [2019-10-02 12:01:57,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:01:57,346 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:01:57,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:58,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 4810 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:01:58,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:01:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 1043 proven. 5 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-10-02 12:01:59,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:01:59,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 12:01:59,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:01:59,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:01:59,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:01:59,068 INFO L87 Difference]: Start difference. First operand 450080 states and 781056 transitions. Second operand 10 states. [2019-10-02 12:03:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:04,474 INFO L93 Difference]: Finished difference Result 1092326 states and 2050660 transitions. [2019-10-02 12:03:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 12:03:04,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 577 [2019-10-02 12:03:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:09,451 INFO L225 Difference]: With dead ends: 1092326 [2019-10-02 12:03:09,452 INFO L226 Difference]: Without dead ends: 638974 [2019-10-02 12:03:13,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 585 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:03:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638974 states.