./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c198beb0d28344ce853798ba0422f36d86e4a319bc1c9073be7222ccddc0e2fa --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:08:06,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:08:06,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:08:06,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:08:06,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:08:06,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:08:06,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:08:06,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:08:06,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:08:06,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:08:06,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:08:06,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:08:06,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:08:06,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:08:06,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:08:06,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:08:06,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:08:06,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:08:06,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:08:06,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:08:06,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:08:06,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:08:06,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:08:06,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:08:06,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:08:06,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:08:06,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:08:06,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:08:06,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:08:06,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:08:06,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:08:06,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:08:06,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:08:06,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:08:06,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:08:06,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:08:06,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:08:06,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:08:06,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:08:06,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:08:06,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:08:06,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:08:06,964 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c198beb0d28344ce853798ba0422f36d86e4a319bc1c9073be7222ccddc0e2fa [2024-11-08 16:08:07,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:08:07,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:08:07,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:08:07,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:08:07,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:08:07,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-08 16:08:08,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:08:09,040 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:08:09,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-08 16:08:09,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381f026a1/82c79c024929462ca81df040c14d6090/FLAG0d4d2e48a [2024-11-08 16:08:09,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381f026a1/82c79c024929462ca81df040c14d6090 [2024-11-08 16:08:09,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:08:09,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:08:09,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:08:09,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:08:09,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:08:09,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:09,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7d4b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09, skipping insertion in model container [2024-11-08 16:08:09,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:09,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:08:09,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15595,15608] [2024-11-08 16:08:09,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16571,16584] [2024-11-08 16:08:09,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28918,28931] [2024-11-08 16:08:09,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29565,29578] [2024-11-08 16:08:09,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30949,30962] [2024-11-08 16:08:09,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:08:09,726 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:08:09,827 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15595,15608] [2024-11-08 16:08:09,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16571,16584] [2024-11-08 16:08:09,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[28918,28931] [2024-11-08 16:08:09,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29565,29578] [2024-11-08 16:08:09,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30949,30962] [2024-11-08 16:08:09,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:08:09,987 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:08:09,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09 WrapperNode [2024-11-08 16:08:09,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:08:09,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:08:09,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:08:09,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:08:09,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,104 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1795 [2024-11-08 16:08:10,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:08:10,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:08:10,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:08:10,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:08:10,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:08:10,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:08:10,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:08:10,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:08:10,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:08:10,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (1/1) ... [2024-11-08 16:08:10,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:08:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:08:10,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:08:10,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:08:10,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:08:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:08:10,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:08:10,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:08:10,486 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:08:10,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:08:11,931 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-08 16:08:11,932 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:08:11,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:08:11,968 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:08:11,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:08:11 BoogieIcfgContainer [2024-11-08 16:08:11,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:08:11,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:08:11,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:08:11,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:08:11,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:08:09" (1/3) ... [2024-11-08 16:08:11,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d80fe84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:08:11, skipping insertion in model container [2024-11-08 16:08:11,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:09" (2/3) ... [2024-11-08 16:08:11,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d80fe84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:08:11, skipping insertion in model container [2024-11-08 16:08:11,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:08:11" (3/3) ... [2024-11-08 16:08:11,984 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-08 16:08:12,003 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:08:12,003 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-08 16:08:12,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:08:12,088 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5110ac5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:08:12,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-08 16:08:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 418 states have (on average 1.8038277511961722) internal successors, (754), 423 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 16:08:12,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:12,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:12,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:12,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1455877833, now seen corresponding path program 1 times [2024-11-08 16:08:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124982084] [2024-11-08 16:08:12,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124982084] [2024-11-08 16:08:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124982084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:12,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:12,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:12,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902359122] [2024-11-08 16:08:12,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:12,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:12,821 INFO L87 Difference]: Start difference. First operand has 424 states, 418 states have (on average 1.8038277511961722) internal successors, (754), 423 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:12,994 INFO L93 Difference]: Finished difference Result 767 states and 1341 transitions. [2024-11-08 16:08:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-08 16:08:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:13,022 INFO L225 Difference]: With dead ends: 767 [2024-11-08 16:08:13,022 INFO L226 Difference]: Without dead ends: 612 [2024-11-08 16:08:13,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:13,031 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 474 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:13,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1181 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-08 16:08:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2024-11-08 16:08:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 605 states have (on average 1.4793388429752066) internal successors, (895), 609 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 895 transitions. [2024-11-08 16:08:13,116 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 895 transitions. Word has length 150 [2024-11-08 16:08:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:13,117 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 895 transitions. [2024-11-08 16:08:13,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 895 transitions. [2024-11-08 16:08:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 16:08:13,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:13,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:08:13,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:13,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1340171657, now seen corresponding path program 1 times [2024-11-08 16:08:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:13,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983534150] [2024-11-08 16:08:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:13,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:13,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983534150] [2024-11-08 16:08:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983534150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:13,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:13,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873683463] [2024-11-08 16:08:13,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:13,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:13,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:13,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:13,878 INFO L87 Difference]: Start difference. First operand 610 states and 895 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:14,061 INFO L93 Difference]: Finished difference Result 2955 states and 4316 transitions. [2024-11-08 16:08:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:08:14,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-08 16:08:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:14,073 INFO L225 Difference]: With dead ends: 2955 [2024-11-08 16:08:14,074 INFO L226 Difference]: Without dead ends: 2354 [2024-11-08 16:08:14,080 INFO L431 NwaCegarLoop]: 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 [2024-11-08 16:08:14,082 INFO L432 NwaCegarLoop]: 985 mSDtfsCounter, 1820 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:14,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 2592 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2024-11-08 16:08:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1156. [2024-11-08 16:08:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1151 states have (on average 1.466550825369244) internal successors, (1688), 1155 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1688 transitions. [2024-11-08 16:08:14,147 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1688 transitions. Word has length 150 [2024-11-08 16:08:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:14,148 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1688 transitions. [2024-11-08 16:08:14,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1688 transitions. [2024-11-08 16:08:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:08:14,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:14,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:14,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:08:14,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:14,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1287913931, now seen corresponding path program 1 times [2024-11-08 16:08:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:14,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275593030] [2024-11-08 16:08:14,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:14,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:14,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:14,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275593030] [2024-11-08 16:08:14,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275593030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:14,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:14,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349037570] [2024-11-08 16:08:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:14,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:14,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:14,282 INFO L87 Difference]: Start difference. First operand 1156 states and 1688 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:14,324 INFO L93 Difference]: Finished difference Result 2286 states and 3333 transitions. [2024-11-08 16:08:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:14,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2024-11-08 16:08:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:14,332 INFO L225 Difference]: With dead ends: 2286 [2024-11-08 16:08:14,332 INFO L226 Difference]: Without dead ends: 1158 [2024-11-08 16:08:14,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:14,337 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 0 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:14,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1206 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-08 16:08:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-08 16:08:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1153 states have (on average 1.4657415437987857) internal successors, (1690), 1157 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1690 transitions. [2024-11-08 16:08:14,363 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1690 transitions. Word has length 151 [2024-11-08 16:08:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:14,363 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1690 transitions. [2024-11-08 16:08:14,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1690 transitions. [2024-11-08 16:08:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 16:08:14,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:14,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:14,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:08:14,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:14,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1852245384, now seen corresponding path program 1 times [2024-11-08 16:08:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211669771] [2024-11-08 16:08:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:14,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:14,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211669771] [2024-11-08 16:08:14,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211669771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:14,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:14,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:14,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496130669] [2024-11-08 16:08:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:14,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:14,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:14,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:14,991 INFO L87 Difference]: Start difference. First operand 1158 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:15,045 INFO L93 Difference]: Finished difference Result 2306 states and 3366 transitions. [2024-11-08 16:08:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:15,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-08 16:08:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:15,051 INFO L225 Difference]: With dead ends: 2306 [2024-11-08 16:08:15,051 INFO L226 Difference]: Without dead ends: 1156 [2024-11-08 16:08:15,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:15,054 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 24 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:15,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1890 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-08 16:08:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2024-11-08 16:08:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1151 states have (on average 1.4648132059079062) internal successors, (1686), 1155 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1686 transitions. [2024-11-08 16:08:15,085 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1686 transitions. Word has length 152 [2024-11-08 16:08:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:15,085 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1686 transitions. [2024-11-08 16:08:15,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1686 transitions. [2024-11-08 16:08:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 16:08:15,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:15,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:15,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:08:15,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1568302179, now seen corresponding path program 1 times [2024-11-08 16:08:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946283481] [2024-11-08 16:08:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:15,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946283481] [2024-11-08 16:08:15,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946283481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:15,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:15,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:15,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698571213] [2024-11-08 16:08:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,250 INFO L87 Difference]: Start difference. First operand 1156 states and 1686 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:15,319 INFO L93 Difference]: Finished difference Result 2692 states and 3927 transitions. [2024-11-08 16:08:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-08 16:08:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:15,327 INFO L225 Difference]: With dead ends: 2692 [2024-11-08 16:08:15,328 INFO L226 Difference]: Without dead ends: 1727 [2024-11-08 16:08:15,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,331 INFO L432 NwaCegarLoop]: 1145 mSDtfsCounter, 528 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:15,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1690 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-11-08 16:08:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1700. [2024-11-08 16:08:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1695 states have (on average 1.448377581120944) internal successors, (2455), 1699 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2455 transitions. [2024-11-08 16:08:15,374 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2455 transitions. Word has length 152 [2024-11-08 16:08:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:15,375 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2455 transitions. [2024-11-08 16:08:15,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2455 transitions. [2024-11-08 16:08:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 16:08:15,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:15,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:15,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:08:15,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:15,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 781372132, now seen corresponding path program 1 times [2024-11-08 16:08:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:15,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287250077] [2024-11-08 16:08:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:15,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:15,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287250077] [2024-11-08 16:08:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287250077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136181759] [2024-11-08 16:08:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:15,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:15,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,499 INFO L87 Difference]: Start difference. First operand 1700 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:15,584 INFO L93 Difference]: Finished difference Result 3988 states and 5884 transitions. [2024-11-08 16:08:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2024-11-08 16:08:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:15,594 INFO L225 Difference]: With dead ends: 3988 [2024-11-08 16:08:15,596 INFO L226 Difference]: Without dead ends: 2470 [2024-11-08 16:08:15,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,601 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 315 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:15,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1279 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2024-11-08 16:08:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2142. [2024-11-08 16:08:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2137 states have (on average 1.486195601310248) internal successors, (3176), 2141 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3176 transitions. [2024-11-08 16:08:15,665 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3176 transitions. Word has length 154 [2024-11-08 16:08:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:15,665 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 3176 transitions. [2024-11-08 16:08:15,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3176 transitions. [2024-11-08 16:08:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 16:08:15,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:15,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:15,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:08:15,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1705023188, now seen corresponding path program 1 times [2024-11-08 16:08:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628464003] [2024-11-08 16:08:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:15,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628464003] [2024-11-08 16:08:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628464003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:15,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:15,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:15,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411726107] [2024-11-08 16:08:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:15,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:15,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:15,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:15,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,788 INFO L87 Difference]: Start difference. First operand 2142 states and 3176 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:15,874 INFO L93 Difference]: Finished difference Result 5128 states and 7761 transitions. [2024-11-08 16:08:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:15,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-08 16:08:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:15,886 INFO L225 Difference]: With dead ends: 5128 [2024-11-08 16:08:15,887 INFO L226 Difference]: Without dead ends: 3252 [2024-11-08 16:08:15,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,891 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 352 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:15,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1281 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2024-11-08 16:08:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2920. [2024-11-08 16:08:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2915 states have (on average 1.5217838765008576) internal successors, (4436), 2919 states have internal predecessors, (4436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4436 transitions. [2024-11-08 16:08:15,959 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4436 transitions. Word has length 156 [2024-11-08 16:08:15,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:15,960 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4436 transitions. [2024-11-08 16:08:15,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4436 transitions. [2024-11-08 16:08:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 16:08:15,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:15,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:15,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:08:15,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:15,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1816910392, now seen corresponding path program 1 times [2024-11-08 16:08:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:15,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219952259] [2024-11-08 16:08:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219952259] [2024-11-08 16:08:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219952259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:16,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:16,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457149889] [2024-11-08 16:08:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:16,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:16,469 INFO L87 Difference]: Start difference. First operand 2920 states and 4436 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:16,624 INFO L93 Difference]: Finished difference Result 7050 states and 11024 transitions. [2024-11-08 16:08:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2024-11-08 16:08:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:16,644 INFO L225 Difference]: With dead ends: 7050 [2024-11-08 16:08:16,644 INFO L226 Difference]: Without dead ends: 5228 [2024-11-08 16:08:16,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:16,652 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 714 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:16,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1098 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2024-11-08 16:08:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5226. [2024-11-08 16:08:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 5221 states have (on average 1.5378280022984103) internal successors, (8029), 5225 states have internal predecessors, (8029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 8029 transitions. [2024-11-08 16:08:16,792 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 8029 transitions. Word has length 157 [2024-11-08 16:08:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:16,793 INFO L471 AbstractCegarLoop]: Abstraction has 5226 states and 8029 transitions. [2024-11-08 16:08:16,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 8029 transitions. [2024-11-08 16:08:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 16:08:16,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:16,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:16,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:08:16,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:16,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -837981990, now seen corresponding path program 1 times [2024-11-08 16:08:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183191044] [2024-11-08 16:08:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183191044] [2024-11-08 16:08:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183191044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275632109] [2024-11-08 16:08:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:17,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:17,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:17,293 INFO L87 Difference]: Start difference. First operand 5226 states and 8029 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:17,434 INFO L93 Difference]: Finished difference Result 13670 states and 20995 transitions. [2024-11-08 16:08:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2024-11-08 16:08:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:17,522 INFO L225 Difference]: With dead ends: 13670 [2024-11-08 16:08:17,522 INFO L226 Difference]: Without dead ends: 8481 [2024-11-08 16:08:17,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:17,532 INFO L432 NwaCegarLoop]: 1056 mSDtfsCounter, 529 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:17,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2111 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8481 states. [2024-11-08 16:08:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8481 to 8458. [2024-11-08 16:08:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8458 states, 8453 states have (on average 1.524429196734887) internal successors, (12886), 8457 states have internal predecessors, (12886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 12886 transitions. [2024-11-08 16:08:17,779 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 12886 transitions. Word has length 157 [2024-11-08 16:08:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:17,779 INFO L471 AbstractCegarLoop]: Abstraction has 8458 states and 12886 transitions. [2024-11-08 16:08:17,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 12886 transitions. [2024-11-08 16:08:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 16:08:17,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:17,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:17,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:08:17,795 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:17,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -728683137, now seen corresponding path program 1 times [2024-11-08 16:08:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273215172] [2024-11-08 16:08:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:18,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273215172] [2024-11-08 16:08:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273215172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:18,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:18,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968735565] [2024-11-08 16:08:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:18,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:18,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:18,360 INFO L87 Difference]: Start difference. First operand 8458 states and 12886 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:18,457 INFO L93 Difference]: Finished difference Result 16895 states and 25740 transitions. [2024-11-08 16:08:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2024-11-08 16:08:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:18,487 INFO L225 Difference]: With dead ends: 16895 [2024-11-08 16:08:18,490 INFO L226 Difference]: Without dead ends: 8458 [2024-11-08 16:08:18,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:18,505 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 20 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:18,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1862 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2024-11-08 16:08:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 8458. [2024-11-08 16:08:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8458 states, 8453 states have (on average 1.5240742931503608) internal successors, (12883), 8457 states have internal predecessors, (12883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 12883 transitions. [2024-11-08 16:08:18,673 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 12883 transitions. Word has length 159 [2024-11-08 16:08:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 8458 states and 12883 transitions. [2024-11-08 16:08:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 12883 transitions. [2024-11-08 16:08:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 16:08:18,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:18,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:18,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:08:18,681 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:18,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1379104380, now seen corresponding path program 1 times [2024-11-08 16:08:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696224363] [2024-11-08 16:08:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696224363] [2024-11-08 16:08:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696224363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:18,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917813530] [2024-11-08 16:08:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:18,791 INFO L87 Difference]: Start difference. First operand 8458 states and 12883 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:18,989 INFO L93 Difference]: Finished difference Result 21285 states and 32425 transitions. [2024-11-08 16:08:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:18,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2024-11-08 16:08:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:19,018 INFO L225 Difference]: With dead ends: 21285 [2024-11-08 16:08:19,018 INFO L226 Difference]: Without dead ends: 13219 [2024-11-08 16:08:19,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:19,031 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 523 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:19,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1220 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13219 states. [2024-11-08 16:08:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13219 to 13198. [2024-11-08 16:08:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13198 states, 13193 states have (on average 1.505040551807777) internal successors, (19856), 13197 states have internal predecessors, (19856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13198 states to 13198 states and 19856 transitions. [2024-11-08 16:08:19,286 INFO L78 Accepts]: Start accepts. Automaton has 13198 states and 19856 transitions. Word has length 159 [2024-11-08 16:08:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:19,287 INFO L471 AbstractCegarLoop]: Abstraction has 13198 states and 19856 transitions. [2024-11-08 16:08:19,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13198 states and 19856 transitions. [2024-11-08 16:08:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 16:08:19,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:19,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:19,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:08:19,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:19,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1856649123, now seen corresponding path program 1 times [2024-11-08 16:08:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:19,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498491214] [2024-11-08 16:08:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498491214] [2024-11-08 16:08:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498491214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:19,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403060698] [2024-11-08 16:08:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:19,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:19,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:19,412 INFO L87 Difference]: Start difference. First operand 13198 states and 19856 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:19,657 INFO L93 Difference]: Finished difference Result 35081 states and 53528 transitions. [2024-11-08 16:08:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-08 16:08:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:19,708 INFO L225 Difference]: With dead ends: 35081 [2024-11-08 16:08:19,708 INFO L226 Difference]: Without dead ends: 22288 [2024-11-08 16:08:19,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:19,725 INFO L432 NwaCegarLoop]: 803 mSDtfsCounter, 314 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:19,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1261 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22288 states. [2024-11-08 16:08:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22288 to 20122. [2024-11-08 16:08:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20122 states, 20117 states have (on average 1.5392951235273649) internal successors, (30966), 20121 states have internal predecessors, (30966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20122 states to 20122 states and 30966 transitions. [2024-11-08 16:08:20,131 INFO L78 Accepts]: Start accepts. Automaton has 20122 states and 30966 transitions. Word has length 163 [2024-11-08 16:08:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:20,132 INFO L471 AbstractCegarLoop]: Abstraction has 20122 states and 30966 transitions. [2024-11-08 16:08:20,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 20122 states and 30966 transitions. [2024-11-08 16:08:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 16:08:20,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:20,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:20,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:08:20,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:20,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1193982163, now seen corresponding path program 1 times [2024-11-08 16:08:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:20,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246256333] [2024-11-08 16:08:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:20,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:20,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:20,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246256333] [2024-11-08 16:08:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246256333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:20,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:20,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403249449] [2024-11-08 16:08:20,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:20,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:20,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:20,357 INFO L87 Difference]: Start difference. First operand 20122 states and 30966 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:20,852 INFO L93 Difference]: Finished difference Result 57900 states and 89640 transitions. [2024-11-08 16:08:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:20,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2024-11-08 16:08:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:20,958 INFO L225 Difference]: With dead ends: 57900 [2024-11-08 16:08:20,959 INFO L226 Difference]: Without dead ends: 39172 [2024-11-08 16:08:20,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:21,000 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 501 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:21,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1046 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:08:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39172 states. [2024-11-08 16:08:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39172 to 39137. [2024-11-08 16:08:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39137 states, 39132 states have (on average 1.5376418276602268) internal successors, (60171), 39136 states have internal predecessors, (60171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39137 states to 39137 states and 60171 transitions. [2024-11-08 16:08:22,147 INFO L78 Accepts]: Start accepts. Automaton has 39137 states and 60171 transitions. Word has length 164 [2024-11-08 16:08:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:22,147 INFO L471 AbstractCegarLoop]: Abstraction has 39137 states and 60171 transitions. [2024-11-08 16:08:22,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39137 states and 60171 transitions. [2024-11-08 16:08:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 16:08:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:22,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:22,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:08:22,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:22,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1951177816, now seen corresponding path program 1 times [2024-11-08 16:08:22,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:22,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160072376] [2024-11-08 16:08:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:22,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:22,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160072376] [2024-11-08 16:08:22,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160072376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:22,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:22,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:08:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721463083] [2024-11-08 16:08:22,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:22,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:08:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:08:22,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:08:22,656 INFO L87 Difference]: Start difference. First operand 39137 states and 60171 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:24,195 INFO L93 Difference]: Finished difference Result 163556 states and 251726 transitions. [2024-11-08 16:08:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:08:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2024-11-08 16:08:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:24,827 INFO L225 Difference]: With dead ends: 163556 [2024-11-08 16:08:24,827 INFO L226 Difference]: Without dead ends: 125061 [2024-11-08 16:08:24,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:08:24,902 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 6948 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6948 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:24,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6948 Valid, 1541 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:08:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125061 states. [2024-11-08 16:08:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125061 to 66131. [2024-11-08 16:08:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66131 states, 66126 states have (on average 1.515909022169797) internal successors, (100241), 66130 states have internal predecessors, (100241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66131 states to 66131 states and 100241 transitions. [2024-11-08 16:08:27,081 INFO L78 Accepts]: Start accepts. Automaton has 66131 states and 100241 transitions. Word has length 164 [2024-11-08 16:08:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:27,081 INFO L471 AbstractCegarLoop]: Abstraction has 66131 states and 100241 transitions. [2024-11-08 16:08:27,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 66131 states and 100241 transitions. [2024-11-08 16:08:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 16:08:27,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:27,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:27,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:08:27,099 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:27,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -637177356, now seen corresponding path program 1 times [2024-11-08 16:08:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223739383] [2024-11-08 16:08:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:27,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223739383] [2024-11-08 16:08:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223739383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:27,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:27,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021294055] [2024-11-08 16:08:27,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:27,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:27,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:27,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:27,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:27,638 INFO L87 Difference]: Start difference. First operand 66131 states and 100241 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:28,948 INFO L93 Difference]: Finished difference Result 301411 states and 455269 transitions. [2024-11-08 16:08:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:08:28,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2024-11-08 16:08:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:29,616 INFO L225 Difference]: With dead ends: 301411 [2024-11-08 16:08:29,617 INFO L226 Difference]: Without dead ends: 235329 [2024-11-08 16:08:30,032 INFO L431 NwaCegarLoop]: 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 [2024-11-08 16:08:30,033 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 1656 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:30,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2634 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235329 states. [2024-11-08 16:08:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235329 to 117676. [2024-11-08 16:08:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117676 states, 117671 states have (on average 1.492440788299581) internal successors, (175617), 117675 states have internal predecessors, (175617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117676 states to 117676 states and 175617 transitions. [2024-11-08 16:08:32,918 INFO L78 Accepts]: Start accepts. Automaton has 117676 states and 175617 transitions. Word has length 164 [2024-11-08 16:08:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:32,919 INFO L471 AbstractCegarLoop]: Abstraction has 117676 states and 175617 transitions. [2024-11-08 16:08:32,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 117676 states and 175617 transitions. [2024-11-08 16:08:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 16:08:32,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:32,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:32,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:08:32,951 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1188003318, now seen corresponding path program 1 times [2024-11-08 16:08:32,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:32,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131442030] [2024-11-08 16:08:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131442030] [2024-11-08 16:08:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131442030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:33,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125637754] [2024-11-08 16:08:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:33,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:33,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:33,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:33,472 INFO L87 Difference]: Start difference. First operand 117676 states and 175617 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:34,196 INFO L93 Difference]: Finished difference Result 235235 states and 351079 transitions. [2024-11-08 16:08:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2024-11-08 16:08:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:34,384 INFO L225 Difference]: With dead ends: 235235 [2024-11-08 16:08:34,384 INFO L226 Difference]: Without dead ends: 117684 [2024-11-08 16:08:34,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:34,521 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 0 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:34,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117684 states. [2024-11-08 16:08:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117684 to 117684. [2024-11-08 16:08:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117684 states, 117679 states have (on average 1.4924073114149508) internal successors, (175625), 117683 states have internal predecessors, (175625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117684 states to 117684 states and 175625 transitions. [2024-11-08 16:08:36,687 INFO L78 Accepts]: Start accepts. Automaton has 117684 states and 175625 transitions. Word has length 165 [2024-11-08 16:08:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:36,687 INFO L471 AbstractCegarLoop]: Abstraction has 117684 states and 175625 transitions. [2024-11-08 16:08:36,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 117684 states and 175625 transitions. [2024-11-08 16:08:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 16:08:36,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:36,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:36,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:08:36,708 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:36,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -951591691, now seen corresponding path program 1 times [2024-11-08 16:08:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:36,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442548915] [2024-11-08 16:08:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:37,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:37,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442548915] [2024-11-08 16:08:37,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442548915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:37,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332537615] [2024-11-08 16:08:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:37,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:37,683 INFO L87 Difference]: Start difference. First operand 117684 states and 175625 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:38,416 INFO L93 Difference]: Finished difference Result 235239 states and 351081 transitions. [2024-11-08 16:08:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:38,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-11-08 16:08:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:38,622 INFO L225 Difference]: With dead ends: 235239 [2024-11-08 16:08:38,623 INFO L226 Difference]: Without dead ends: 117684 [2024-11-08 16:08:38,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:38,723 INFO L432 NwaCegarLoop]: 614 mSDtfsCounter, 10 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:38,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1808 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117684 states. [2024-11-08 16:08:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117684 to 117680. [2024-11-08 16:08:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117680 states, 117675 states have (on average 1.4923815593796472) internal successors, (175616), 117679 states have internal predecessors, (175616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117680 states to 117680 states and 175616 transitions. [2024-11-08 16:08:40,868 INFO L78 Accepts]: Start accepts. Automaton has 117680 states and 175616 transitions. Word has length 166 [2024-11-08 16:08:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 117680 states and 175616 transitions. [2024-11-08 16:08:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 117680 states and 175616 transitions. [2024-11-08 16:08:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 16:08:40,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:40,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:40,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:08:40,886 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:40,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:40,887 INFO L85 PathProgramCache]: Analyzing trace with hash 718071364, now seen corresponding path program 1 times [2024-11-08 16:08:40,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:40,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380160724] [2024-11-08 16:08:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:41,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:41,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380160724] [2024-11-08 16:08:41,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380160724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:41,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778038560] [2024-11-08 16:08:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:41,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:41,002 INFO L87 Difference]: Start difference. First operand 117680 states and 175616 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:42,405 INFO L93 Difference]: Finished difference Result 310480 states and 462470 transitions. [2024-11-08 16:08:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:42,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-11-08 16:08:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:42,785 INFO L225 Difference]: With dead ends: 310480 [2024-11-08 16:08:42,786 INFO L226 Difference]: Without dead ends: 193999 [2024-11-08 16:08:42,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:42,881 INFO L432 NwaCegarLoop]: 1035 mSDtfsCounter, 500 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:42,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1580 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193999 states. [2024-11-08 16:08:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193999 to 193956. [2024-11-08 16:08:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193956 states, 193951 states have (on average 1.4731659027280086) internal successors, (285722), 193955 states have internal predecessors, (285722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193956 states to 193956 states and 285722 transitions. [2024-11-08 16:08:46,842 INFO L78 Accepts]: Start accepts. Automaton has 193956 states and 285722 transitions. Word has length 166 [2024-11-08 16:08:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:46,842 INFO L471 AbstractCegarLoop]: Abstraction has 193956 states and 285722 transitions. [2024-11-08 16:08:46,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 193956 states and 285722 transitions. [2024-11-08 16:08:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 16:08:46,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:46,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:46,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:08:46,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:46,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -427288287, now seen corresponding path program 1 times [2024-11-08 16:08:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156924968] [2024-11-08 16:08:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:47,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:47,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156924968] [2024-11-08 16:08:47,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156924968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:47,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:47,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:47,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355269401] [2024-11-08 16:08:47,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:47,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:47,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:47,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:47,523 INFO L87 Difference]: Start difference. First operand 193956 states and 285722 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:49,199 INFO L93 Difference]: Finished difference Result 364638 states and 537495 transitions. [2024-11-08 16:08:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:49,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-11-08 16:08:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:49,539 INFO L225 Difference]: With dead ends: 364638 [2024-11-08 16:08:49,539 INFO L226 Difference]: Without dead ends: 171733 [2024-11-08 16:08:49,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:49,650 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 13 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:49,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1812 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171733 states. [2024-11-08 16:08:52,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171733 to 171733. [2024-11-08 16:08:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171733 states, 171728 states have (on average 1.4732891549427) internal successors, (253005), 171732 states have internal predecessors, (253005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171733 states to 171733 states and 253005 transitions. [2024-11-08 16:08:52,887 INFO L78 Accepts]: Start accepts. Automaton has 171733 states and 253005 transitions. Word has length 166 [2024-11-08 16:08:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:52,887 INFO L471 AbstractCegarLoop]: Abstraction has 171733 states and 253005 transitions. [2024-11-08 16:08:52,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 171733 states and 253005 transitions. [2024-11-08 16:08:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 16:08:52,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:52,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:08:52,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:08:52,920 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:08:52,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash 572311663, now seen corresponding path program 1 times [2024-11-08 16:08:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176669749] [2024-11-08 16:08:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:08:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176669749] [2024-11-08 16:08:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176669749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:08:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430368249] [2024-11-08 16:08:53,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:53,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:08:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:53,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:08:53,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:08:53,408 INFO L87 Difference]: Start difference. First operand 171733 states and 253005 transitions. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:08:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:56,217 INFO L93 Difference]: Finished difference Result 545429 states and 806875 transitions. [2024-11-08 16:08:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:08:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-11-08 16:08:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:56,914 INFO L225 Difference]: With dead ends: 545429 [2024-11-08 16:08:56,915 INFO L226 Difference]: Without dead ends: 376438 [2024-11-08 16:08:57,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-08 16:08:57,917 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 5781 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5781 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:57,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5781 Valid, 2740 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:08:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376438 states. [2024-11-08 16:09:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376438 to 162819. [2024-11-08 16:09:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162819 states, 162814 states have (on average 1.4825690665421893) internal successors, (241383), 162818 states have internal predecessors, (241383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:09:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162819 states to 162819 states and 241383 transitions. [2024-11-08 16:09:02,850 INFO L78 Accepts]: Start accepts. Automaton has 162819 states and 241383 transitions. Word has length 171 [2024-11-08 16:09:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:09:02,851 INFO L471 AbstractCegarLoop]: Abstraction has 162819 states and 241383 transitions. [2024-11-08 16:09:02,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:09:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 162819 states and 241383 transitions. [2024-11-08 16:09:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 16:09:02,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:09:02,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:09:02,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:09:02,870 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-08 16:09:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:09:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1547419730, now seen corresponding path program 1 times [2024-11-08 16:09:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:09:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349711364] [2024-11-08 16:09:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:09:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:09:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:09:03,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:09:03,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349711364] [2024-11-08 16:09:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349711364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:09:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:09:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:09:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793403386] [2024-11-08 16:09:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:09:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:09:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:09:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:09:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:09:03,202 INFO L87 Difference]: Start difference. First operand 162819 states and 241383 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:09:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:09:03,799 INFO L93 Difference]: Finished difference Result 233640 states and 347058 transitions. [2024-11-08 16:09:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:09:03,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-11-08 16:09:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:09:04,045 INFO L225 Difference]: With dead ends: 233640 [2024-11-08 16:09:04,045 INFO L226 Difference]: Without dead ends: 162345 [2024-11-08 16:09:04,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:09:04,129 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 105 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:09:04,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1866 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:09:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162345 states.