./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.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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.4.1.ufo.UNBOUNDED.pals.c.v+sep-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 297d4f7e6fe1324d357f4812a6556f1cd58caa692e4601779e6f52e2ab17fbf7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:52:44,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:52:44,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:52:44,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:52:44,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:52:44,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:52:44,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:52:44,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:52:44,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:52:44,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:52:44,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:52:44,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:52:44,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:52:44,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:52:44,228 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:52:44,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:52:44,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:52:44,229 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:52:44,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:52:44,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:52:44,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:52:44,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:52:44,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:52:44,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:52:44,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:52:44,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:52:44,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:52:44,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:52:44,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:52:44,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:52:44,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:52:44,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:52:44,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:52:44,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:52:44,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:52:44,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:52:44,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:52:44,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:52:44,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:52:44,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:52:44,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:52:44,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:52:44,239 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 -> 297d4f7e6fe1324d357f4812a6556f1cd58caa692e4601779e6f52e2ab17fbf7 [2024-11-19 22:52:44,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:52:44,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:52:44,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:52:44,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:52:44,520 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:52:44,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-19 22:52:45,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:52:46,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:52:46,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-19 22:52:46,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd73df8f/a413d8ecb57d4a6883978266f817f3fe/FLAG3668e5849 [2024-11-19 22:52:46,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd73df8f/a413d8ecb57d4a6883978266f817f3fe [2024-11-19 22:52:46,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:52:46,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:52:46,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:52:46,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:52:46,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:52:46,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:52:46" (1/1) ... [2024-11-19 22:52:46,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f319975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:46, skipping insertion in model container [2024-11-19 22:52:46,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:52:46" (1/1) ... [2024-11-19 22:52:46,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:52:47,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16948,16961] [2024-11-19 22:52:47,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23372,23385] [2024-11-19 22:52:47,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26559,26572] [2024-11-19 22:52:47,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29535,29548] [2024-11-19 22:52:47,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33298,33311] [2024-11-19 22:52:47,182 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36350,36363] [2024-11-19 22:52:47,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39535,39548] [2024-11-19 22:52:47,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42506,42519] [2024-11-19 22:52:47,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45890,45903] [2024-11-19 22:52:47,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48876,48889] [2024-11-19 22:52:47,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[52025,52038] [2024-11-19 22:52:47,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:52:47,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:52:47,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16948,16961] [2024-11-19 22:52:47,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23372,23385] [2024-11-19 22:52:47,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26559,26572] [2024-11-19 22:52:47,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29535,29548] [2024-11-19 22:52:47,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33298,33311] [2024-11-19 22:52:47,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36350,36363] [2024-11-19 22:52:47,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39535,39548] [2024-11-19 22:52:47,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42506,42519] [2024-11-19 22:52:47,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45890,45903] [2024-11-19 22:52:47,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48876,48889] [2024-11-19 22:52:47,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[52025,52038] [2024-11-19 22:52:47,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:52:47,475 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:52:47,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47 WrapperNode [2024-11-19 22:52:47,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:52:47,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:52:47,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:52:47,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:52:47,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,603 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2763 [2024-11-19 22:52:47,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:52:47,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:52:47,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:52:47,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:52:47,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,674 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:52:47,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:52:47,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:52:47,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:52:47,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:52:47,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (1/1) ... [2024-11-19 22:52:47,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:52:47,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:52:47,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:52:47,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:52:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:52:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:52:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:52:47,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:52:48,057 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:52:48,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:52:49,645 INFO L? ?]: Removed 475 outVars from TransFormulas that were not future-live. [2024-11-19 22:52:49,645 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:52:49,677 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:52:49,678 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:52:49,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:52:49 BoogieIcfgContainer [2024-11-19 22:52:49,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:52:49,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:52:49,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:52:49,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:52:49,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:52:46" (1/3) ... [2024-11-19 22:52:49,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a56551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:52:49, skipping insertion in model container [2024-11-19 22:52:49,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:52:47" (2/3) ... [2024-11-19 22:52:49,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a56551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:52:49, skipping insertion in model container [2024-11-19 22:52:49,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:52:49" (3/3) ... [2024-11-19 22:52:49,688 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-19 22:52:49,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:52:49,705 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-19 22:52:49,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:52:49,786 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;@1a1f2174, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:52:49,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-19 22:52:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 22:52:49,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:49,812 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] [2024-11-19 22:52:49,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:49,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:49,817 INFO L85 PathProgramCache]: Analyzing trace with hash 702631990, now seen corresponding path program 1 times [2024-11-19 22:52:49,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:49,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228077669] [2024-11-19 22:52:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228077669] [2024-11-19 22:52:50,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228077669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:50,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:50,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:52:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237194685] [2024-11-19 22:52:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:50,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:50,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:50,418 INFO L87 Difference]: Start difference. First operand has 537 states, 525 states have (on average 1.8304761904761904) internal successors, (961), 536 states have internal predecessors, (961), 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 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:51,006 INFO L93 Difference]: Finished difference Result 740 states and 1288 transitions. [2024-11-19 22:52:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:51,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2024-11-19 22:52:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:51,025 INFO L225 Difference]: With dead ends: 740 [2024-11-19 22:52:51,025 INFO L226 Difference]: Without dead ends: 470 [2024-11-19 22:52:51,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:51,034 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 2334 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:51,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2334 Valid, 518 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:52:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-19 22:52:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2024-11-19 22:52:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 459 states have (on average 1.2962962962962963) internal successors, (595), 469 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 595 transitions. [2024-11-19 22:52:51,099 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 595 transitions. Word has length 59 [2024-11-19 22:52:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:51,101 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 595 transitions. [2024-11-19 22:52:51,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 595 transitions. [2024-11-19 22:52:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 22:52:51,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:51,108 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] [2024-11-19 22:52:51,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:52:51,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:51,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 728409025, now seen corresponding path program 1 times [2024-11-19 22:52:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514941335] [2024-11-19 22:52:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514941335] [2024-11-19 22:52:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514941335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:51,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:52:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375982061] [2024-11-19 22:52:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:51,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:51,309 INFO L87 Difference]: Start difference. First operand 470 states and 595 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:51,613 INFO L93 Difference]: Finished difference Result 600 states and 761 transitions. [2024-11-19 22:52:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:51,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2024-11-19 22:52:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:51,617 INFO L225 Difference]: With dead ends: 600 [2024-11-19 22:52:51,619 INFO L226 Difference]: Without dead ends: 356 [2024-11-19 22:52:51,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:51,621 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 1305 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:51,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 243 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:52:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-19 22:52:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-19 22:52:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.3101449275362318) internal successors, (452), 355 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 452 transitions. [2024-11-19 22:52:51,645 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 452 transitions. Word has length 59 [2024-11-19 22:52:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:51,645 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 452 transitions. [2024-11-19 22:52:51,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 452 transitions. [2024-11-19 22:52:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 22:52:51,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:51,649 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] [2024-11-19 22:52:51,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:52:51,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:51,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash -466198780, now seen corresponding path program 1 times [2024-11-19 22:52:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731926336] [2024-11-19 22:52:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:51,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:51,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731926336] [2024-11-19 22:52:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731926336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:51,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:51,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:52:51,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736460720] [2024-11-19 22:52:51,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:51,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:51,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:51,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:51,786 INFO L87 Difference]: Start difference. First operand 356 states and 452 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:52,152 INFO L93 Difference]: Finished difference Result 668 states and 866 transitions. [2024-11-19 22:52:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2024-11-19 22:52:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:52,154 INFO L225 Difference]: With dead ends: 668 [2024-11-19 22:52:52,154 INFO L226 Difference]: Without dead ends: 474 [2024-11-19 22:52:52,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:52,156 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1586 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:52,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 339 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:52:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-19 22:52:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 420. [2024-11-19 22:52:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 409 states have (on average 1.371638141809291) internal successors, (561), 419 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 561 transitions. [2024-11-19 22:52:52,170 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 561 transitions. Word has length 59 [2024-11-19 22:52:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:52,170 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 561 transitions. [2024-11-19 22:52:52,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 561 transitions. [2024-11-19 22:52:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 22:52:52,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:52,172 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] [2024-11-19 22:52:52,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:52:52,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1447561490, now seen corresponding path program 1 times [2024-11-19 22:52:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847426530] [2024-11-19 22:52:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847426530] [2024-11-19 22:52:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847426530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:52,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:52,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:52:52,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122804408] [2024-11-19 22:52:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:52,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:52:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:52,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:52:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:52:52,327 INFO L87 Difference]: Start difference. First operand 420 states and 561 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:52,481 INFO L93 Difference]: Finished difference Result 576 states and 768 transitions. [2024-11-19 22:52:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:52:52,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2024-11-19 22:52:52,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:52,484 INFO L225 Difference]: With dead ends: 576 [2024-11-19 22:52:52,484 INFO L226 Difference]: Without dead ends: 337 [2024-11-19 22:52:52,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:52:52,485 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 868 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:52,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 195 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:52:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-19 22:52:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-11-19 22:52:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3742331288343559) internal successors, (448), 336 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 448 transitions. [2024-11-19 22:52:52,493 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 448 transitions. Word has length 60 [2024-11-19 22:52:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:52,493 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 448 transitions. [2024-11-19 22:52:52,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 448 transitions. [2024-11-19 22:52:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 22:52:52,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:52,495 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] [2024-11-19 22:52:52,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:52:52,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash -944801897, now seen corresponding path program 1 times [2024-11-19 22:52:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:52,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855434413] [2024-11-19 22:52:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855434413] [2024-11-19 22:52:52,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855434413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:52,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:52,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178708698] [2024-11-19 22:52:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:52,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:52,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:52,850 INFO L87 Difference]: Start difference. First operand 337 states and 448 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:53,378 INFO L93 Difference]: Finished difference Result 666 states and 912 transitions. [2024-11-19 22:52:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:52:53,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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 61 [2024-11-19 22:52:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:53,380 INFO L225 Difference]: With dead ends: 666 [2024-11-19 22:52:53,381 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 22:52:53,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:52:53,382 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1123 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:53,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 995 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:52:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 22:52:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2024-11-19 22:52:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3711656441717792) internal successors, (447), 336 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 447 transitions. [2024-11-19 22:52:53,393 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 447 transitions. Word has length 61 [2024-11-19 22:52:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:53,394 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 447 transitions. [2024-11-19 22:52:53,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 447 transitions. [2024-11-19 22:52:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 22:52:53,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:53,395 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] [2024-11-19 22:52:53,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:52:53,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:53,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 448084895, now seen corresponding path program 1 times [2024-11-19 22:52:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:53,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018940003] [2024-11-19 22:52:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:53,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:53,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018940003] [2024-11-19 22:52:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018940003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257892502] [2024-11-19 22:52:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:53,787 INFO L87 Difference]: Start difference. First operand 337 states and 447 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:54,328 INFO L93 Difference]: Finished difference Result 669 states and 910 transitions. [2024-11-19 22:52:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:52:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 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 61 [2024-11-19 22:52:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:54,330 INFO L225 Difference]: With dead ends: 669 [2024-11-19 22:52:54,331 INFO L226 Difference]: Without dead ends: 529 [2024-11-19 22:52:54,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:52:54,333 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1464 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:54,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 880 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:52:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-19 22:52:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 337. [2024-11-19 22:52:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3680981595092025) internal successors, (446), 336 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 446 transitions. [2024-11-19 22:52:54,347 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 446 transitions. Word has length 61 [2024-11-19 22:52:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:54,349 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 446 transitions. [2024-11-19 22:52:54,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 446 transitions. [2024-11-19 22:52:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 22:52:54,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:54,350 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] [2024-11-19 22:52:54,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:52:54,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:54,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:54,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1014019097, now seen corresponding path program 1 times [2024-11-19 22:52:54,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:54,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518955655] [2024-11-19 22:52:54,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:54,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:54,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518955655] [2024-11-19 22:52:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518955655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:54,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:54,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:52:54,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337250680] [2024-11-19 22:52:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:54,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:52:54,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:52:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:52:54,673 INFO L87 Difference]: Start difference. First operand 337 states and 446 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:55,095 INFO L93 Difference]: Finished difference Result 687 states and 915 transitions. [2024-11-19 22:52:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:52:55,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 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 61 [2024-11-19 22:52:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:55,098 INFO L225 Difference]: With dead ends: 687 [2024-11-19 22:52:55,099 INFO L226 Difference]: Without dead ends: 502 [2024-11-19 22:52:55,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:52:55,100 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1277 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:55,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 762 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:52:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-19 22:52:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 337. [2024-11-19 22:52:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3650306748466257) internal successors, (445), 336 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 445 transitions. [2024-11-19 22:52:55,111 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 445 transitions. Word has length 61 [2024-11-19 22:52:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:55,112 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 445 transitions. [2024-11-19 22:52:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 445 transitions. [2024-11-19 22:52:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:52:55,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:55,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:52:55,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:52:55,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:55,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -471732578, now seen corresponding path program 1 times [2024-11-19 22:52:55,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:55,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827486818] [2024-11-19 22:52:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:55,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827486818] [2024-11-19 22:52:55,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827486818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:55,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:55,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:55,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867345] [2024-11-19 22:52:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:55,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:55,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:55,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:55,396 INFO L87 Difference]: Start difference. First operand 337 states and 445 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:55,929 INFO L93 Difference]: Finished difference Result 565 states and 753 transitions. [2024-11-19 22:52:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:52:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2024-11-19 22:52:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:55,932 INFO L225 Difference]: With dead ends: 565 [2024-11-19 22:52:55,932 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 22:52:55,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:52:55,933 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1626 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:55,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1626 Valid, 878 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:52:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 22:52:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2024-11-19 22:52:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3588957055214723) internal successors, (443), 336 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 443 transitions. [2024-11-19 22:52:55,941 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 443 transitions. Word has length 63 [2024-11-19 22:52:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:55,941 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 443 transitions. [2024-11-19 22:52:55,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 443 transitions. [2024-11-19 22:52:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:52:55,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:55,943 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] [2024-11-19 22:52:55,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:52:55,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:55,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash -157878139, now seen corresponding path program 1 times [2024-11-19 22:52:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:55,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417620570] [2024-11-19 22:52:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:55,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:56,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:56,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417620570] [2024-11-19 22:52:56,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417620570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:56,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:56,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947485614] [2024-11-19 22:52:56,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:56,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:56,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:56,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:56,206 INFO L87 Difference]: Start difference. First operand 337 states and 443 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:56,715 INFO L93 Difference]: Finished difference Result 533 states and 702 transitions. [2024-11-19 22:52:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:52:56,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2024-11-19 22:52:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:56,718 INFO L225 Difference]: With dead ends: 533 [2024-11-19 22:52:56,718 INFO L226 Difference]: Without dead ends: 528 [2024-11-19 22:52:56,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:52:56,719 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1616 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1616 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:56,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1616 Valid, 827 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:52:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-19 22:52:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-11-19 22:52:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.352760736196319) internal successors, (441), 336 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 441 transitions. [2024-11-19 22:52:56,728 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 441 transitions. Word has length 63 [2024-11-19 22:52:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:56,728 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 441 transitions. [2024-11-19 22:52:56,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2024-11-19 22:52:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:52:56,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:56,729 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] [2024-11-19 22:52:56,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:52:56,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2011079223, now seen corresponding path program 1 times [2024-11-19 22:52:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932080742] [2024-11-19 22:52:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932080742] [2024-11-19 22:52:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932080742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:52:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427047976] [2024-11-19 22:52:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:57,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:52:57,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:57,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:52:57,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:52:57,187 INFO L87 Difference]: Start difference. First operand 337 states and 441 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:57,856 INFO L93 Difference]: Finished difference Result 646 states and 883 transitions. [2024-11-19 22:52:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:52:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 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 63 [2024-11-19 22:52:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:57,858 INFO L225 Difference]: With dead ends: 646 [2024-11-19 22:52:57,859 INFO L226 Difference]: Without dead ends: 476 [2024-11-19 22:52:57,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-11-19 22:52:57,861 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1542 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:57,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1018 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:52:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-19 22:52:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 337. [2024-11-19 22:52:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 336 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 439 transitions. [2024-11-19 22:52:57,868 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 439 transitions. Word has length 63 [2024-11-19 22:52:57,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:57,868 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 439 transitions. [2024-11-19 22:52:57,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 439 transitions. [2024-11-19 22:52:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:52:57,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:57,869 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] [2024-11-19 22:52:57,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:52:57,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:57,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:57,871 INFO L85 PathProgramCache]: Analyzing trace with hash 556986468, now seen corresponding path program 1 times [2024-11-19 22:52:57,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:57,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234675093] [2024-11-19 22:52:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:57,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234675093] [2024-11-19 22:52:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234675093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:58,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:58,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750191679] [2024-11-19 22:52:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:58,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:58,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:58,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:58,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:58,195 INFO L87 Difference]: Start difference. First operand 337 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:58,781 INFO L93 Difference]: Finished difference Result 671 states and 908 transitions. [2024-11-19 22:52:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:52:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2024-11-19 22:52:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:58,785 INFO L225 Difference]: With dead ends: 671 [2024-11-19 22:52:58,785 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 22:52:58,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:52:58,786 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 957 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:58,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1109 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:52:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 22:52:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 337. [2024-11-19 22:52:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.343558282208589) internal successors, (438), 336 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 438 transitions. [2024-11-19 22:52:58,793 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 438 transitions. Word has length 63 [2024-11-19 22:52:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 438 transitions. [2024-11-19 22:52:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 438 transitions. [2024-11-19 22:52:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:52:58,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:58,795 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] [2024-11-19 22:52:58,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:52:58,795 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -33472501, now seen corresponding path program 1 times [2024-11-19 22:52:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876735371] [2024-11-19 22:52:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:59,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:59,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876735371] [2024-11-19 22:52:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876735371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076083406] [2024-11-19 22:52:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:59,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:59,044 INFO L87 Difference]: Start difference. First operand 337 states and 438 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:52:59,575 INFO L93 Difference]: Finished difference Result 639 states and 858 transitions. [2024-11-19 22:52:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:52:59,576 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2024-11-19 22:52:59,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:52:59,578 INFO L225 Difference]: With dead ends: 639 [2024-11-19 22:52:59,578 INFO L226 Difference]: Without dead ends: 528 [2024-11-19 22:52:59,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:52:59,579 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1544 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:52:59,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 879 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:52:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-19 22:52:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-11-19 22:52:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3404907975460123) internal successors, (437), 336 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 437 transitions. [2024-11-19 22:52:59,586 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 437 transitions. Word has length 63 [2024-11-19 22:52:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:52:59,587 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 437 transitions. [2024-11-19 22:52:59,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:52:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 437 transitions. [2024-11-19 22:52:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:52:59,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:52:59,588 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] [2024-11-19 22:52:59,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:52:59,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:52:59,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:52:59,589 INFO L85 PathProgramCache]: Analyzing trace with hash -653212004, now seen corresponding path program 1 times [2024-11-19 22:52:59,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:52:59,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071020351] [2024-11-19 22:52:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:52:59,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:52:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:52:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:52:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:52:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071020351] [2024-11-19 22:52:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071020351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:52:59,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:52:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:52:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899263582] [2024-11-19 22:52:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:52:59,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:52:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:52:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:52:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:52:59,813 INFO L87 Difference]: Start difference. First operand 337 states and 437 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:00,294 INFO L93 Difference]: Finished difference Result 533 states and 696 transitions. [2024-11-19 22:53:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2024-11-19 22:53:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:00,297 INFO L225 Difference]: With dead ends: 533 [2024-11-19 22:53:00,298 INFO L226 Difference]: Without dead ends: 528 [2024-11-19 22:53:00,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:53:00,299 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1505 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:00,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 864 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-19 22:53:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-11-19 22:53:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.3374233128834356) internal successors, (436), 336 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 436 transitions. [2024-11-19 22:53:00,306 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 436 transitions. Word has length 63 [2024-11-19 22:53:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:00,306 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 436 transitions. [2024-11-19 22:53:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 436 transitions. [2024-11-19 22:53:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 22:53:00,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:00,307 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] [2024-11-19 22:53:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:53:00,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 543767036, now seen corresponding path program 1 times [2024-11-19 22:53:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495839886] [2024-11-19 22:53:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495839886] [2024-11-19 22:53:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495839886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257422462] [2024-11-19 22:53:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:00,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:00,576 INFO L87 Difference]: Start difference. First operand 337 states and 436 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:01,057 INFO L93 Difference]: Finished difference Result 636 states and 852 transitions. [2024-11-19 22:53:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:01,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2024-11-19 22:53:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:01,059 INFO L225 Difference]: With dead ends: 636 [2024-11-19 22:53:01,060 INFO L226 Difference]: Without dead ends: 528 [2024-11-19 22:53:01,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:53:01,061 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1537 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:01,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 879 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-19 22:53:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 337. [2024-11-19 22:53:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 326 states have (on average 1.334355828220859) internal successors, (435), 336 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 435 transitions. [2024-11-19 22:53:01,069 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 435 transitions. Word has length 63 [2024-11-19 22:53:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:01,069 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 435 transitions. [2024-11-19 22:53:01,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 435 transitions. [2024-11-19 22:53:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:53:01,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:01,070 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] [2024-11-19 22:53:01,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:53:01,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2022048839, now seen corresponding path program 1 times [2024-11-19 22:53:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:01,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380186650] [2024-11-19 22:53:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:01,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380186650] [2024-11-19 22:53:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380186650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:53:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727634909] [2024-11-19 22:53:01,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:01,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:53:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:01,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:53:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:53:01,676 INFO L87 Difference]: Start difference. First operand 337 states and 435 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:02,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:02,151 INFO L93 Difference]: Finished difference Result 497 states and 675 transitions. [2024-11-19 22:53:02,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 65 [2024-11-19 22:53:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:02,153 INFO L225 Difference]: With dead ends: 497 [2024-11-19 22:53:02,153 INFO L226 Difference]: Without dead ends: 349 [2024-11-19 22:53:02,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:53:02,154 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1097 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:02,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1574 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-19 22:53:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 295. [2024-11-19 22:53:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 287 states have (on average 1.3344947735191637) internal successors, (383), 294 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 383 transitions. [2024-11-19 22:53:02,161 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 383 transitions. Word has length 65 [2024-11-19 22:53:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:02,161 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 383 transitions. [2024-11-19 22:53:02,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 383 transitions. [2024-11-19 22:53:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:53:02,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:02,162 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] [2024-11-19 22:53:02,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:53:02,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:02,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash -907607662, now seen corresponding path program 1 times [2024-11-19 22:53:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:02,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022100488] [2024-11-19 22:53:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:02,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:02,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022100488] [2024-11-19 22:53:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022100488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:02,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:02,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:53:02,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781760783] [2024-11-19 22:53:02,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:02,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:53:02,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:02,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:53:02,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:53:02,778 INFO L87 Difference]: Start difference. First operand 295 states and 383 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:03,643 INFO L93 Difference]: Finished difference Result 855 states and 1162 transitions. [2024-11-19 22:53:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:53:03,644 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 65 [2024-11-19 22:53:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:03,646 INFO L225 Difference]: With dead ends: 855 [2024-11-19 22:53:03,646 INFO L226 Difference]: Without dead ends: 743 [2024-11-19 22:53:03,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:53:03,647 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1130 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:03,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2266 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:53:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-19 22:53:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 285. [2024-11-19 22:53:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 278 states have (on average 1.3237410071942446) internal successors, (368), 284 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 368 transitions. [2024-11-19 22:53:03,655 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 368 transitions. Word has length 65 [2024-11-19 22:53:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:03,655 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 368 transitions. [2024-11-19 22:53:03,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 368 transitions. [2024-11-19 22:53:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:53:03,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:03,656 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] [2024-11-19 22:53:03,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:53:03,657 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:03,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1360022849, now seen corresponding path program 1 times [2024-11-19 22:53:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:03,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447651372] [2024-11-19 22:53:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:04,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447651372] [2024-11-19 22:53:04,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447651372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:04,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:04,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-19 22:53:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237658208] [2024-11-19 22:53:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:04,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 22:53:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:04,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 22:53:04,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-19 22:53:04,982 INFO L87 Difference]: Start difference. First operand 285 states and 368 transitions. Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:07,396 INFO L93 Difference]: Finished difference Result 652 states and 877 transitions. [2024-11-19 22:53:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 22:53:07,397 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 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 65 [2024-11-19 22:53:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:07,399 INFO L225 Difference]: With dead ends: 652 [2024-11-19 22:53:07,399 INFO L226 Difference]: Without dead ends: 542 [2024-11-19 22:53:07,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=341, Invalid=1465, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 22:53:07,400 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1133 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 4500 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:07,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 4500 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:53:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-19 22:53:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 296. [2024-11-19 22:53:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 289 states have (on average 1.3217993079584776) internal successors, (382), 295 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 382 transitions. [2024-11-19 22:53:07,408 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 382 transitions. Word has length 65 [2024-11-19 22:53:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:07,408 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 382 transitions. [2024-11-19 22:53:07,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 382 transitions. [2024-11-19 22:53:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:53:07,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:07,409 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] [2024-11-19 22:53:07,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:53:07,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:07,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash -138245905, now seen corresponding path program 1 times [2024-11-19 22:53:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:07,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030140489] [2024-11-19 22:53:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:07,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030140489] [2024-11-19 22:53:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030140489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:07,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:53:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296943708] [2024-11-19 22:53:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:07,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:53:07,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:07,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:53:07,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:53:07,911 INFO L87 Difference]: Start difference. First operand 296 states and 382 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:08,400 INFO L93 Difference]: Finished difference Result 583 states and 792 transitions. [2024-11-19 22:53:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:53:08,401 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 65 [2024-11-19 22:53:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:08,402 INFO L225 Difference]: With dead ends: 583 [2024-11-19 22:53:08,403 INFO L226 Difference]: Without dead ends: 466 [2024-11-19 22:53:08,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:53:08,404 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 1308 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:08,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1512 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-19 22:53:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 285. [2024-11-19 22:53:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 279 states have (on average 1.3189964157706093) internal successors, (368), 284 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 368 transitions. [2024-11-19 22:53:08,411 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 368 transitions. Word has length 65 [2024-11-19 22:53:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:08,411 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 368 transitions. [2024-11-19 22:53:08,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 368 transitions. [2024-11-19 22:53:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 22:53:08,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:08,412 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] [2024-11-19 22:53:08,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:53:08,413 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 914761815, now seen corresponding path program 1 times [2024-11-19 22:53:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250343436] [2024-11-19 22:53:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250343436] [2024-11-19 22:53:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250343436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:08,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:08,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:53:08,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846918366] [2024-11-19 22:53:08,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:08,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:53:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:53:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:53:08,911 INFO L87 Difference]: Start difference. First operand 285 states and 368 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:09,339 INFO L93 Difference]: Finished difference Result 519 states and 709 transitions. [2024-11-19 22:53:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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 65 [2024-11-19 22:53:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:09,340 INFO L225 Difference]: With dead ends: 519 [2024-11-19 22:53:09,340 INFO L226 Difference]: Without dead ends: 350 [2024-11-19 22:53:09,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:53:09,342 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 718 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:09,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 726 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-19 22:53:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 222. [2024-11-19 22:53:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.3287671232876712) internal successors, (291), 221 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2024-11-19 22:53:09,350 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 65 [2024-11-19 22:53:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2024-11-19 22:53:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2024-11-19 22:53:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:53:09,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:09,352 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] [2024-11-19 22:53:09,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 22:53:09,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2098457973, now seen corresponding path program 1 times [2024-11-19 22:53:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693234686] [2024-11-19 22:53:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:09,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:09,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693234686] [2024-11-19 22:53:09,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693234686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:09,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:09,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120543674] [2024-11-19 22:53:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:09,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:09,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:09,566 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:09,856 INFO L93 Difference]: Finished difference Result 371 states and 498 transitions. [2024-11-19 22:53:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:53:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2024-11-19 22:53:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:09,858 INFO L225 Difference]: With dead ends: 371 [2024-11-19 22:53:09,858 INFO L226 Difference]: Without dead ends: 364 [2024-11-19 22:53:09,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:53:09,859 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 472 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:09,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 445 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-19 22:53:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 222. [2024-11-19 22:53:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.3242009132420092) internal successors, (290), 221 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 290 transitions. [2024-11-19 22:53:09,864 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 290 transitions. Word has length 66 [2024-11-19 22:53:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 290 transitions. [2024-11-19 22:53:09,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 290 transitions. [2024-11-19 22:53:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 22:53:09,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:09,865 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] [2024-11-19 22:53:09,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 22:53:09,866 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 476193166, now seen corresponding path program 1 times [2024-11-19 22:53:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666617871] [2024-11-19 22:53:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666617871] [2024-11-19 22:53:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666617871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:10,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:10,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410653933] [2024-11-19 22:53:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:10,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:10,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:10,067 INFO L87 Difference]: Start difference. First operand 222 states and 290 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:10,439 INFO L93 Difference]: Finished difference Result 524 states and 716 transitions. [2024-11-19 22:53:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:10,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 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 66 [2024-11-19 22:53:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:10,442 INFO L225 Difference]: With dead ends: 524 [2024-11-19 22:53:10,442 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 22:53:10,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:53:10,443 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 538 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:10,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 732 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:53:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 22:53:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 222. [2024-11-19 22:53:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 221 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 288 transitions. [2024-11-19 22:53:10,448 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 288 transitions. Word has length 66 [2024-11-19 22:53:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:10,448 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 288 transitions. [2024-11-19 22:53:10,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 288 transitions. [2024-11-19 22:53:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 22:53:10,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:10,449 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] [2024-11-19 22:53:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:53:10,450 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1262128080, now seen corresponding path program 1 times [2024-11-19 22:53:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667016971] [2024-11-19 22:53:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667016971] [2024-11-19 22:53:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667016971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-19 22:53:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133618443] [2024-11-19 22:53:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 22:53:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:11,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 22:53:11,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-11-19 22:53:11,426 INFO L87 Difference]: Start difference. First operand 222 states and 288 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:12,734 INFO L93 Difference]: Finished difference Result 240 states and 308 transitions. [2024-11-19 22:53:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 22:53:12,734 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 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 68 [2024-11-19 22:53:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:12,735 INFO L225 Difference]: With dead ends: 240 [2024-11-19 22:53:12,735 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 22:53:12,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 22:53:12,737 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 389 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:12,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1930 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:53:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 22:53:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2024-11-19 22:53:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 230 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 299 transitions. [2024-11-19 22:53:12,743 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 299 transitions. Word has length 68 [2024-11-19 22:53:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:12,743 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 299 transitions. [2024-11-19 22:53:12,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 299 transitions. [2024-11-19 22:53:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 22:53:12,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:12,744 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] [2024-11-19 22:53:12,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:53:12,745 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:12,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash 989039241, now seen corresponding path program 1 times [2024-11-19 22:53:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374227948] [2024-11-19 22:53:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374227948] [2024-11-19 22:53:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374227948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:13,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-19 22:53:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134994454] [2024-11-19 22:53:13,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 22:53:13,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:13,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 22:53:13,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:53:13,869 INFO L87 Difference]: Start difference. First operand 231 states and 299 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:15,084 INFO L93 Difference]: Finished difference Result 371 states and 494 transitions. [2024-11-19 22:53:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 22:53:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 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 68 [2024-11-19 22:53:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:15,086 INFO L225 Difference]: With dead ends: 371 [2024-11-19 22:53:15,086 INFO L226 Difference]: Without dead ends: 365 [2024-11-19 22:53:15,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 22:53:15,087 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 357 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:15,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2156 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:53:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-19 22:53:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 237. [2024-11-19 22:53:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 234 states have (on average 1.311965811965812) internal successors, (307), 236 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 307 transitions. [2024-11-19 22:53:15,092 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 307 transitions. Word has length 68 [2024-11-19 22:53:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:15,093 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 307 transitions. [2024-11-19 22:53:15,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 307 transitions. [2024-11-19 22:53:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 22:53:15,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:15,094 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] [2024-11-19 22:53:15,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:53:15,094 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:15,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1368297463, now seen corresponding path program 1 times [2024-11-19 22:53:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697342877] [2024-11-19 22:53:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697342877] [2024-11-19 22:53:15,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697342877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:15,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:53:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808362845] [2024-11-19 22:53:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:53:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:53:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:53:15,592 INFO L87 Difference]: Start difference. First operand 237 states and 307 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:16,095 INFO L93 Difference]: Finished difference Result 381 states and 512 transitions. [2024-11-19 22:53:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:53:16,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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 69 [2024-11-19 22:53:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:16,097 INFO L225 Difference]: With dead ends: 381 [2024-11-19 22:53:16,097 INFO L226 Difference]: Without dead ends: 366 [2024-11-19 22:53:16,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:53:16,099 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 614 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:16,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1577 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-19 22:53:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 221. [2024-11-19 22:53:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 219 states have (on average 1.3150684931506849) internal successors, (288), 220 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 288 transitions. [2024-11-19 22:53:16,106 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 288 transitions. Word has length 69 [2024-11-19 22:53:16,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:16,107 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 288 transitions. [2024-11-19 22:53:16,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 288 transitions. [2024-11-19 22:53:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 22:53:16,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:16,107 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] [2024-11-19 22:53:16,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 22:53:16,108 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash 882869858, now seen corresponding path program 1 times [2024-11-19 22:53:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011242095] [2024-11-19 22:53:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:17,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011242095] [2024-11-19 22:53:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011242095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:17,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-19 22:53:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207517761] [2024-11-19 22:53:17,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 22:53:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 22:53:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:53:17,033 INFO L87 Difference]: Start difference. First operand 221 states and 288 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:18,106 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2024-11-19 22:53:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:53:18,106 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 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 69 [2024-11-19 22:53:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:18,108 INFO L225 Difference]: With dead ends: 407 [2024-11-19 22:53:18,108 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 22:53:18,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2024-11-19 22:53:18,108 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 638 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:18,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 2329 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:53:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 22:53:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 216. [2024-11-19 22:53:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 1.3177570093457944) internal successors, (282), 215 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 282 transitions. [2024-11-19 22:53:18,113 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 282 transitions. Word has length 69 [2024-11-19 22:53:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:18,114 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 282 transitions. [2024-11-19 22:53:18,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 282 transitions. [2024-11-19 22:53:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 22:53:18,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:18,115 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] [2024-11-19 22:53:18,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:53:18,115 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:18,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1637741865, now seen corresponding path program 1 times [2024-11-19 22:53:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:18,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142385047] [2024-11-19 22:53:18,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:18,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:18,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142385047] [2024-11-19 22:53:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142385047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:18,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:53:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150811827] [2024-11-19 22:53:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:18,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:53:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:18,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:53:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:53:18,491 INFO L87 Difference]: Start difference. First operand 216 states and 282 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:18,906 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-11-19 22:53:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:53:18,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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 69 [2024-11-19 22:53:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:18,908 INFO L225 Difference]: With dead ends: 342 [2024-11-19 22:53:18,908 INFO L226 Difference]: Without dead ends: 336 [2024-11-19 22:53:18,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:53:18,909 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 267 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:18,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1445 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:53:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-19 22:53:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 204. [2024-11-19 22:53:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3152709359605912) internal successors, (267), 203 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 267 transitions. [2024-11-19 22:53:18,913 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 267 transitions. Word has length 69 [2024-11-19 22:53:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:18,913 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 267 transitions. [2024-11-19 22:53:18,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 267 transitions. [2024-11-19 22:53:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 22:53:18,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:18,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:18,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 22:53:18,915 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:18,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash 262304865, now seen corresponding path program 1 times [2024-11-19 22:53:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:18,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630303713] [2024-11-19 22:53:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:19,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630303713] [2024-11-19 22:53:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630303713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:19,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552929444] [2024-11-19 22:53:19,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:19,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:19,010 INFO L87 Difference]: Start difference. First operand 204 states and 267 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:19,120 INFO L93 Difference]: Finished difference Result 1052 states and 1547 transitions. [2024-11-19 22:53:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:53:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 91 [2024-11-19 22:53:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:19,123 INFO L225 Difference]: With dead ends: 1052 [2024-11-19 22:53:19,123 INFO L226 Difference]: Without dead ends: 946 [2024-11-19 22:53:19,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:53:19,124 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 902 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:19,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 960 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-11-19 22:53:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 308. [2024-11-19 22:53:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.3745928338762214) internal successors, (422), 307 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 422 transitions. [2024-11-19 22:53:19,134 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 422 transitions. Word has length 91 [2024-11-19 22:53:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:19,134 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 422 transitions. [2024-11-19 22:53:19,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 422 transitions. [2024-11-19 22:53:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:53:19,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:19,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:19,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 22:53:19,136 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash -403802728, now seen corresponding path program 1 times [2024-11-19 22:53:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229337514] [2024-11-19 22:53:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:19,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229337514] [2024-11-19 22:53:19,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229337514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:19,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:19,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123350800] [2024-11-19 22:53:19,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:19,236 INFO L87 Difference]: Start difference. First operand 308 states and 422 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:19,323 INFO L93 Difference]: Finished difference Result 1254 states and 1838 transitions. [2024-11-19 22:53:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:19,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 93 [2024-11-19 22:53:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:19,326 INFO L225 Difference]: With dead ends: 1254 [2024-11-19 22:53:19,326 INFO L226 Difference]: Without dead ends: 1044 [2024-11-19 22:53:19,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:19,328 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 651 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:19,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 677 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-11-19 22:53:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 516. [2024-11-19 22:53:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.4252427184466019) internal successors, (734), 515 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 734 transitions. [2024-11-19 22:53:19,340 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 734 transitions. Word has length 93 [2024-11-19 22:53:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:19,341 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 734 transitions. [2024-11-19 22:53:19,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 734 transitions. [2024-11-19 22:53:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:53:19,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:19,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:19,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 22:53:19,343 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:19,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash 638646745, now seen corresponding path program 1 times [2024-11-19 22:53:19,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:19,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490916943] [2024-11-19 22:53:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:19,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:19,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:19,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490916943] [2024-11-19 22:53:19,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490916943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:19,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:19,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:19,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114407051] [2024-11-19 22:53:19,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:19,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:19,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:19,526 INFO L87 Difference]: Start difference. First operand 516 states and 734 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:19,611 INFO L93 Difference]: Finished difference Result 936 states and 1362 transitions. [2024-11-19 22:53:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:19,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 93 [2024-11-19 22:53:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:19,613 INFO L225 Difference]: With dead ends: 936 [2024-11-19 22:53:19,613 INFO L226 Difference]: Without dead ends: 518 [2024-11-19 22:53:19,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:53:19,614 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 140 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:19,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 380 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:19,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-19 22:53:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 516. [2024-11-19 22:53:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.4174757281553398) internal successors, (730), 515 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 730 transitions. [2024-11-19 22:53:19,625 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 730 transitions. Word has length 93 [2024-11-19 22:53:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:19,626 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 730 transitions. [2024-11-19 22:53:19,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 730 transitions. [2024-11-19 22:53:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:53:19,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:19,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:19,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 22:53:19,628 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:19,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 572153233, now seen corresponding path program 1 times [2024-11-19 22:53:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:19,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692208080] [2024-11-19 22:53:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692208080] [2024-11-19 22:53:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692208080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:19,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365341882] [2024-11-19 22:53:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:19,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:19,683 INFO L87 Difference]: Start difference. First operand 516 states and 730 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:19,708 INFO L93 Difference]: Finished difference Result 1300 states and 1888 transitions. [2024-11-19 22:53:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:19,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2024-11-19 22:53:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:19,711 INFO L225 Difference]: With dead ends: 1300 [2024-11-19 22:53:19,711 INFO L226 Difference]: Without dead ends: 882 [2024-11-19 22:53:19,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:19,713 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 89 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:19,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 252 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-19 22:53:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 872. [2024-11-19 22:53:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.4190585533869116) internal successors, (1236), 871 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1236 transitions. [2024-11-19 22:53:19,726 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1236 transitions. Word has length 93 [2024-11-19 22:53:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:19,726 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1236 transitions. [2024-11-19 22:53:19,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1236 transitions. [2024-11-19 22:53:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:53:19,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:19,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:19,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 22:53:19,728 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:19,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1651929496, now seen corresponding path program 1 times [2024-11-19 22:53:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:19,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636340346] [2024-11-19 22:53:19,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:19,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:19,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:19,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636340346] [2024-11-19 22:53:19,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636340346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:19,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:19,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:19,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313268641] [2024-11-19 22:53:19,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:19,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:19,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:19,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:19,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:19,837 INFO L87 Difference]: Start difference. First operand 872 states and 1236 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:19,926 INFO L93 Difference]: Finished difference Result 2620 states and 3785 transitions. [2024-11-19 22:53:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:19,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 93 [2024-11-19 22:53:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:19,932 INFO L225 Difference]: With dead ends: 2620 [2024-11-19 22:53:19,932 INFO L226 Difference]: Without dead ends: 2232 [2024-11-19 22:53:19,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:19,933 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 619 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:19,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 681 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2024-11-19 22:53:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1452. [2024-11-19 22:53:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1451 states have (on average 1.4321157822191593) internal successors, (2078), 1451 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 2078 transitions. [2024-11-19 22:53:19,958 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 2078 transitions. Word has length 93 [2024-11-19 22:53:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:19,959 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 2078 transitions. [2024-11-19 22:53:19,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 2078 transitions. [2024-11-19 22:53:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:53:19,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:19,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:19,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 22:53:19,961 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:19,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -767888488, now seen corresponding path program 1 times [2024-11-19 22:53:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222421285] [2024-11-19 22:53:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:20,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222421285] [2024-11-19 22:53:20,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222421285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:20,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:20,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:20,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502767768] [2024-11-19 22:53:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:20,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:20,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:20,083 INFO L87 Difference]: Start difference. First operand 1452 states and 2078 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:20,169 INFO L93 Difference]: Finished difference Result 3006 states and 4347 transitions. [2024-11-19 22:53:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:20,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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 93 [2024-11-19 22:53:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:20,176 INFO L225 Difference]: With dead ends: 3006 [2024-11-19 22:53:20,176 INFO L226 Difference]: Without dead ends: 2618 [2024-11-19 22:53:20,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:20,177 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 585 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:20,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 748 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2024-11-19 22:53:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1838. [2024-11-19 22:53:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.437125748502994) internal successors, (2640), 1837 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2640 transitions. [2024-11-19 22:53:20,204 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2640 transitions. Word has length 93 [2024-11-19 22:53:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:20,205 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2640 transitions. [2024-11-19 22:53:20,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2640 transitions. [2024-11-19 22:53:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 22:53:20,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:20,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:20,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 22:53:20,207 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2122104904, now seen corresponding path program 1 times [2024-11-19 22:53:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766603392] [2024-11-19 22:53:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766603392] [2024-11-19 22:53:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766603392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:20,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586209513] [2024-11-19 22:53:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:20,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:20,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:20,302 INFO L87 Difference]: Start difference. First operand 1838 states and 2640 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:20,329 INFO L93 Difference]: Finished difference Result 5174 states and 7454 transitions. [2024-11-19 22:53:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-19 22:53:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:20,339 INFO L225 Difference]: With dead ends: 5174 [2024-11-19 22:53:20,339 INFO L226 Difference]: Without dead ends: 3434 [2024-11-19 22:53:20,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:20,342 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 73 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:20,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2024-11-19 22:53:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3288. [2024-11-19 22:53:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 3287 states have (on average 1.431092181320353) internal successors, (4704), 3287 states have internal predecessors, (4704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4704 transitions. [2024-11-19 22:53:20,389 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4704 transitions. Word has length 94 [2024-11-19 22:53:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:20,390 INFO L471 AbstractCegarLoop]: Abstraction has 3288 states and 4704 transitions. [2024-11-19 22:53:20,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4704 transitions. [2024-11-19 22:53:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 22:53:20,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:20,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:20,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 22:53:20,392 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:20,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1022881993, now seen corresponding path program 1 times [2024-11-19 22:53:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:20,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568452656] [2024-11-19 22:53:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:20,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568452656] [2024-11-19 22:53:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568452656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530538721] [2024-11-19 22:53:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:20,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:20,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:20,492 INFO L87 Difference]: Start difference. First operand 3288 states and 4704 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-11-19 22:53:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:20,525 INFO L93 Difference]: Finished difference Result 9380 states and 13394 transitions. [2024-11-19 22:53:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:20,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2024-11-19 22:53:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:20,546 INFO L225 Difference]: With dead ends: 9380 [2024-11-19 22:53:20,546 INFO L226 Difference]: Without dead ends: 6190 [2024-11-19 22:53:20,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:20,552 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 66 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:20,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6190 states. [2024-11-19 22:53:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6190 to 5900. [2024-11-19 22:53:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5900 states, 5899 states have (on average 1.4178674351585014) internal successors, (8364), 5899 states have internal predecessors, (8364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5900 states to 5900 states and 8364 transitions. [2024-11-19 22:53:20,640 INFO L78 Accepts]: Start accepts. Automaton has 5900 states and 8364 transitions. Word has length 95 [2024-11-19 22:53:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:20,641 INFO L471 AbstractCegarLoop]: Abstraction has 5900 states and 8364 transitions. [2024-11-19 22:53:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-11-19 22:53:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5900 states and 8364 transitions. [2024-11-19 22:53:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 22:53:20,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:20,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 22:53:20,645 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash -369091068, now seen corresponding path program 1 times [2024-11-19 22:53:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603666357] [2024-11-19 22:53:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:20,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603666357] [2024-11-19 22:53:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603666357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:20,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:20,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192037628] [2024-11-19 22:53:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:20,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:20,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:20,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:20,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:20,741 INFO L87 Difference]: Start difference. First operand 5900 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:20,786 INFO L93 Difference]: Finished difference Result 16928 states and 23870 transitions. [2024-11-19 22:53:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:20,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-19 22:53:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:20,808 INFO L225 Difference]: With dead ends: 16928 [2024-11-19 22:53:20,808 INFO L226 Difference]: Without dead ends: 11126 [2024-11-19 22:53:20,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:20,818 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 56 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:20,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 333 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11126 states. [2024-11-19 22:53:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11126 to 10548. [2024-11-19 22:53:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 1.3983123162984734) internal successors, (14748), 10547 states have internal predecessors, (14748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14748 transitions. [2024-11-19 22:53:20,954 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14748 transitions. Word has length 96 [2024-11-19 22:53:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:20,954 INFO L471 AbstractCegarLoop]: Abstraction has 10548 states and 14748 transitions. [2024-11-19 22:53:20,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14748 transitions. [2024-11-19 22:53:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:53:20,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:20,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:20,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 22:53:20,984 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:20,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash -553088427, now seen corresponding path program 1 times [2024-11-19 22:53:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:20,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692424342] [2024-11-19 22:53:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692424342] [2024-11-19 22:53:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692424342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:21,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:21,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407600844] [2024-11-19 22:53:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:21,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:21,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:21,216 INFO L87 Difference]: Start difference. First operand 10548 states and 14748 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:21,258 INFO L93 Difference]: Finished difference Result 10934 states and 15261 transitions. [2024-11-19 22:53:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:21,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2024-11-19 22:53:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:21,277 INFO L225 Difference]: With dead ends: 10934 [2024-11-19 22:53:21,278 INFO L226 Difference]: Without dead ends: 10932 [2024-11-19 22:53:21,283 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-11-19 22:53:21,283 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:21,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 764 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10932 states. [2024-11-19 22:53:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10932 to 10932. [2024-11-19 22:53:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10932 states, 10931 states have (on average 1.3770011892781997) internal successors, (15052), 10931 states have internal predecessors, (15052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10932 states to 10932 states and 15052 transitions. [2024-11-19 22:53:21,424 INFO L78 Accepts]: Start accepts. Automaton has 10932 states and 15052 transitions. Word has length 97 [2024-11-19 22:53:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:21,425 INFO L471 AbstractCegarLoop]: Abstraction has 10932 states and 15052 transitions. [2024-11-19 22:53:21,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 10932 states and 15052 transitions. [2024-11-19 22:53:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 22:53:21,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:21,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:21,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 22:53:21,427 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:21,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -404836723, now seen corresponding path program 1 times [2024-11-19 22:53:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:21,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51549352] [2024-11-19 22:53:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51549352] [2024-11-19 22:53:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51549352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:53:21,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48515701] [2024-11-19 22:53:21,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:21,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:53:21,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:21,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:53:21,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:53:21,534 INFO L87 Difference]: Start difference. First operand 10932 states and 15052 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:21,658 INFO L93 Difference]: Finished difference Result 20606 states and 28497 transitions. [2024-11-19 22:53:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:53:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 97 [2024-11-19 22:53:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:21,689 INFO L225 Difference]: With dead ends: 20606 [2024-11-19 22:53:21,689 INFO L226 Difference]: Without dead ends: 18188 [2024-11-19 22:53:21,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:21,698 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 646 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:21,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 747 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:53:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18188 states. [2024-11-19 22:53:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18188 to 13348. [2024-11-19 22:53:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13348 states, 13347 states have (on average 1.3770884843035889) internal successors, (18380), 13347 states have internal predecessors, (18380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13348 states to 13348 states and 18380 transitions. [2024-11-19 22:53:21,953 INFO L78 Accepts]: Start accepts. Automaton has 13348 states and 18380 transitions. Word has length 97 [2024-11-19 22:53:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:21,954 INFO L471 AbstractCegarLoop]: Abstraction has 13348 states and 18380 transitions. [2024-11-19 22:53:21,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13348 states and 18380 transitions. [2024-11-19 22:53:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 22:53:21,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:21,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:21,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 22:53:21,956 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:21,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:21,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1477016020, now seen corresponding path program 1 times [2024-11-19 22:53:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:21,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641847195] [2024-11-19 22:53:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:21,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641847195] [2024-11-19 22:53:22,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641847195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:22,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177171072] [2024-11-19 22:53:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:22,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:22,056 INFO L87 Difference]: Start difference. First operand 13348 states and 18380 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:22,136 INFO L93 Difference]: Finished difference Result 34744 states and 47782 transitions. [2024-11-19 22:53:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2024-11-19 22:53:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:22,187 INFO L225 Difference]: With dead ends: 34744 [2024-11-19 22:53:22,187 INFO L226 Difference]: Without dead ends: 21494 [2024-11-19 22:53:22,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:22,205 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:22,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 336 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21494 states. [2024-11-19 22:53:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21494 to 20084. [2024-11-19 22:53:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20084 states, 20083 states have (on average 1.3553751929492606) internal successors, (27220), 20083 states have internal predecessors, (27220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 27220 transitions. [2024-11-19 22:53:22,462 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 27220 transitions. Word has length 98 [2024-11-19 22:53:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:22,462 INFO L471 AbstractCegarLoop]: Abstraction has 20084 states and 27220 transitions. [2024-11-19 22:53:22,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 27220 transitions. [2024-11-19 22:53:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 22:53:22,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:22,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:22,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 22:53:22,468 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:22,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash -659580428, now seen corresponding path program 1 times [2024-11-19 22:53:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117042375] [2024-11-19 22:53:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117042375] [2024-11-19 22:53:22,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117042375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:22,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:22,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:53:22,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223069124] [2024-11-19 22:53:22,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:22,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:53:22,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:22,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:53:22,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:22,561 INFO L87 Difference]: Start difference. First operand 20084 states and 27220 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:22,778 INFO L93 Difference]: Finished difference Result 40072 states and 54334 transitions. [2024-11-19 22:53:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:53:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-19 22:53:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:22,802 INFO L225 Difference]: With dead ends: 40072 [2024-11-19 22:53:22,802 INFO L226 Difference]: Without dead ends: 20086 [2024-11-19 22:53:22,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:53:22,817 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:22,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 310 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:53:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20086 states. [2024-11-19 22:53:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20086 to 20084. [2024-11-19 22:53:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20084 states, 20083 states have (on average 1.3378479310859932) internal successors, (26868), 20083 states have internal predecessors, (26868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20084 states to 20084 states and 26868 transitions. [2024-11-19 22:53:23,045 INFO L78 Accepts]: Start accepts. Automaton has 20084 states and 26868 transitions. Word has length 124 [2024-11-19 22:53:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:23,045 INFO L471 AbstractCegarLoop]: Abstraction has 20084 states and 26868 transitions. [2024-11-19 22:53:23,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 20084 states and 26868 transitions. [2024-11-19 22:53:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 22:53:23,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:23,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:23,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 22:53:23,050 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:23,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash -448021413, now seen corresponding path program 1 times [2024-11-19 22:53:23,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:23,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684773741] [2024-11-19 22:53:23,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:23,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684773741] [2024-11-19 22:53:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684773741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:53:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366331455] [2024-11-19 22:53:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:23,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:53:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:23,578 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-11-19 22:53:23,579 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-11-19 22:53:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:23,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 22:53:23,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:53:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:24,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:53:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:26,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366331455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:53:26,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:53:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-11-19 22:53:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846094674] [2024-11-19 22:53:26,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:53:26,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 22:53:26,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 22:53:26,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:53:26,264 INFO L87 Difference]: Start difference. First operand 20084 states and 26868 transitions. Second operand has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 27 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:30,239 INFO L93 Difference]: Finished difference Result 163975 states and 217806 transitions. [2024-11-19 22:53:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-11-19 22:53:30,240 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 27 states have internal predecessors, (293), 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 124 [2024-11-19 22:53:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:30,395 INFO L225 Difference]: With dead ends: 163975 [2024-11-19 22:53:30,395 INFO L226 Difference]: Without dead ends: 143989 [2024-11-19 22:53:30,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4678 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2245, Invalid=13007, Unknown=0, NotChecked=0, Total=15252 [2024-11-19 22:53:30,440 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 2386 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2386 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:30,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2386 Valid, 3131 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 22:53:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143989 states. [2024-11-19 22:53:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143989 to 72621. [2024-11-19 22:53:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72621 states, 72620 states have (on average 1.3245800055081245) internal successors, (96191), 72620 states have internal predecessors, (96191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72621 states to 72621 states and 96191 transitions. [2024-11-19 22:53:31,953 INFO L78 Accepts]: Start accepts. Automaton has 72621 states and 96191 transitions. Word has length 124 [2024-11-19 22:53:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:31,953 INFO L471 AbstractCegarLoop]: Abstraction has 72621 states and 96191 transitions. [2024-11-19 22:53:31,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 27 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 72621 states and 96191 transitions. [2024-11-19 22:53:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 22:53:31,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:31,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:31,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:53:32,166 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,SelfDestructingSolverStorable39 [2024-11-19 22:53:32,167 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:32,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash 645605547, now seen corresponding path program 1 times [2024-11-19 22:53:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680381702] [2024-11-19 22:53:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 22:53:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680381702] [2024-11-19 22:53:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680381702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:53:32,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:53:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:53:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184658784] [2024-11-19 22:53:32,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:53:32,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:53:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:53:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:53:32,398 INFO L87 Difference]: Start difference. First operand 72621 states and 96191 transitions. Second operand has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:33,469 INFO L93 Difference]: Finished difference Result 219458 states and 290154 transitions. [2024-11-19 22:53:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:53:33,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 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 125 [2024-11-19 22:53:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:33,787 INFO L225 Difference]: With dead ends: 219458 [2024-11-19 22:53:33,788 INFO L226 Difference]: Without dead ends: 146930 [2024-11-19 22:53:33,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:53:33,843 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 448 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:33,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 591 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:53:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146930 states. [2024-11-19 22:53:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146930 to 72621. [2024-11-19 22:53:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72621 states, 72620 states have (on average 1.3245524648857063) internal successors, (96189), 72620 states have internal predecessors, (96189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72621 states to 72621 states and 96189 transitions. [2024-11-19 22:53:35,328 INFO L78 Accepts]: Start accepts. Automaton has 72621 states and 96189 transitions. Word has length 125 [2024-11-19 22:53:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:35,328 INFO L471 AbstractCegarLoop]: Abstraction has 72621 states and 96189 transitions. [2024-11-19 22:53:35,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 72621 states and 96189 transitions. [2024-11-19 22:53:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 22:53:35,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:35,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:35,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-19 22:53:35,339 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:35,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:35,339 INFO L85 PathProgramCache]: Analyzing trace with hash -784675966, now seen corresponding path program 1 times [2024-11-19 22:53:35,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:35,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064617621] [2024-11-19 22:53:35,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:35,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:35,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064617621] [2024-11-19 22:53:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064617621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:53:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127325589] [2024-11-19 22:53:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:35,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:53:35,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:35,948 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-11-19 22:53:35,952 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-11-19 22:53:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:36,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 22:53:36,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:53:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:36,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:53:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:38,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127325589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:53:38,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:53:38,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-19 22:53:38,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438489286] [2024-11-19 22:53:38,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:53:38,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 22:53:38,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:53:38,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 22:53:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-11-19 22:53:38,199 INFO L87 Difference]: Start difference. First operand 72621 states and 96189 transitions. Second operand has 29 states, 29 states have (on average 10.96551724137931) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:53:39,702 INFO L93 Difference]: Finished difference Result 296740 states and 395601 transitions. [2024-11-19 22:53:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 22:53:39,702 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.96551724137931) internal successors, (318), 28 states have internal predecessors, (318), 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 127 [2024-11-19 22:53:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:53:40,310 INFO L225 Difference]: With dead ends: 296740 [2024-11-19 22:53:40,310 INFO L226 Difference]: Without dead ends: 224224 [2024-11-19 22:53:40,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=553, Invalid=1897, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 22:53:40,409 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1451 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:53:40,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 1282 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:53:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224224 states. [2024-11-19 22:53:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224224 to 174316. [2024-11-19 22:53:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174316 states, 174315 states have (on average 1.322043427129048) internal successors, (230452), 174315 states have internal predecessors, (230452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174316 states to 174316 states and 230452 transitions. [2024-11-19 22:53:42,892 INFO L78 Accepts]: Start accepts. Automaton has 174316 states and 230452 transitions. Word has length 127 [2024-11-19 22:53:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:53:42,893 INFO L471 AbstractCegarLoop]: Abstraction has 174316 states and 230452 transitions. [2024-11-19 22:53:42,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.96551724137931) internal successors, (318), 28 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:53:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 174316 states and 230452 transitions. [2024-11-19 22:53:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 22:53:42,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:53:42,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:53:42,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 22:53:43,105 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,SelfDestructingSolverStorable41 [2024-11-19 22:53:43,106 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-19 22:53:43,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:53:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1031932154, now seen corresponding path program 1 times [2024-11-19 22:53:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:53:43,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627141273] [2024-11-19 22:53:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:53:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:53:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627141273] [2024-11-19 22:53:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627141273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:53:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200047910] [2024-11-19 22:53:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:53:44,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:53:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:53:44,291 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-11-19 22:53:44,293 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-11-19 22:53:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:53:44,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-19 22:53:44,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:53:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:53:48,051 INFO L311 TraceCheckSpWp]: Computing backward predicates...