./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.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 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:25:43,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:25:43,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:25:43,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:25:43,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:25:43,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:25:43,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:25:43,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:25:43,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:25:43,977 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:25:43,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:25:43,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:25:43,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:25:43,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:25:43,979 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:25:43,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:25:43,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:25:43,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:25:43,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:25:43,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:25:43,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:25:43,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:25:43,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:25:43,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:25:43,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:25:43,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:25:43,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:25:43,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:25:43,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:25:43,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:25:43,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:25:43,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:25:43,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:25:43,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:25:43,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:25:43,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:25:43,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:25:43,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:25:43,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:25:43,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:25:43,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:25:43,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:25:43,990 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 -> 92f84e18d7f713cb4a67277cb892c6222831b93652f8c37aad43582713426f96 [2024-10-12 20:25:44,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:25:44,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:25:44,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:25:44,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:25:44,244 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:25:44,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:25:45,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:25:45,752 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:25:45,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:25:45,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541e4abf9/508fa93333f5468c94e13ffbe76290c2/FLAG0e6afa77d [2024-10-12 20:25:45,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541e4abf9/508fa93333f5468c94e13ffbe76290c2 [2024-10-12 20:25:45,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:25:45,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:25:45,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:25:45,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:25:45,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:25:45,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:25:45" (1/1) ... [2024-10-12 20:25:45,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c06d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:45, skipping insertion in model container [2024-10-12 20:25:45,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:25:45" (1/1) ... [2024-10-12 20:25:45,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:25:45,978 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2024-10-12 20:25:45,992 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2024-10-12 20:25:45,997 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2024-10-12 20:25:46,000 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2024-10-12 20:25:46,006 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2024-10-12 20:25:46,009 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2024-10-12 20:25:46,013 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2024-10-12 20:25:46,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:25:46,056 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:25:46,083 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[7545,7558] [2024-10-12 20:25:46,090 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[10452,10465] [2024-10-12 20:25:46,094 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11543,11556] [2024-10-12 20:25:46,096 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[12149,12162] [2024-10-12 20:25:46,101 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[13568,13581] [2024-10-12 20:25:46,103 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14174,14187] [2024-10-12 20:25:46,107 WARN L248 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_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15145,15158] [2024-10-12 20:25:46,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:25:46,154 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:25:46,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46 WrapperNode [2024-10-12 20:25:46,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:25:46,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:25:46,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:25:46,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:25:46,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,271 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1106 [2024-10-12 20:25:46,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:25:46,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:25:46,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:25:46,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:25:46,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,334 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-10-12 20:25:46,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:25:46,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:25:46,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:25:46,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:25:46,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (1/1) ... [2024-10-12 20:25:46,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:25:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:25:46,450 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-10-12 20:25:46,455 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-10-12 20:25:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:25:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:25:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:25:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:25:46,596 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:25:46,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:25:47,225 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2024-10-12 20:25:47,226 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:25:47,263 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:25:47,264 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:25:47,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:25:47 BoogieIcfgContainer [2024-10-12 20:25:47,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:25:47,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:25:47,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:25:47,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:25:47,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:25:45" (1/3) ... [2024-10-12 20:25:47,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1dca87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:25:47, skipping insertion in model container [2024-10-12 20:25:47,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:25:46" (2/3) ... [2024-10-12 20:25:47,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1dca87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:25:47, skipping insertion in model container [2024-10-12 20:25:47,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:25:47" (3/3) ... [2024-10-12 20:25:47,274 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:25:47,288 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:25:47,289 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-12 20:25:47,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:25:47,366 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;@37c38461, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:25:47,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-12 20:25:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 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-10-12 20:25:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 20:25:47,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:47,381 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] [2024-10-12 20:25:47,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1273195572, now seen corresponding path program 1 times [2024-10-12 20:25:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:47,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621541878] [2024-10-12 20:25:47,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:47,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:47,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-10-12 20:25:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621541878] [2024-10-12 20:25:47,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621541878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:47,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:47,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:25:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800772419] [2024-10-12 20:25:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:25:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:48,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:25:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:25:48,023 INFO L87 Difference]: Start difference. First operand has 205 states, 197 states have (on average 1.83248730964467) internal successors, (361), 204 states have internal predecessors, (361), 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 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-10-12 20:25:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:48,319 INFO L93 Difference]: Finished difference Result 334 states and 565 transitions. [2024-10-12 20:25:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:25:48,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2024-10-12 20:25:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:48,329 INFO L225 Difference]: With dead ends: 334 [2024-10-12 20:25:48,330 INFO L226 Difference]: Without dead ends: 183 [2024-10-12 20:25:48,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:48,335 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 854 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:48,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:25:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-12 20:25:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-10-12 20:25:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 176 states have (on average 1.2727272727272727) internal successors, (224), 182 states have internal predecessors, (224), 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-10-12 20:25:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2024-10-12 20:25:48,369 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 46 [2024-10-12 20:25:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:48,370 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2024-10-12 20:25:48,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-10-12 20:25:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2024-10-12 20:25:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 20:25:48,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:48,371 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] [2024-10-12 20:25:48,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:25:48,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:48,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1862883361, now seen corresponding path program 1 times [2024-10-12 20:25:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:48,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210147647] [2024-10-12 20:25:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:48,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210147647] [2024-10-12 20:25:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210147647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:25:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124833058] [2024-10-12 20:25:48,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:48,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:25:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:48,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:25:48,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:25:48,567 INFO L87 Difference]: Start difference. First operand 183 states and 224 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-10-12 20:25:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:48,720 INFO L93 Difference]: Finished difference Result 306 states and 385 transitions. [2024-10-12 20:25:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:25:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-10-12 20:25:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:48,723 INFO L225 Difference]: With dead ends: 306 [2024-10-12 20:25:48,725 INFO L226 Difference]: Without dead ends: 167 [2024-10-12 20:25:48,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:48,727 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 576 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:48,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 131 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-12 20:25:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-12 20:25:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 160 states have (on average 1.28125) internal successors, (205), 166 states have internal predecessors, (205), 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-10-12 20:25:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-10-12 20:25:48,744 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 47 [2024-10-12 20:25:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:48,745 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-10-12 20:25:48,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-10-12 20:25:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-10-12 20:25:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 20:25:48,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:48,749 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] [2024-10-12 20:25:48,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:25:48,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:48,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1456528685, now seen corresponding path program 1 times [2024-10-12 20:25:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143468168] [2024-10-12 20:25:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143468168] [2024-10-12 20:25:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143468168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:48,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:48,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:25:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494828749] [2024-10-12 20:25:48,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:48,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:25:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:25:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:25:48,904 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-10-12 20:25:49,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:49,056 INFO L93 Difference]: Finished difference Result 374 states and 476 transitions. [2024-10-12 20:25:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:25:49,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-10-12 20:25:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:49,058 INFO L225 Difference]: With dead ends: 374 [2024-10-12 20:25:49,059 INFO L226 Difference]: Without dead ends: 240 [2024-10-12 20:25:49,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:49,061 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 768 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:49,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 187 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-12 20:25:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 216. [2024-10-12 20:25:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3397129186602872) internal successors, (280), 215 states have internal predecessors, (280), 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-10-12 20:25:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 280 transitions. [2024-10-12 20:25:49,075 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 280 transitions. Word has length 48 [2024-10-12 20:25:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:49,075 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 280 transitions. [2024-10-12 20:25:49,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-10-12 20:25:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 280 transitions. [2024-10-12 20:25:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:25:49,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:49,077 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] [2024-10-12 20:25:49,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:25:49,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1731915121, now seen corresponding path program 1 times [2024-10-12 20:25:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148600732] [2024-10-12 20:25:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148600732] [2024-10-12 20:25:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148600732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823355130] [2024-10-12 20:25:49,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:49,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:49,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:49,368 INFO L87 Difference]: Start difference. First operand 216 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-10-12 20:25:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:49,864 INFO L93 Difference]: Finished difference Result 359 states and 471 transitions. [2024-10-12 20:25:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:25:49,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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 49 [2024-10-12 20:25:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:49,868 INFO L225 Difference]: With dead ends: 359 [2024-10-12 20:25:49,868 INFO L226 Difference]: Without dead ends: 354 [2024-10-12 20:25:49,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:25:49,869 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 586 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:49,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 611 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:25:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-12 20:25:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 216. [2024-10-12 20:25:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3349282296650717) internal successors, (279), 215 states have internal predecessors, (279), 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-10-12 20:25:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2024-10-12 20:25:49,878 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 49 [2024-10-12 20:25:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:49,879 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2024-10-12 20:25:49,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-10-12 20:25:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2024-10-12 20:25:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:25:49,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:49,880 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] [2024-10-12 20:25:49,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:25:49,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:49,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -650855073, now seen corresponding path program 1 times [2024-10-12 20:25:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922803825] [2024-10-12 20:25:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:50,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922803825] [2024-10-12 20:25:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922803825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:50,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:50,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:50,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726459037] [2024-10-12 20:25:50,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:50,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:50,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:50,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:50,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:50,145 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-10-12 20:25:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:50,452 INFO L93 Difference]: Finished difference Result 404 states and 537 transitions. [2024-10-12 20:25:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:50,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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 49 [2024-10-12 20:25:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:50,454 INFO L225 Difference]: With dead ends: 404 [2024-10-12 20:25:50,454 INFO L226 Difference]: Without dead ends: 303 [2024-10-12 20:25:50,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:50,456 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 800 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:50,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 481 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:25:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-12 20:25:50,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 216. [2024-10-12 20:25:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.3301435406698565) internal successors, (278), 215 states have internal predecessors, (278), 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-10-12 20:25:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2024-10-12 20:25:50,466 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 49 [2024-10-12 20:25:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:50,466 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2024-10-12 20:25:50,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-10-12 20:25:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2024-10-12 20:25:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 20:25:50,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:50,471 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] [2024-10-12 20:25:50,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:25:50,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:50,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 622927837, now seen corresponding path program 1 times [2024-10-12 20:25:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539241862] [2024-10-12 20:25:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539241862] [2024-10-12 20:25:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539241862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:50,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:50,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:25:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463885380] [2024-10-12 20:25:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:50,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:25:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:25:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:50,734 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 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-10-12 20:25:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:50,996 INFO L93 Difference]: Finished difference Result 460 states and 609 transitions. [2024-10-12 20:25:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2024-10-12 20:25:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:50,998 INFO L225 Difference]: With dead ends: 460 [2024-10-12 20:25:50,998 INFO L226 Difference]: Without dead ends: 336 [2024-10-12 20:25:50,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:50,999 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 524 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:50,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 509 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:25:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-12 20:25:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 216. [2024-10-12 20:25:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.325358851674641) internal successors, (277), 215 states have internal predecessors, (277), 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-10-12 20:25:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 277 transitions. [2024-10-12 20:25:51,012 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 277 transitions. Word has length 49 [2024-10-12 20:25:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:51,013 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 277 transitions. [2024-10-12 20:25:51,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 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-10-12 20:25:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 277 transitions. [2024-10-12 20:25:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:25:51,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:51,018 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] [2024-10-12 20:25:51,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:25:51,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:51,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash 359581070, now seen corresponding path program 1 times [2024-10-12 20:25:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:51,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664708784] [2024-10-12 20:25:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:51,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:51,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664708784] [2024-10-12 20:25:51,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664708784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:51,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:51,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:25:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968834341] [2024-10-12 20:25:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:51,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:25:51,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:51,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:25:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:25:51,466 INFO L87 Difference]: Start difference. First operand 216 states and 277 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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-10-12 20:25:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:51,764 INFO L93 Difference]: Finished difference Result 406 states and 550 transitions. [2024-10-12 20:25:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:25:51,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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 51 [2024-10-12 20:25:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:51,767 INFO L225 Difference]: With dead ends: 406 [2024-10-12 20:25:51,767 INFO L226 Difference]: Without dead ends: 289 [2024-10-12 20:25:51,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:25:51,768 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 763 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:51,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 615 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-12 20:25:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 183. [2024-10-12 20:25:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.329608938547486) internal successors, (238), 182 states have internal predecessors, (238), 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-10-12 20:25:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 238 transitions. [2024-10-12 20:25:51,773 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 238 transitions. Word has length 51 [2024-10-12 20:25:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:51,773 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 238 transitions. [2024-10-12 20:25:51,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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-10-12 20:25:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 238 transitions. [2024-10-12 20:25:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 20:25:51,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:51,774 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] [2024-10-12 20:25:51,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:25:51,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:51,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash -83474213, now seen corresponding path program 1 times [2024-10-12 20:25:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:51,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138817112] [2024-10-12 20:25:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138817112] [2024-10-12 20:25:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138817112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:52,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:25:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598565951] [2024-10-12 20:25:52,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:52,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:25:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:25:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:25:52,236 INFO L87 Difference]: Start difference. First operand 183 states and 238 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 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-10-12 20:25:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:52,744 INFO L93 Difference]: Finished difference Result 503 states and 688 transitions. [2024-10-12 20:25:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:25:52,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 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 51 [2024-10-12 20:25:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:52,747 INFO L225 Difference]: With dead ends: 503 [2024-10-12 20:25:52,747 INFO L226 Difference]: Without dead ends: 499 [2024-10-12 20:25:52,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:25:52,748 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 903 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:52,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1041 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:25:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-12 20:25:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 179. [2024-10-12 20:25:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 176 states have (on average 1.3295454545454546) internal successors, (234), 178 states have internal predecessors, (234), 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-10-12 20:25:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2024-10-12 20:25:52,754 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 51 [2024-10-12 20:25:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:52,754 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2024-10-12 20:25:52,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 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-10-12 20:25:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2024-10-12 20:25:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:25:52,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:52,755 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] [2024-10-12 20:25:52,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:25:52,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1872189982, now seen corresponding path program 1 times [2024-10-12 20:25:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:52,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656312457] [2024-10-12 20:25:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656312457] [2024-10-12 20:25:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656312457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:25:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121277608] [2024-10-12 20:25:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:52,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:25:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:25:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:52,992 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 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-10-12 20:25:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:53,234 INFO L93 Difference]: Finished difference Result 306 states and 407 transitions. [2024-10-12 20:25:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:25:53,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 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 52 [2024-10-12 20:25:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:53,236 INFO L225 Difference]: With dead ends: 306 [2024-10-12 20:25:53,236 INFO L226 Difference]: Without dead ends: 299 [2024-10-12 20:25:53,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:25:53,237 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 438 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:53,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 467 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:25:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-12 20:25:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 179. [2024-10-12 20:25:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 176 states have (on average 1.3238636363636365) internal successors, (233), 178 states have internal predecessors, (233), 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-10-12 20:25:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 233 transitions. [2024-10-12 20:25:53,241 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 233 transitions. Word has length 52 [2024-10-12 20:25:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:53,242 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 233 transitions. [2024-10-12 20:25:53,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 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-10-12 20:25:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 233 transitions. [2024-10-12 20:25:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:25:53,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:53,242 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] [2024-10-12 20:25:53,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:25:53,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:53,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash -873153248, now seen corresponding path program 1 times [2024-10-12 20:25:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710271463] [2024-10-12 20:25:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710271463] [2024-10-12 20:25:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710271463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:53,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:53,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:25:53,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381054682] [2024-10-12 20:25:53,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:53,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:25:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:53,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:25:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:25:53,492 INFO L87 Difference]: Start difference. First operand 179 states and 233 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-10-12 20:25:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:53,835 INFO L93 Difference]: Finished difference Result 330 states and 445 transitions. [2024-10-12 20:25:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:25:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 52 [2024-10-12 20:25:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:53,836 INFO L225 Difference]: With dead ends: 330 [2024-10-12 20:25:53,836 INFO L226 Difference]: Without dead ends: 216 [2024-10-12 20:25:53,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:25:53,837 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 421 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:53,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 482 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:25:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-12 20:25:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2024-10-12 20:25:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 176 states have (on average 1.3125) internal successors, (231), 178 states have internal predecessors, (231), 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-10-12 20:25:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2024-10-12 20:25:53,844 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 52 [2024-10-12 20:25:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:53,844 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2024-10-12 20:25:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-10-12 20:25:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2024-10-12 20:25:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:25:53,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:53,845 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] [2024-10-12 20:25:53,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:25:53,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:53,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1832778738, now seen corresponding path program 1 times [2024-10-12 20:25:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745650338] [2024-10-12 20:25:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:54,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:54,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745650338] [2024-10-12 20:25:54,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745650338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:54,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 20:25:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778514764] [2024-10-12 20:25:54,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:54,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 20:25:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:54,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 20:25:54,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:54,872 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-10-12 20:25:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:55,597 INFO L93 Difference]: Finished difference Result 307 states and 406 transitions. [2024-10-12 20:25:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:25:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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 54 [2024-10-12 20:25:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:55,599 INFO L225 Difference]: With dead ends: 307 [2024-10-12 20:25:55,599 INFO L226 Difference]: Without dead ends: 299 [2024-10-12 20:25:55,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=847, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 20:25:55,600 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 376 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:55,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1881 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:25:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-12 20:25:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 182. [2024-10-12 20:25:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 179 states have (on average 1.3072625698324023) internal successors, (234), 181 states have internal predecessors, (234), 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-10-12 20:25:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 234 transitions. [2024-10-12 20:25:55,604 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 234 transitions. Word has length 54 [2024-10-12 20:25:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:55,605 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 234 transitions. [2024-10-12 20:25:55,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-10-12 20:25:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 234 transitions. [2024-10-12 20:25:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:25:55,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:55,606 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] [2024-10-12 20:25:55,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:25:55,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1645932369, now seen corresponding path program 1 times [2024-10-12 20:25:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559834583] [2024-10-12 20:25:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559834583] [2024-10-12 20:25:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559834583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:56,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 20:25:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958102947] [2024-10-12 20:25:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 20:25:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:56,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 20:25:56,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:25:56,354 INFO L87 Difference]: Start difference. First operand 182 states and 234 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-10-12 20:25:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:56,931 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2024-10-12 20:25:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 20:25:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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 54 [2024-10-12 20:25:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:56,932 INFO L225 Difference]: With dead ends: 300 [2024-10-12 20:25:56,932 INFO L226 Difference]: Without dead ends: 294 [2024-10-12 20:25:56,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2024-10-12 20:25:56,933 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 382 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:56,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1268 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:25:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-12 20:25:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 188. [2024-10-12 20:25:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 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-10-12 20:25:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2024-10-12 20:25:56,938 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 54 [2024-10-12 20:25:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:56,938 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2024-10-12 20:25:56,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 states have internal predecessors, (54), 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-10-12 20:25:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2024-10-12 20:25:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:25:56,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:56,939 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] [2024-10-12 20:25:56,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:25:56,940 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:56,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1542916524, now seen corresponding path program 1 times [2024-10-12 20:25:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:56,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782104134] [2024-10-12 20:25:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:57,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782104134] [2024-10-12 20:25:57,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782104134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:57,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:57,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:25:57,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422393352] [2024-10-12 20:25:57,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:57,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:25:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:25:57,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:25:57,246 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 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-10-12 20:25:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:57,459 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2024-10-12 20:25:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:25:57,460 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 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 55 [2024-10-12 20:25:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:57,461 INFO L225 Difference]: With dead ends: 188 [2024-10-12 20:25:57,461 INFO L226 Difference]: Without dead ends: 173 [2024-10-12 20:25:57,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:25:57,462 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 160 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:57,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 660 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:25:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-12 20:25:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-12 20:25:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 172 states have internal predecessors, (225), 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-10-12 20:25:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2024-10-12 20:25:57,465 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 225 transitions. Word has length 55 [2024-10-12 20:25:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:57,465 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 225 transitions. [2024-10-12 20:25:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 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-10-12 20:25:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2024-10-12 20:25:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 20:25:57,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:57,466 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] [2024-10-12 20:25:57,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:25:57,466 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:57,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1729762893, now seen corresponding path program 1 times [2024-10-12 20:25:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956708139] [2024-10-12 20:25:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956708139] [2024-10-12 20:25:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956708139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:57,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:57,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:25:57,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451371033] [2024-10-12 20:25:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:57,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:25:57,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:25:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:25:57,969 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 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-10-12 20:25:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:58,558 INFO L93 Difference]: Finished difference Result 473 states and 654 transitions. [2024-10-12 20:25:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 20:25:58,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 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 55 [2024-10-12 20:25:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:58,560 INFO L225 Difference]: With dead ends: 473 [2024-10-12 20:25:58,560 INFO L226 Difference]: Without dead ends: 467 [2024-10-12 20:25:58,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:25:58,561 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 629 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:58,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1395 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:25:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-12 20:25:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 161. [2024-10-12 20:25:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 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-10-12 20:25:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2024-10-12 20:25:58,567 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 55 [2024-10-12 20:25:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:58,567 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2024-10-12 20:25:58,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 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-10-12 20:25:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2024-10-12 20:25:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:25:58,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:58,571 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] [2024-10-12 20:25:58,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:25:58,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1767402819, now seen corresponding path program 1 times [2024-10-12 20:25:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:58,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328037577] [2024-10-12 20:25:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:58,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328037577] [2024-10-12 20:25:58,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328037577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:58,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:58,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:25:58,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093421668] [2024-10-12 20:25:58,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:58,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:25:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:25:58,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:25:58,642 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-10-12 20:25:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:58,698 INFO L93 Difference]: Finished difference Result 665 states and 966 transitions. [2024-10-12 20:25:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:25:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 72 [2024-10-12 20:25:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:58,701 INFO L225 Difference]: With dead ends: 665 [2024-10-12 20:25:58,701 INFO L226 Difference]: Without dead ends: 581 [2024-10-12 20:25:58,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:25:58,701 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 486 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:58,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 606 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-12 20:25:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 243. [2024-10-12 20:25:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.3677685950413223) internal successors, (331), 242 states have internal predecessors, (331), 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-10-12 20:25:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 331 transitions. [2024-10-12 20:25:58,709 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 331 transitions. Word has length 72 [2024-10-12 20:25:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:58,709 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 331 transitions. [2024-10-12 20:25:58,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-10-12 20:25:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 331 transitions. [2024-10-12 20:25:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:25:58,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:58,710 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] [2024-10-12 20:25:58,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:25:58,710 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:58,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:58,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1330307651, now seen corresponding path program 1 times [2024-10-12 20:25:58,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:58,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423200557] [2024-10-12 20:25:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:58,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423200557] [2024-10-12 20:25:58,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423200557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:58,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:25:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032568349] [2024-10-12 20:25:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:58,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:25:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:25:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:25:58,812 INFO L87 Difference]: Start difference. First operand 243 states and 331 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-10-12 20:25:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:58,864 INFO L93 Difference]: Finished difference Result 825 states and 1194 transitions. [2024-10-12 20:25:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:25:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2024-10-12 20:25:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:58,866 INFO L225 Difference]: With dead ends: 825 [2024-10-12 20:25:58,866 INFO L226 Difference]: Without dead ends: 659 [2024-10-12 20:25:58,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:58,870 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 283 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:58,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 436 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-12 20:25:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 407. [2024-10-12 20:25:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.416256157635468) internal successors, (575), 406 states have internal predecessors, (575), 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-10-12 20:25:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 575 transitions. [2024-10-12 20:25:58,886 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 575 transitions. Word has length 74 [2024-10-12 20:25:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:58,887 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 575 transitions. [2024-10-12 20:25:58,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-10-12 20:25:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 575 transitions. [2024-10-12 20:25:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:25:58,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:58,888 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] [2024-10-12 20:25:58,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:25:58,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:58,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash 794928439, now seen corresponding path program 1 times [2024-10-12 20:25:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:58,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249596881] [2024-10-12 20:25:58,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249596881] [2024-10-12 20:25:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249596881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:25:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144825315] [2024-10-12 20:25:59,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:59,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:25:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:25:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:25:59,034 INFO L87 Difference]: Start difference. First operand 407 states and 575 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-10-12 20:25:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:59,086 INFO L93 Difference]: Finished difference Result 989 states and 1438 transitions. [2024-10-12 20:25:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:25:59,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2024-10-12 20:25:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:59,089 INFO L225 Difference]: With dead ends: 989 [2024-10-12 20:25:59,089 INFO L226 Difference]: Without dead ends: 823 [2024-10-12 20:25:59,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:59,091 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 294 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:59,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 433 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-10-12 20:25:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 653. [2024-10-12 20:25:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.4417177914110428) internal successors, (940), 652 states have internal predecessors, (940), 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-10-12 20:25:59,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 940 transitions. [2024-10-12 20:25:59,104 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 940 transitions. Word has length 74 [2024-10-12 20:25:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:59,105 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 940 transitions. [2024-10-12 20:25:59,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-10-12 20:25:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 940 transitions. [2024-10-12 20:25:59,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:25:59,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:59,106 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] [2024-10-12 20:25:59,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:25:59,106 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:59,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:59,107 INFO L85 PathProgramCache]: Analyzing trace with hash 670344324, now seen corresponding path program 1 times [2024-10-12 20:25:59,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:59,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372146973] [2024-10-12 20:25:59,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:59,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372146973] [2024-10-12 20:25:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372146973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:59,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:59,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945101172] [2024-10-12 20:25:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:59,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:59,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:59,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:59,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:59,158 INFO L87 Difference]: Start difference. First operand 653 states and 940 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-12 20:25:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:59,181 INFO L93 Difference]: Finished difference Result 1231 states and 1797 transitions. [2024-10-12 20:25:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:59,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-10-12 20:25:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:59,183 INFO L225 Difference]: With dead ends: 1231 [2024-10-12 20:25:59,183 INFO L226 Difference]: Without dead ends: 655 [2024-10-12 20:25:59,184 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-10-12 20:25:59,185 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:59,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-12 20:25:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 653. [2024-10-12 20:25:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.4294478527607362) internal successors, (932), 652 states have internal predecessors, (932), 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-10-12 20:25:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 932 transitions. [2024-10-12 20:25:59,195 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 932 transitions. Word has length 74 [2024-10-12 20:25:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:59,196 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 932 transitions. [2024-10-12 20:25:59,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-12 20:25:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 932 transitions. [2024-10-12 20:25:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:25:59,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:59,197 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] [2024-10-12 20:25:59,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:25:59,197 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:59,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash -98948669, now seen corresponding path program 1 times [2024-10-12 20:25:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:59,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750271813] [2024-10-12 20:25:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:59,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:59,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750271813] [2024-10-12 20:25:59,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750271813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:59,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:59,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057583854] [2024-10-12 20:25:59,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:59,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:59,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:59,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:59,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:59,234 INFO L87 Difference]: Start difference. First operand 653 states and 932 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-12 20:25:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:59,258 INFO L93 Difference]: Finished difference Result 1715 states and 2478 transitions. [2024-10-12 20:25:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:59,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-10-12 20:25:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:59,263 INFO L225 Difference]: With dead ends: 1715 [2024-10-12 20:25:59,263 INFO L226 Difference]: Without dead ends: 1139 [2024-10-12 20:25:59,264 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-10-12 20:25:59,264 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 51 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:59,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 284 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:59,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-12 20:25:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1137. [2024-10-12 20:25:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 1.409330985915493) internal successors, (1601), 1136 states have internal predecessors, (1601), 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-10-12 20:25:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1601 transitions. [2024-10-12 20:25:59,287 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1601 transitions. Word has length 74 [2024-10-12 20:25:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:59,288 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1601 transitions. [2024-10-12 20:25:59,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-12 20:25:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1601 transitions. [2024-10-12 20:25:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:25:59,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:59,289 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] [2024-10-12 20:25:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:25:59,289 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2082611331, now seen corresponding path program 1 times [2024-10-12 20:25:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926136225] [2024-10-12 20:25:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926136225] [2024-10-12 20:25:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926136225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:59,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:59,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:25:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012349908] [2024-10-12 20:25:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:25:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:25:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:25:59,365 INFO L87 Difference]: Start difference. First operand 1137 states and 1601 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-10-12 20:25:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:59,419 INFO L93 Difference]: Finished difference Result 2051 states and 2913 transitions. [2024-10-12 20:25:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:25:59,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2024-10-12 20:25:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:59,424 INFO L225 Difference]: With dead ends: 2051 [2024-10-12 20:25:59,424 INFO L226 Difference]: Without dead ends: 1747 [2024-10-12 20:25:59,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:25:59,425 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 286 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:59,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 465 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-10-12 20:25:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1439. [2024-10-12 20:25:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1438 states have (on average 1.4137691237830319) internal successors, (2033), 1438 states have internal predecessors, (2033), 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-10-12 20:25:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2033 transitions. [2024-10-12 20:25:59,449 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2033 transitions. Word has length 74 [2024-10-12 20:25:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:59,450 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2033 transitions. [2024-10-12 20:25:59,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-10-12 20:25:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2033 transitions. [2024-10-12 20:25:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:25:59,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:59,451 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] [2024-10-12 20:25:59,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:25:59,451 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:59,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash -753330043, now seen corresponding path program 1 times [2024-10-12 20:25:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:59,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957263952] [2024-10-12 20:25:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:59,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:59,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957263952] [2024-10-12 20:25:59,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957263952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:59,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:59,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201181778] [2024-10-12 20:25:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:59,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:59,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:59,518 INFO L87 Difference]: Start difference. First operand 1439 states and 2033 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-10-12 20:25:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:59,541 INFO L93 Difference]: Finished difference Result 3677 states and 5209 transitions. [2024-10-12 20:25:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:59,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2024-10-12 20:25:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:59,547 INFO L225 Difference]: With dead ends: 3677 [2024-10-12 20:25:59,547 INFO L226 Difference]: Without dead ends: 2315 [2024-10-12 20:25:59,549 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-10-12 20:25:59,549 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 60 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:59,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 266 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2024-10-12 20:25:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2169. [2024-10-12 20:25:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.3952952029520296) internal successors, (3025), 2168 states have internal predecessors, (3025), 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-10-12 20:25:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3025 transitions. [2024-10-12 20:25:59,583 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3025 transitions. Word has length 75 [2024-10-12 20:25:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:59,583 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3025 transitions. [2024-10-12 20:25:59,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-10-12 20:25:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3025 transitions. [2024-10-12 20:25:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 20:25:59,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:59,584 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] [2024-10-12 20:25:59,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:25:59,585 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:59,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1764053275, now seen corresponding path program 1 times [2024-10-12 20:25:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644281400] [2024-10-12 20:25:59,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:59,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:59,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644281400] [2024-10-12 20:25:59,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644281400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:59,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:59,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548924595] [2024-10-12 20:25:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:59,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:59,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:59,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:59,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:59,703 INFO L87 Difference]: Start difference. First operand 2169 states and 3025 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-12 20:25:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:59,732 INFO L93 Difference]: Finished difference Result 6137 states and 8529 transitions. [2024-10-12 20:25:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:59,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2024-10-12 20:25:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:59,743 INFO L225 Difference]: With dead ends: 6137 [2024-10-12 20:25:59,743 INFO L226 Difference]: Without dead ends: 4045 [2024-10-12 20:25:59,746 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-10-12 20:25:59,747 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:59,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2024-10-12 20:25:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 3827. [2024-10-12 20:25:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3827 states, 3826 states have (on average 1.3755880815473078) internal successors, (5263), 3826 states have internal predecessors, (5263), 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-10-12 20:25:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 5263 transitions. [2024-10-12 20:25:59,802 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 5263 transitions. Word has length 76 [2024-10-12 20:25:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:25:59,802 INFO L471 AbstractCegarLoop]: Abstraction has 3827 states and 5263 transitions. [2024-10-12 20:25:59,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-10-12 20:25:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 5263 transitions. [2024-10-12 20:25:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:25:59,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:25:59,803 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] [2024-10-12 20:25:59,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:25:59,804 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:25:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:25:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1616355032, now seen corresponding path program 1 times [2024-10-12 20:25:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:25:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429354479] [2024-10-12 20:25:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:25:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:25:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:25:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:25:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:25:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429354479] [2024-10-12 20:25:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429354479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:25:59,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:25:59,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:25:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297141627] [2024-10-12 20:25:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:25:59,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:25:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:25:59,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:25:59,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:25:59,867 INFO L87 Difference]: Start difference. First operand 3827 states and 5263 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-10-12 20:25:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:25:59,904 INFO L93 Difference]: Finished difference Result 10895 states and 14865 transitions. [2024-10-12 20:25:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:25:59,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2024-10-12 20:25:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:25:59,921 INFO L225 Difference]: With dead ends: 10895 [2024-10-12 20:25:59,922 INFO L226 Difference]: Without dead ends: 7145 [2024-10-12 20:25:59,927 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-10-12 20:25:59,928 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 43 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:25:59,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:25:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7145 states. [2024-10-12 20:26:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7145 to 6711. [2024-10-12 20:26:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6711 states, 6710 states have (on average 1.346795827123696) internal successors, (9037), 6710 states have internal predecessors, (9037), 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-10-12 20:26:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6711 states to 6711 states and 9037 transitions. [2024-10-12 20:26:00,034 INFO L78 Accepts]: Start accepts. Automaton has 6711 states and 9037 transitions. Word has length 77 [2024-10-12 20:26:00,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:00,035 INFO L471 AbstractCegarLoop]: Abstraction has 6711 states and 9037 transitions. [2024-10-12 20:26:00,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-10-12 20:26:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6711 states and 9037 transitions. [2024-10-12 20:26:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:26:00,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:00,036 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] [2024-10-12 20:26:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:26:00,036 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:00,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2121296140, now seen corresponding path program 1 times [2024-10-12 20:26:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889498019] [2024-10-12 20:26:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:00,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889498019] [2024-10-12 20:26:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889498019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:26:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745664831] [2024-10-12 20:26:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:26:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:26:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:26:00,181 INFO L87 Difference]: Start difference. First operand 6711 states and 9037 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-10-12 20:26:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:00,220 INFO L93 Difference]: Finished difference Result 6905 states and 9294 transitions. [2024-10-12 20:26:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:26:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 78 [2024-10-12 20:26:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:00,246 INFO L225 Difference]: With dead ends: 6905 [2024-10-12 20:26:00,247 INFO L226 Difference]: Without dead ends: 6903 [2024-10-12 20:26:00,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:26:00,251 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:00,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2024-10-12 20:26:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6903. [2024-10-12 20:26:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6903 states, 6902 states have (on average 1.3255578093306288) internal successors, (9149), 6902 states have internal predecessors, (9149), 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-10-12 20:26:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 9149 transitions. [2024-10-12 20:26:00,413 INFO L78 Accepts]: Start accepts. Automaton has 6903 states and 9149 transitions. Word has length 78 [2024-10-12 20:26:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:00,413 INFO L471 AbstractCegarLoop]: Abstraction has 6903 states and 9149 transitions. [2024-10-12 20:26:00,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-10-12 20:26:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6903 states and 9149 transitions. [2024-10-12 20:26:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 20:26:00,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:00,414 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] [2024-10-12 20:26:00,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:26:00,414 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:00,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 305590840, now seen corresponding path program 1 times [2024-10-12 20:26:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539297669] [2024-10-12 20:26:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:00,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:00,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539297669] [2024-10-12 20:26:00,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539297669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:00,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:00,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:26:00,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844062666] [2024-10-12 20:26:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:00,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:26:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:26:00,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:26:00,460 INFO L87 Difference]: Start difference. First operand 6903 states and 9149 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-12 20:26:00,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:00,503 INFO L93 Difference]: Finished difference Result 13995 states and 18571 transitions. [2024-10-12 20:26:00,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:26:00,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-10-12 20:26:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:00,517 INFO L225 Difference]: With dead ends: 13995 [2024-10-12 20:26:00,517 INFO L226 Difference]: Without dead ends: 7169 [2024-10-12 20:26:00,526 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-10-12 20:26:00,527 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:00,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 216 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:26:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-10-12 20:26:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7167. [2024-10-12 20:26:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7167 states, 7166 states have (on average 1.3051911805749372) internal successors, (9353), 7166 states have internal predecessors, (9353), 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-10-12 20:26:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7167 states to 7167 states and 9353 transitions. [2024-10-12 20:26:00,637 INFO L78 Accepts]: Start accepts. Automaton has 7167 states and 9353 transitions. Word has length 78 [2024-10-12 20:26:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:00,637 INFO L471 AbstractCegarLoop]: Abstraction has 7167 states and 9353 transitions. [2024-10-12 20:26:00,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-12 20:26:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7167 states and 9353 transitions. [2024-10-12 20:26:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:26:00,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:00,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:00,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:26:00,642 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:00,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1123966569, now seen corresponding path program 1 times [2024-10-12 20:26:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440124103] [2024-10-12 20:26:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:00,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440124103] [2024-10-12 20:26:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440124103] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:00,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016901199] [2024-10-12 20:26:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:00,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:00,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:00,984 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:00,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:26:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:01,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 20:26:01,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:01,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016901199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:02,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-10-12 20:26:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42500835] [2024-10-12 20:26:02,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:02,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 20:26:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 20:26:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:26:02,769 INFO L87 Difference]: Start difference. First operand 7167 states and 9353 transitions. Second operand has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 28 states have internal predecessors, (268), 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-10-12 20:26:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:07,064 INFO L93 Difference]: Finished difference Result 67116 states and 87385 transitions. [2024-10-12 20:26:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-10-12 20:26:07,065 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 28 states have internal predecessors, (268), 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 100 [2024-10-12 20:26:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:07,158 INFO L225 Difference]: With dead ends: 67116 [2024-10-12 20:26:07,159 INFO L226 Difference]: Without dead ends: 60026 [2024-10-12 20:26:07,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6990 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3126, Invalid=18044, Unknown=0, NotChecked=0, Total=21170 [2024-10-12 20:26:07,191 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2052 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:07,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 2294 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:26:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60026 states. [2024-10-12 20:26:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60026 to 26762. [2024-10-12 20:26:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26762 states, 26761 states have (on average 1.2943836179514965) internal successors, (34639), 26761 states have internal predecessors, (34639), 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-10-12 20:26:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26762 states to 26762 states and 34639 transitions. [2024-10-12 20:26:07,784 INFO L78 Accepts]: Start accepts. Automaton has 26762 states and 34639 transitions. Word has length 100 [2024-10-12 20:26:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:07,784 INFO L471 AbstractCegarLoop]: Abstraction has 26762 states and 34639 transitions. [2024-10-12 20:26:07,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.241379310344827) internal successors, (268), 28 states have internal predecessors, (268), 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-10-12 20:26:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 26762 states and 34639 transitions. [2024-10-12 20:26:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:26:07,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:07,788 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:07,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:26:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-12 20:26:07,990 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash 706190566, now seen corresponding path program 1 times [2024-10-12 20:26:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:07,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179763913] [2024-10-12 20:26:07,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:07,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 20:26:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:08,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179763913] [2024-10-12 20:26:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179763913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:26:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:26:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705475008] [2024-10-12 20:26:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:08,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:26:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:08,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:26:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:26:08,087 INFO L87 Difference]: Start difference. First operand 26762 states and 34639 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-12 20:26:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:08,261 INFO L93 Difference]: Finished difference Result 65356 states and 84284 transitions. [2024-10-12 20:26:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:26:08,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 101 [2024-10-12 20:26:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:08,309 INFO L225 Difference]: With dead ends: 65356 [2024-10-12 20:26:08,309 INFO L226 Difference]: Without dead ends: 38678 [2024-10-12 20:26:08,332 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-10-12 20:26:08,334 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:08,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 219 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:26:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38678 states. [2024-10-12 20:26:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38678 to 26610. [2024-10-12 20:26:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26610 states, 26609 states have (on average 1.2903528881205608) internal successors, (34335), 26609 states have internal predecessors, (34335), 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-10-12 20:26:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26610 states to 26610 states and 34335 transitions. [2024-10-12 20:26:08,747 INFO L78 Accepts]: Start accepts. Automaton has 26610 states and 34335 transitions. Word has length 101 [2024-10-12 20:26:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 26610 states and 34335 transitions. [2024-10-12 20:26:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-12 20:26:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 26610 states and 34335 transitions. [2024-10-12 20:26:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:26:08,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:08,751 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:08,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:26:08,751 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1785101643, now seen corresponding path program 1 times [2024-10-12 20:26:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176013796] [2024-10-12 20:26:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:09,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176013796] [2024-10-12 20:26:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176013796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438153180] [2024-10-12 20:26:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:09,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:09,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:09,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:26:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:09,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 20:26:09,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:10,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:10,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438153180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:10,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:10,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2024-10-12 20:26:10,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283227821] [2024-10-12 20:26:10,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:10,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 20:26:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:10,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 20:26:10,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-10-12 20:26:10,825 INFO L87 Difference]: Start difference. First operand 26610 states and 34335 transitions. Second operand has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 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-10-12 20:26:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:17,463 INFO L93 Difference]: Finished difference Result 154899 states and 199346 transitions. [2024-10-12 20:26:17,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-10-12 20:26:17,463 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 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 101 [2024-10-12 20:26:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:17,615 INFO L225 Difference]: With dead ends: 154899 [2024-10-12 20:26:17,616 INFO L226 Difference]: Without dead ends: 128373 [2024-10-12 20:26:17,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6227 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2791, Invalid=16669, Unknown=0, NotChecked=0, Total=19460 [2024-10-12 20:26:17,670 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 2228 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:17,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 1671 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:26:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128373 states. [2024-10-12 20:26:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128373 to 84672. [2024-10-12 20:26:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84672 states, 84671 states have (on average 1.287548275088283) internal successors, (109018), 84671 states have internal predecessors, (109018), 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-10-12 20:26:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84672 states to 84672 states and 109018 transitions. [2024-10-12 20:26:19,528 INFO L78 Accepts]: Start accepts. Automaton has 84672 states and 109018 transitions. Word has length 101 [2024-10-12 20:26:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:19,528 INFO L471 AbstractCegarLoop]: Abstraction has 84672 states and 109018 transitions. [2024-10-12 20:26:19,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.346153846153847) internal successors, (269), 26 states have internal predecessors, (269), 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-10-12 20:26:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 84672 states and 109018 transitions. [2024-10-12 20:26:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:26:19,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:19,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:19,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:26:19,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-12 20:26:19,740 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 816185589, now seen corresponding path program 1 times [2024-10-12 20:26:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:19,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995906477] [2024-10-12 20:26:19,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:20,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995906477] [2024-10-12 20:26:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995906477] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274051881] [2024-10-12 20:26:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:20,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:20,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:20,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:20,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:26:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:20,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:26:20,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 20:26:21,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:26:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274051881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:26:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:26:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-10-12 20:26:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409136277] [2024-10-12 20:26:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:26:21,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:26:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:26:21,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:26:21,057 INFO L87 Difference]: Start difference. First operand 84672 states and 109018 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 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-10-12 20:26:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:21,770 INFO L93 Difference]: Finished difference Result 203823 states and 262506 transitions. [2024-10-12 20:26:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:26:21,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 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 102 [2024-10-12 20:26:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:22,118 INFO L225 Difference]: With dead ends: 203823 [2024-10-12 20:26:22,122 INFO L226 Difference]: Without dead ends: 119258 [2024-10-12 20:26:22,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:26:22,190 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 380 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:22,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 450 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:26:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119258 states. [2024-10-12 20:26:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119258 to 84672. [2024-10-12 20:26:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84672 states, 84671 states have (on average 1.2875010334116759) internal successors, (109014), 84671 states have internal predecessors, (109014), 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-10-12 20:26:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84672 states to 84672 states and 109014 transitions. [2024-10-12 20:26:23,425 INFO L78 Accepts]: Start accepts. Automaton has 84672 states and 109014 transitions. Word has length 102 [2024-10-12 20:26:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:23,425 INFO L471 AbstractCegarLoop]: Abstraction has 84672 states and 109014 transitions. [2024-10-12 20:26:23,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 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-10-12 20:26:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84672 states and 109014 transitions. [2024-10-12 20:26:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:26:23,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:23,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:23,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 20:26:23,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-12 20:26:23,641 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash -498912012, now seen corresponding path program 1 times [2024-10-12 20:26:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802497396] [2024-10-12 20:26:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802497396] [2024-10-12 20:26:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802497396] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913432598] [2024-10-12 20:26:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:24,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:24,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:26:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:24,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-12 20:26:24,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:26:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:25,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:26:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:27,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913432598] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:26:27,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:26:27,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 40 [2024-10-12 20:26:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846085972] [2024-10-12 20:26:27,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:26:27,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-12 20:26:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:26:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-12 20:26:27,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2024-10-12 20:26:27,570 INFO L87 Difference]: Start difference. First operand 84672 states and 109014 transitions. Second operand has 40 states, 40 states have (on average 7.0) internal successors, (280), 40 states have internal predecessors, (280), 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-10-12 20:26:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:26:54,970 INFO L93 Difference]: Finished difference Result 401648 states and 516346 transitions. [2024-10-12 20:26:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2024-10-12 20:26:54,971 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.0) internal successors, (280), 40 states have internal predecessors, (280), 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 103 [2024-10-12 20:26:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:26:55,322 INFO L225 Difference]: With dead ends: 401648 [2024-10-12 20:26:55,323 INFO L226 Difference]: Without dead ends: 336680 [2024-10-12 20:26:55,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33113 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=7656, Invalid=79664, Unknown=0, NotChecked=0, Total=87320 [2024-10-12 20:26:55,378 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 5377 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 6747 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5377 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 6943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 6747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:26:55,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5377 Valid, 3569 Invalid, 6943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 6747 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-12 20:26:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336680 states. [2024-10-12 20:26:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336680 to 157000. [2024-10-12 20:26:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157000 states, 156999 states have (on average 1.2881992878935535) internal successors, (202246), 156999 states have internal predecessors, (202246), 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-10-12 20:26:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157000 states to 157000 states and 202246 transitions. [2024-10-12 20:26:58,299 INFO L78 Accepts]: Start accepts. Automaton has 157000 states and 202246 transitions. Word has length 103 [2024-10-12 20:26:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:26:58,299 INFO L471 AbstractCegarLoop]: Abstraction has 157000 states and 202246 transitions. [2024-10-12 20:26:58,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.0) internal successors, (280), 40 states have internal predecessors, (280), 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-10-12 20:26:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 157000 states and 202246 transitions. [2024-10-12 20:26:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:26:58,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:26:58,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:26:58,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 20:26:58,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:58,510 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-12 20:26:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:26:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1411152920, now seen corresponding path program 1 times [2024-10-12 20:26:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:26:58,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006477393] [2024-10-12 20:26:58,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:26:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:26:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:26:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006477393] [2024-10-12 20:26:59,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006477393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:26:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460470527] [2024-10-12 20:26:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:26:59,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:26:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:26:59,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:26:59,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:26:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:26:59,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 20:27:00,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:27:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:01,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:27:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:27:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460470527] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:27:02,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:27:02,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 11] total 44 [2024-10-12 20:27:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451579466] [2024-10-12 20:27:02,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:27:02,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-12 20:27:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:27:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-12 20:27:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2024-10-12 20:27:02,375 INFO L87 Difference]: Start difference. First operand 157000 states and 202246 transitions. Second operand has 44 states, 44 states have (on average 6.636363636363637) internal successors, (292), 44 states have internal predecessors, (292), 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)